| /external/libchrome/base/posix/ |
| global_descriptors.cc | 66 void GlobalDescriptors::Set(Key key, int fd) {
67 Set(key, fd, base::MemoryMappedFile::Region::kWholeFile);
70 void GlobalDescriptors::Set(Key key,
|
| /external/libmojo/mojo/edk/system/ |
| atomic_flag.h | 14 // AtomicFlag is a boolean flag that can be set and tested atomically. It is
22 // flag_.Set(true);
31 // flag_.Set(false);
38 void Set(bool value) {
|
| /external/llvm/include/llvm/ADT/ |
| SmallSet.h | 20 #include <set>
24 /// SmallSet - This maintains a set of unique values, optimizing for the case
25 /// when the set is small (less than N). In this case, the set can be
26 /// maintained with no mallocs. If the set gets large, we expand to using an
27 /// std::set to maintain reasonable lookup times.
29 /// Note that this set does not provide a way to iterate over members in the
30 /// set.
37 std::set<T, C> Set;
[all...] |
| /external/llvm/unittests/ADT/ |
| SparseMultiSetTest.cpp | 19 // Empty set tests.
21 USet Set;
22 EXPECT_TRUE(Set.empty());
23 EXPECT_EQ(0u, Set.size());
25 Set.setUniverse(10);
27 // Lookups on empty set.
28 EXPECT_TRUE(Set.find(0) == Set.end());
29 EXPECT_TRUE(Set.find(9) == Set.end())
[all...] |
| SparseSetTest.cpp | 19 // Empty set tests.
21 USet Set;
22 EXPECT_TRUE(Set.empty());
23 EXPECT_TRUE(Set.begin() == Set.end());
24 EXPECT_EQ(0u, Set.size());
26 Set.setUniverse(10);
28 // Lookups on empty set.
29 EXPECT_TRUE(Set.find(0) == Set.end())
[all...] |
| /external/pdfium/core/fpdfdoc/ |
| cpvt_wordrange.h | 29 void Set(const CPVT_WordPlace& begin, const CPVT_WordPlace& end) {
|
| /external/pdfium/fxbarcode/common/ |
| BC_CommonBitArray.cpp | 62 void CBC_CommonBitArray::Set(size_t i) {
|
| BC_CommonBitMatrix.cpp | 60 void CBC_CommonBitMatrix::Set(int32_t x, int32_t y) {
|
| BC_CommonByteArray.cpp | 51 void CBC_CommonByteArray::Set(int32_t index, int32_t value) {
82 void CBC_CommonByteArray::Set(const uint8_t* source,
91 void CBC_CommonByteArray::Set(std::vector<uint8_t>* source,
|
| BC_CommonByteMatrix.cpp | 47 void CBC_CommonByteMatrix::Set(int32_t x, int32_t y, int32_t value) {
50 void CBC_CommonByteMatrix::Set(int32_t x, int32_t y, uint8_t value) {
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| SmallSet.h | 19 #include <set>
23 /// SmallSet - This maintains a set of unique values, optimizing for the case
24 /// when the set is small (less than N). In this case, the set can be
25 /// maintained with no mallocs. If the set gets large, we expand to using an
26 /// std::set to maintain reasonable lookup times.
28 /// Note that this set does not provide a way to iterate over members in the
29 /// set.
36 std::set<T> Set;
[all...] |
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| SmallSet.h | 23 #include <set>
28 /// SmallSet - This maintains a set of unique values, optimizing for the case
29 /// when the set is small (less than N). In this case, the set can be
30 /// maintained with no mallocs. If the set gets large, we expand to using an
31 /// std::set to maintain reasonable lookup times.
33 /// Note that this set does not provide a way to iterate over members in the
34 /// set.
41 std::set<T, C> Set;
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| cuda_device_array.h | 34 // ptrs.Set(i, ...);
67 void Set(int index, ValueType val) {
|
| /external/tensorflow/tensorflow/core/lib/monitoring/ |
| mobile_gauge.h | 35 void Set(const T& value) {}
|
| /external/toolchain-utils/crosperf/ |
| field.py | 17 def Set(self, value, parse=True):
|
| /external/v8/src/compiler/ |
| node-marker.h | 31 V8_INLINE void Set(Node* node, Mark mark) {
51 // set to State(0) in constant time.
54 // (efficiently) detect invalid use of an older NodeMarker. Namely, if you set a
55 // node with a NodeMarker, and then get or set that node with an older
70 V8_INLINE void Set(Node* node, State state) {
71 NodeMarkerBase::Set(node, static_cast<Mark>(state));
|
| /external/webrtc/webrtc/common_video/libyuv/ |
| scaler.cc | 30 int Scaler::Set(int src_width, int src_height,
|
| /external/webrtc/webrtc/system_wrappers/include/ |
| ntp_time.h | 33 void Set(uint32_t seconds, uint32_t fractions) {
|
| /external/webrtc/webrtc/voice_engine/test/auto_test/fakes/ |
| loudest_filter.h | 32 void Set(int audio_level, uint32_t last_time_ms) {
|
| /frameworks/av/media/libstagefright/codecs/common/include/ |
| voMem.h | 45 VO_U32 (VO_API * Set) (VO_S32 uID, VO_PTR pBuff, VO_U8 uValue, VO_U32 uSize);
|
| /hardware/qcom/display/msm8909/libdrmutils/ |
| drm_logger.h | 45 static void Set(DRMLogger *logger) { s_instance = logger; }
|
| /hardware/qcom/display/msm8909w_3100/libdrmutils/ |
| drm_logger.h | 45 static void Set(DRMLogger *logger) { s_instance = logger; }
|
| /hardware/qcom/display/msm8998/libdrmutils/ |
| drm_logger.h | 45 static void Set(DRMLogger *logger) { s_instance = logger; }
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| SmallSet.h | 23 #include <set>
28 /// SmallSet - This maintains a set of unique values, optimizing for the case
29 /// when the set is small (less than N). In this case, the set can be
30 /// maintained with no mallocs. If the set gets large, we expand to using an
31 /// std::set to maintain reasonable lookup times.
33 /// Note that this set does not provide a way to iterate over members in the
34 /// set.
41 std::set<T, C> Set;
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/DebugInfo/DWARF/ |
| DWARFDebugPubTable.h | 38 /// Each table consists of sets of variable length entries. Each set describes
42 struct Set {
43 /// The total length of the entries for that set, not including the length
52 /// compilation unit header referenced by the set.
63 std::vector<Set> Sets;
74 ArrayRef<Set> getData() { return Sets; }
|
