/external/libcxx/test/std/containers/associative/multiset/multiset.cons/ |
initializer_list_compare.pass.cpp | 23 typedef test_compare<std::less<int> > Cmp; 24 typedef std::multiset<int, Cmp> C; 26 C m({1, 2, 3, 4, 5, 6}, Cmp(10)); 36 assert(m.key_comp() == Cmp(10));
|
initializer_list_compare_alloc.pass.cpp | 24 typedef test_compare<std::less<int> > Cmp; 26 typedef std::multiset<int, Cmp, A> C; 28 C m({1, 2, 3, 4, 5, 6}, Cmp(10), A(4)); 38 assert(m.key_comp() == Cmp(10));
|
/external/libcxx/test/std/containers/associative/set/set.cons/ |
initializer_list_compare.pass.cpp | 23 typedef test_compare<std::less<int> > Cmp; 24 typedef std::set<int, Cmp> C; 26 C m({1, 2, 3, 4, 5, 6}, Cmp(10)); 36 assert(m.key_comp() == Cmp(10));
|
initializer_list_compare_alloc.pass.cpp | 26 typedef test_compare<std::less<int> > Cmp; 28 typedef std::set<int, Cmp, A> C; 30 C m({1, 2, 3, 4, 5, 6}, Cmp(10), A(4)); 40 assert(m.key_comp() == Cmp(10)); 45 typedef test_compare<std::less<int> > Cmp; 47 typedef std::set<int, Cmp, A> C;
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/ |
initializer_list_compare.pass.cpp | 23 typedef test_compare<std::less<int> > Cmp; 24 typedef std::multiset<int, Cmp> C; 26 C m({1, 2, 3, 4, 5, 6}, Cmp(10)); 36 assert(m.key_comp() == Cmp(10));
|
initializer_list_compare_alloc.pass.cpp | 24 typedef test_compare<std::less<int> > Cmp; 26 typedef std::multiset<int, Cmp, A> C; 28 C m({1, 2, 3, 4, 5, 6}, Cmp(10), A(4)); 38 assert(m.key_comp() == Cmp(10));
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/set.cons/ |
initializer_list_compare.pass.cpp | 23 typedef test_compare<std::less<int> > Cmp; 24 typedef std::set<int, Cmp> C; 26 C m({1, 2, 3, 4, 5, 6}, Cmp(10)); 36 assert(m.key_comp() == Cmp(10));
|
initializer_list_compare_alloc.pass.cpp | 26 typedef test_compare<std::less<int> > Cmp; 28 typedef std::set<int, Cmp, A> C; 30 C m({1, 2, 3, 4, 5, 6}, Cmp(10), A(4)); 40 assert(m.key_comp() == Cmp(10)); 45 typedef test_compare<std::less<int> > Cmp; 47 typedef std::set<int, Cmp, A> C;
|
/external/libcxx/test/std/containers/associative/multimap/multimap.cons/ |
initializer_list_compare.pass.cpp | 25 typedef test_compare<std::less<int> > Cmp; 26 typedef std::multimap<int, double, Cmp> C; 40 Cmp(4) 54 assert(m.key_comp() == Cmp(4)); 58 typedef test_compare<std::less<int> > Cmp; 59 typedef std::multimap<int, double, Cmp, min_allocator<std::pair<const int, double>>> C; 73 Cmp(4) 87 assert(m.key_comp() == Cmp(4));
|
initializer_list_compare_alloc.pass.cpp | 26 typedef test_compare<std::less<int> > Cmp; 28 typedef std::multimap<int, double, Cmp, A> C; 42 Cmp(4), A(5) 56 assert(m.key_comp() == Cmp(4)); 62 typedef test_compare<std::less<int> > Cmp; 64 typedef std::multimap<int, double, Cmp, A> C; 78 Cmp(4), A() 92 assert(m.key_comp() == Cmp(4));
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.cons/ |
initializer_list_compare.pass.cpp | 25 typedef test_compare<std::less<int> > Cmp; 26 typedef std::multimap<int, double, Cmp> C; 40 Cmp(4) 54 assert(m.key_comp() == Cmp(4)); 58 typedef test_compare<std::less<int> > Cmp; 59 typedef std::multimap<int, double, Cmp, min_allocator<std::pair<const int, double>>> C; 73 Cmp(4) 87 assert(m.key_comp() == Cmp(4));
|
initializer_list_compare_alloc.pass.cpp | 26 typedef test_compare<std::less<int> > Cmp; 28 typedef std::multimap<int, double, Cmp, A> C; 42 Cmp(4), A(5) 56 assert(m.key_comp() == Cmp(4)); 62 typedef test_compare<std::less<int> > Cmp; 64 typedef std::multimap<int, double, Cmp, A> C; 78 Cmp(4), A() 92 assert(m.key_comp() == Cmp(4));
|
/external/clang/include/clang/Analysis/Analyses/ |
ThreadSafetyTIL.h | 275 // template <class C> typename C::CType compare(CType* E, C& Cmp) { 396 typename C::CType compare(const Variable* E, C& Cmp) const { 397 return Cmp.compareVariableRefs(this, E); 457 typename C::CType compare(const Future* E, C& Cmp) const { 459 return Cmp.comparePointers(this, E); 460 return Cmp.compare(Result, E->Result); 485 typename C::CType compare(const Undefined* E, C& Cmp) const { 486 return Cmp.trueResult(); 507 typename C::CType compare(const Wildcard* E, C& Cmp) const { 508 return Cmp.trueResult() [all...] |
/external/llvm/lib/Target/AArch64/ |
AArch64ConditionOptimizer.cpp | 34 // cmp w8, #4 38 // cmp w8, #6 45 // cmp w8, #5 49 // cmp w8, #5 // <-- CSE pass removes this instruction 55 // TODO: maybe handle TBNZ/TBZ the same way as CMP when used instead for "a < 0" 102 CmpInfo adjustCmp(MachineInstr *CmpMI, AArch64CC::CondCode Cmp); 104 bool adjustTo(MachineInstr *CmpMI, AArch64CC::CondCode Cmp, MachineInstr *To, 152 // cmp is an alias for subs with a dead destination register. 160 DEBUG(dbgs() << "Immediate of cmp is symbolic, " << *I << '\n'); 163 DEBUG(dbgs() << "Immediate of cmp may be out of range, " << *I << '\n') [all...] |
/external/vixl/examples/ |
abs.cc | 39 __ Cmp(x0, 0);
|
/external/llvm/lib/Target/Hexagon/ |
HexagonHardwareLoops.cpp | 119 static Kind getSwappedComparison(Kind Cmp) { 120 assert ((!((Cmp & L) && (Cmp & G))) && "Malformed comparison operator"); 121 if ((Cmp & L) || (Cmp & G)) 122 return (Kind)(Cmp ^ (L|G)); 123 return Cmp; 126 static Kind getNegatedComparison(Kind Cmp) { 127 if ((Cmp & L) || (Cmp & G) [all...] |
/external/opencv3/modules/cudev/include/opencv2/cudev/block/detail/ |
reduce_key_val.hpp | 108 const CmpTuple& cmp, 113 if (get<I>(cmp)(reg, get<I>(key))) 119 For<I + 1, N>::merge(skeys, key, svals, val, cmp, tid, delta); 200 template <typename K, typename V, class Cmp> 201 __device__ void merge(volatile K* skeys, K& key, volatile V* svals, V& val, const Cmp& cmp, uint tid, uint delta) 205 if (cmp(reg, key)) 215 class Cmp> 219 const Cmp& cmp, uint tid, uint delta [all...] |
/external/opencv3/modules/core/include/opencv2/core/cuda/detail/ |
reduce_key_val.hpp | 104 static __device__ void mergeShfl(const KeyReferenceTuple& key, const ValReferenceTuple& val, const CmpTuple& cmp, unsigned int delta, int width) 108 if (thrust::get<I>(cmp)(reg, thrust::get<I>(key))) 114 For<I + 1, N>::mergeShfl(key, val, cmp, delta, width); 119 const CmpTuple& cmp, 124 if (thrust::get<I>(cmp)(reg, thrust::get<I>(key))) 130 For<I + 1, N>::merge(skeys, key, svals, val, cmp, tid, delta); 229 template <typename K, typename V, class Cmp> 230 __device__ __forceinline__ void mergeShfl(K& key, V& val, const Cmp& cmp, unsigned int delta, int width) 234 if (cmp(reg, key) [all...] |
/prebuilts/go/darwin-x86/test/bench/shootout/ |
pidigits.go | 62 if numer.Cmp(accum) > 0 { 76 if tmp2.Cmp(denom) >= 0 {
|
/prebuilts/go/linux-x86/test/bench/shootout/ |
pidigits.go | 62 if numer.Cmp(accum) > 0 { 76 if tmp2.Cmp(denom) >= 0 {
|
/prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
test_compare.py | 21 class Cmp: 26 return '<Cmp %s>' % self.arg 29 return cmp(self.arg, other) 32 set1 = [2, 2.0, 2L, 2+0j, Coerce(2), Cmp(2.0)] 51 self.assertEqual(cmp(a, b), cmp(id(a), id(b)),
|
/prebuilts/gdb/linux-x86/lib/python2.7/test/ |
test_compare.py | 21 class Cmp: 26 return '<Cmp %s>' % self.arg 29 return cmp(self.arg, other) 32 set1 = [2, 2.0, 2L, 2+0j, Coerce(2), Cmp(2.0)] 51 self.assertEqual(cmp(a, b), cmp(id(a), id(b)),
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
test_compare.py | 21 class Cmp: 26 return '<Cmp %s>' % self.arg 29 return cmp(self.arg, other) 32 set1 = [2, 2.0, 2L, 2+0j, Coerce(2), Cmp(2.0)] 51 self.assertEqual(cmp(a, b), cmp(id(a), id(b)),
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
test_compare.py | 21 class Cmp: 26 return '<Cmp %s>' % self.arg 29 return cmp(self.arg, other) 32 set1 = [2, 2.0, 2L, 2+0j, Coerce(2), Cmp(2.0)] 51 self.assertEqual(cmp(a, b), cmp(id(a), id(b)),
|
/external/llvm/lib/Transforms/Instrumentation/ |
BoundsChecking.cpp | 63 void emitBranchToTrap(Value *Cmp = nullptr); 96 /// If Cmp is non-null, perform a jump only if its value evaluates to true. 97 void BoundsChecking::emitBranchToTrap(Value *Cmp) { 99 ConstantInt *C = dyn_cast_or_null<ConstantInt>(Cmp); 105 Cmp = nullptr; // unconditional branch 114 if (Cmp) 115 BranchInst::Create(getTrapBB(), Cont, Cmp, OldBB);
|