Home
last modified time | relevance | path

Searched refs:Compare (Results 1 – 25 of 326) sorted by relevance

12345678910>>...14

/external/google-breakpad/src/processor/
Dstatic_map_iterator-inl.h44 template<typename Key, typename Value, typename Compare>
45 StaticMapIterator<Key, Value, Compare>::StaticMapIterator(const char* base, in StaticMapIterator()
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 …]
Dstatic_map-inl.h45 template<typename Key, typename Value, typename Compare>
46 StaticMap<Key, Value, Compare>::StaticMap(const char* raw_data) in StaticMap()
60 template<typename Key, typename Value, typename Compare>
61 StaticMapIterator<Key, Value, Compare>
62 StaticMap<Key, Value, Compare>::find(const Key &key) const { in find()
81 template<typename Key, typename Value, typename Compare>
82 StaticMapIterator<Key, Value, Compare>
83 StaticMap<Key, Value, Compare>::lower_bound(const Key &key) const { in lower_bound()
102 template<typename Key, typename Value, typename Compare>
103 StaticMapIterator<Key, Value, Compare>
[all …]
Dstatic_map.h82 template<typename Key, typename Value, typename Compare = DefaultCompare<Key> >
85 typedef StaticMapIterator<Key, Value, Compare> iterator;
86 typedef StaticMapIterator<Key, Value, Compare> const_iterator;
139 Compare compare_;
Dstatic_map_iterator.h47 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/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.swap/
Dswap_non_member.pass.cpp30 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
32 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C; in main()
34 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
35 C c2(0, Hash(2), Compare(2), Alloc(2)); in main()
42 assert(c1.key_eq() == Compare(2)); in main()
51 assert(c2.key_eq() == Compare(1)); in main()
59 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
61 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C; in main()
74 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
75 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2)); in main()
[all …]
/external/libcxx/test/std/containers/unord/unord.multiset/
Dswap_member.pass.cpp30 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
32 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C; in main()
34 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
35 C c2(0, Hash(2), Compare(2), Alloc(2)); in main()
42 assert(c1.key_eq() == Compare(2)); in main()
51 assert(c2.key_eq() == Compare(1)); in main()
59 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
61 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C; in main()
74 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
75 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2)); in main()
[all …]
/external/libcxx/test/std/containers/unord/unord.set/
Dswap_member.pass.cpp30 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
32 typedef std::unordered_set<int, Hash, Compare, Alloc> C; in main()
34 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
35 C c2(0, Hash(2), Compare(2), Alloc(2)); in main()
42 assert(c1.key_eq() == Compare(2)); in main()
51 assert(c2.key_eq() == Compare(1)); in main()
59 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
61 typedef std::unordered_set<int, Hash, Compare, Alloc> C; in main()
74 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
75 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2)); in main()
[all …]
/external/libcxx/test/std/containers/unord/unord.set/unord.set.swap/
Dswap_non_member.pass.cpp30 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
32 typedef std::unordered_set<int, Hash, Compare, Alloc> C; in main()
34 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
35 C c2(0, Hash(2), Compare(2), Alloc(2)); in main()
42 assert(c1.key_eq() == Compare(2)); in main()
51 assert(c2.key_eq() == Compare(1)); in main()
59 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
61 typedef std::unordered_set<int, Hash, Compare, Alloc> C; in main()
74 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
75 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2)); in main()
[all …]
/external/llvm/lib/Target/SystemZ/
DSystemZElimCompare.cpp71 bool convertToBRCT(MachineInstr *MI, MachineInstr *Compare,
74 bool adjustCCMasksForInstr(MachineInstr *MI, MachineInstr *Compare,
76 bool optimizeCompareZero(MachineInstr *Compare,
78 bool fuseCompareAndBranch(MachineInstr *Compare,
160 static unsigned getCompareSourceReg(MachineInstr *Compare) { in getCompareSourceReg() argument
162 if (Compare->isCompare()) in getCompareSourceReg()
163 reg = Compare->getOperand(0).getReg(); in getCompareSourceReg()
164 else if (isLoadAndTestAsCmp(Compare)) in getCompareSourceReg()
165 reg = Compare->getOperand(1).getReg(); in getCompareSourceReg()
175 SystemZElimCompare::convertToBRCT(MachineInstr *MI, MachineInstr *Compare, in convertToBRCT() argument
[all …]
/external/libcxx/test/std/containers/unord/unord.map/
Dswap_member.pass.cpp32 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
34 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C; in main()
35 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
36 C c2(0, Hash(2), Compare(2), Alloc(2)); in main()
43 assert(c1.key_eq() == Compare(2)); in main()
52 assert(c2.key_eq() == Compare(1)); in main()
60 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
62 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C; in main()
75 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
76 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2)); in main()
[all …]
/external/libcxx/test/std/containers/unord/unord.map/unord.map.swap/
Dswap_non_member.pass.cpp32 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
34 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C; in main()
35 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
36 C c2(0, Hash(2), Compare(2), Alloc(2)); in main()
43 assert(c1.key_eq() == Compare(2)); in main()
52 assert(c2.key_eq() == Compare(1)); in main()
60 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
62 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C; in main()
75 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
76 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2)); in main()
[all …]
/external/libcxx/test/std/containers/unord/unord.multimap/
Dswap_member.pass.cpp32 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
34 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C; in main()
36 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
37 C c2(0, Hash(2), Compare(2), Alloc(2)); in main()
44 assert(c1.key_eq() == Compare(2)); in main()
53 assert(c2.key_eq() == Compare(1)); in main()
61 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
63 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C; in main()
76 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
77 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2)); in main()
[all …]
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.swap/
Dswap_non_member.pass.cpp31 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
33 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C; in main()
35 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
36 C c2(0, Hash(2), Compare(2), Alloc(2)); in main()
43 assert(c1.key_eq() == Compare(2)); in main()
52 assert(c2.key_eq() == Compare(1)); in main()
60 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
62 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C; in main()
75 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
76 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2)); in main()
[all …]
/external/webrtc/webrtc/libjingle/xmllite/
Dqname.h49 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/v8/src/
Dzone-containers.h68 template <typename T, typename Compare = std::less<T>>
70 : public std::priority_queue<T, ZoneVector<T>, Compare> {
74 : std::priority_queue<T, ZoneVector<T>, Compare>(Compare(), in ZonePriorityQueue()
103 template <typename K, typename Compare = std::less<K>>
104 class ZoneSet : public std::set<K, Compare, zone_allocator<K>> {
108 : std::set<K, Compare, zone_allocator<K>>(Compare(), in ZoneSet()
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>>> {
121 : std::map<K, V, Compare, zone_allocator<std::pair<const K, V>>>( in ZoneMap()
122 Compare(), zone_allocator<std::pair<const K, V>>(zone)) {} in ZoneMap()
Dsplay-tree-inl.h32 int cmp = Config::Compare(key, root_->key_); in Insert()
66 return Config::Compare(key, root_->key_) == 0; in FindInternal()
97 int cmp = Config::Compare(root_->key_, key); in FindGreatestLessThan()
121 int cmp = Config::Compare(root_->key_, key); in FindLeastGreaterThan()
167 int cmp = Config::Compare(new_key, root_->key_); in Move()
224 int cmp = Config::Compare(key, current->key_); in Splay()
228 if (Config::Compare(key, current->left_->key_) < 0) { in Splay()
244 if (Config::Compare(key, current->right_->key_) > 0) { in Splay()
Dbignum.h50 static int Compare(const Bignum& a, const Bignum& b);
52 return Compare(a, b) == 0; in Equal()
55 return Compare(a, b) <= 0; in LessEqual()
58 return Compare(a, b) < 0; in Less()
/external/llvm/include/llvm/ADT/
DPriorityQueue.h27 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(),
39 : std::priority_queue<T, Sequence, Compare>(begin, end, compare, sequence)
/external/pdfium/fpdfsdk/src/
Dfpdf_ext.cpp66 if (cbSubType.Compare("3D") == 0) { in CheckUnSupportAnnot()
68 } else if (cbSubType.Compare("Screen") == 0) { in CheckUnSupportAnnot()
73 if (cbString.Compare("Img") != 0) in CheckUnSupportAnnot()
75 } else if (cbSubType.Compare("Movie") == 0) { in CheckUnSupportAnnot()
77 } else if (cbSubType.Compare("Sound") == 0) { in CheckUnSupportAnnot()
79 } else if (cbSubType.Compare("RichMedia") == 0) { in CheckUnSupportAnnot()
81 } else if (cbSubType.Compare("FileAttachment") == 0) { in CheckUnSupportAnnot()
83 } else if (cbSubType.Compare("Widget") == 0) { in CheckUnSupportAnnot()
89 if (cbString.Compare("Sig") == 0) { in CheckUnSupportAnnot()
165 if (cbStr.Compare("com.adobe.acrobat.SharedReview.Register") == 0) { in CheckUnSupportError()
/external/openfst/src/include/fst/
Darcsort.h36 template <class Arc, class Compare>
45 ArcSortMapper(const Fst<Arc> &fst, const Compare &comp) in ArcSortMapper()
49 ArcSortMapper(const ArcSortMapper<Arc, Compare> &mapper,
75 const Compare &comp_;
79 void operator=(const ArcSortMapper<Arc, Compare> &); // disallow
96 template<class Arc, class Compare>
97 void ArcSort(MutableFst<Arc> *fst, Compare comp) { in ArcSort()
98 ArcSortMapper<Arc, Compare> mapper(*fst, comp); in ArcSort()
208 typedef C Compare; typedef
/external/clang/test/SemaTemplate/
Dissue150.cpp78 template<class T, template<class> class Compare, class Default,
87 template<class _T, template<class> class Compare = PR9016::less,
88 class = typename interval_type_default<_T,Compare>::type,
96 template<class _T, template<class> class Compare = PR9016::less,
97 class = typename interval_type_default<_T,Compare>::type,
/external/libcxx/include/
Dset21 template <class Key, class Compare = less<Key>,
29 typedef Compare key_compare;
71 : set(first, last, Compare(), a) {} // C++14
73 : set(il, Compare(), a) {} // C++14
167 template <class Key, class Compare, class Allocator>
169 operator==(const set<Key, Compare, Allocator>& x,
170 const set<Key, Compare, Allocator>& y);
172 template <class Key, class Compare, class Allocator>
174 operator< (const set<Key, Compare, Allocator>& x,
175 const set<Key, Compare, Allocator>& y);
[all …]
/external/chromium-trace/catapult/third_party/closure_linter/closure_linter/common/
Derror.py50 def Compare(a, b): member in Error
65 Compare = staticmethod(Compare) variable in Error
/external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/
Dminmax_element_comp.pass.cpp27 typedef std::greater<int> Compare; in test() typedef
28 Compare comp; in test()
73 typedef std::greater<int> Compare; in test() typedef
74 Compare comp; in test()
/external/zlib/src/contrib/ada/
Dmtest.adb57 procedure Compare (Item : in Stream_Element_Array); subprogspec
63 procedure Compare (Item : in Stream_Element_Array) is subprogram
71 end Compare;
73 procedure Compare_Write is new ZLib.Write (Write => Compare);

12345678910>>...14