| /external/google-breakpad/src/processor/ |
| static_map_iterator-inl.h | 44 template<typename Key, typename Value, typename Compare>
45 StaticMapIterator<Key, Value, Compare>::StaticMapIterator(const char* base,
57 template<typename Key, typename Value, typename Compare>
58 StaticMapIterator<Key, Value, Compare>&
59 StaticMapIterator<Key, Value, Compare>::operator++() {
68 template<typename Key, typename Value, typename Compare>
69 StaticMapIterator<Key, Value, Compare>
70 StaticMapIterator<Key, Value, Compare>::operator++(int postfix_operator) {
75 StaticMapIterator<Key, Value, Compare> tmp = *this;
80 template<typename Key, typename Value, typename Compare>
[all...] |
| static_map-inl.h | 45 template<typename Key, typename Value, typename Compare>
46 StaticMap<Key, Value, Compare>::StaticMap(const char* raw_data)
60 template<typename Key, typename Value, typename Compare>
61 StaticMapIterator<Key, Value, Compare>
62 StaticMap<Key, Value, Compare>::find(const Key &key) const {
81 template<typename Key, typename Value, typename Compare>
82 StaticMapIterator<Key, Value, Compare>
83 StaticMap<Key, Value, Compare>::lower_bound(const Key &key) const {
102 template<typename Key, typename Value, typename Compare>
103 StaticMapIterator<Key, Value, Compare>
[all...] |
| static_map_iterator.h | 47 template<typename Key, typename Value, typename Compare> class StaticMap;
51 template<typename Key, typename Value, typename Compare>
87 friend class StaticMap<Key, Value, Compare>;
|
| /external/webrtc/webrtc/libjingle/xmllite/ |
| qname.h | 49 int Compare(const StaticQName& other) const;
50 int Compare(const QName& other) const;
53 return Compare(other) == 0;
56 return Compare(other) == 0;
59 return Compare(other) != 0;
62 return Compare(other) != 0;
65 return Compare(other) < 0;
74 return other.Compare(*this) == 0;
78 return other.Compare(*this) != 0;
|
| /external/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 27 class Compare = std::less<typename Sequence::value_type> >
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
32 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
37 const Compare &compare = Compare(),
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| PriorityQueue.h | 27 class Compare = std::less<typename Sequence::value_type> >
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
32 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
37 const Compare &compare = Compare(),
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 27 class Compare = std::less<typename Sequence::value_type> >
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
32 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
37 const Compare &compare = Compare(),
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 27 class Compare = std::less<typename Sequence::value_type> >
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
32 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
37 const Compare &compare = Compare(),
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 27 class Compare = std::less<typename Sequence::value_type> >
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
32 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
37 const Compare &compare = Compare(),
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 27 class Compare = std::less<typename Sequence::value_type> >
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
32 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
37 const Compare &compare = Compare(),
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 27 class Compare = std::less<typename Sequence::value_type> >
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
32 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
37 const Compare &compare = Compare(),
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 27 class Compare = std::less<typename Sequence::value_type> >
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
32 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
37 const Compare &compare = Compare(),
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 27 class Compare = std::less<typename Sequence::value_type> >
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
32 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
37 const Compare &compare = Compare(),
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 27 class Compare = std::less<typename Sequence::value_type> >
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
32 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
37 const Compare &compare = Compare(),
[all...] |
| /external/v8/src/zone/ |
| zone-containers.h | 72 template <typename T, typename Compare = std::less<T>>
74 : public std::priority_queue<T, ZoneVector<T>, Compare> {
78 : std::priority_queue<T, ZoneVector<T>, Compare>(Compare(),
104 template <typename K, typename Compare = std::less<K>>
105 class ZoneSet : public std::set<K, Compare, zone_allocator<K>> {
109 : std::set<K, Compare, zone_allocator<K>>(Compare(),
115 template <typename K, typename V, typename Compare = std::less<K>>
117 : public std::map<K, V, Compare, zone_allocator<std::pair<const K, V>>>
[all...] |
| /frameworks/av/media/libstagefright/foundation/include/media/stagefright/foundation/ |
| AStringUtils.h | 26 static int Compare(const char *a, const char *b, size_t len, bool ignoreCase);
|
| /external/protobuf/src/google/protobuf/util/ |
| field_comparator_test.cc | 68 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL));
75 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL));
82 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL));
91 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL));
95 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL));
104 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL));
108 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL));
118 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL));
122 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL));
132 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL))
[all...] |
| /external/llvm/lib/Target/SystemZ/ |
| SystemZElimCompare.cpp | 12 // (2) fuses compares and branches into COMPARE AND BRANCH instructions
28 #define DEBUG_TYPE "systemz-elim-compare"
32 STATISTIC(FusedComparisons, "Number of fused compare-and-branch instructions");
74 bool convertToBRCT(MachineInstr &MI, MachineInstr &Compare,
77 bool adjustCCMasksForInstr(MachineInstr &MI, MachineInstr &Compare,
79 bool optimizeCompareZero(MachineInstr &Compare,
81 bool fuseCompareOperations(MachineInstr &Compare,
149 // same way as compare instruction.
151 // If we during isel used a load-and-test as a compare with 0, the
159 // Return the source register of Compare, which is the unknown valu
[all...] |
| /prebuilts/go/darwin-x86/src/bytes/ |
| compare_test.go | 43 cmp := Compare(tt.a, tt.b)
45 t.Errorf(`Compare(%q, %q) = %v`, tt.a, tt.b, cmp)
52 if Compare(b, b) != 0 {
55 if Compare(b, b[:1]) != 1 {
75 cmp := Compare(a[:len], b[:len])
80 cmp = Compare(a[:len-1], b[:len])
84 cmp = Compare(a[:len], b[:len-1])
91 cmp = Compare(a[:len], b[:len])
96 cmp = Compare(a[:len], b[:len])
109 if Compare(b1, b2) != 0
[all...] |
| /prebuilts/go/linux-x86/src/bytes/ |
| compare_test.go | 43 cmp := Compare(tt.a, tt.b)
45 t.Errorf(`Compare(%q, %q) = %v`, tt.a, tt.b, cmp)
52 if Compare(b, b) != 0 {
55 if Compare(b, b[:1]) != 1 {
75 cmp := Compare(a[:len], b[:len])
80 cmp = Compare(a[:len-1], b[:len])
84 cmp = Compare(a[:len], b[:len-1])
91 cmp = Compare(a[:len], b[:len])
96 cmp = Compare(a[:len], b[:len])
109 if Compare(b1, b2) != 0
[all...] |
| /prebuilts/go/darwin-x86/src/strings/ |
| compare.go | 7 // Compare returns an integer comparing two strings lexicographically.
10 // Compare is included only for symmetry with package bytes.
13 func Compare(a, b string) int {
16 // using strings.Compare. Basically no one should use strings.Compare.
20 // using strings.Compare, can benefit.
|
| /prebuilts/go/linux-x86/src/strings/ |
| compare.go | 7 // Compare returns an integer comparing two strings lexicographically.
10 // Compare is included only for symmetry with package bytes.
13 func Compare(a, b string) int {
16 // using strings.Compare. Basically no one should use strings.Compare.
20 // using strings.Compare, can benefit.
|
| /external/libcxx/test/std/containers/unord/unord.map/ |
| swap_member.pass.cpp | 33 typedef test_compare<std::equal_to<int> > Compare;
35 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
36 C c1(0, Hash(1), Compare(1), Alloc(1, 1));
37 C c2(0, Hash(2), Compare(2), Alloc(1, 2));
44 assert(c1.key_eq() == Compare(2));
53 assert(c2.key_eq() == Compare(1));
61 typedef test_compare<std::equal_to<int> > Compare;
63 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
76 C c1(0, Hash(1), Compare(1), Alloc(1, 1));
77 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(1, 2))
[all...] |
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.swap/ |
| swap_non_member.pass.cpp | 33 typedef test_compare<std::equal_to<int> > Compare;
35 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
36 C c1(0, Hash(1), Compare(1), Alloc(1, 1));
37 C c2(0, Hash(2), Compare(2), Alloc(1, 2));
44 assert(c1.key_eq() == Compare(2));
53 assert(c2.key_eq() == Compare(1));
61 typedef test_compare<std::equal_to<int> > Compare;
63 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
76 C c1(0, Hash(1), Compare(1), Alloc(1, 1));
77 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(1, 2))
[all...] |
| /external/libcxx/test/std/containers/unord/unord.multiset/ |
| swap_member.pass.cpp | 32 typedef test_compare<std::equal_to<int> > Compare;
34 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C;
35 C c1(0, Hash(1), Compare(1), Alloc(1, 1));
36 C c2(0, Hash(2), Compare(2), Alloc(1, 2));
43 assert(c1.key_eq() == Compare(2));
52 assert(c2.key_eq() == Compare(1));
60 typedef test_compare<std::equal_to<int> > Compare;
62 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C;
75 C c1(0, Hash(1), Compare(1), Alloc(1, 1));
76 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(1, 2))
[all...] |
