/external/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
mismatch.pass.cpp | 32 typedef random_access_iterator<const int*> RAI; 37 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib)) 38 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); 44 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), RAI(ib+sb) [all...] |
mismatch_pred.pass.cpp | 38 typedef random_access_iterator<const int*> RAI; 43 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), EQ()) 44 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); 47 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), std::ref(bcp) [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/mismatch/ |
mismatch.pass.cpp | 32 typedef random_access_iterator<const int*> RAI; 37 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib)) 38 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); 44 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), RAI(ib+sb) [all...] |
mismatch_pred.pass.cpp | 38 typedef random_access_iterator<const int*> RAI; 43 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), EQ()) 44 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); 47 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), std::ref(bcp) [all...] |
/external/libcxx/test/std/containers/sequences/deque/deque.special/ |
copy.pass.cpp | 51 typedef random_access_iterator<I> RAI; 60 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end())); 62 assert(std::copy(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end()));
|
copy_backward.pass.cpp | 51 typedef random_access_iterator<I> RAI; 59 assert(std::copy_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin())); 61 assert(std::copy_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin()));
|
move.pass.cpp | 51 typedef random_access_iterator<I> RAI; 59 assert(std::move(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end())); 61 assert(std::move(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end()));
|
move_backward.pass.cpp | 51 typedef random_access_iterator<I> RAI; 59 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin())); 61 assert(std::move_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin()));
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.special/ |
copy.pass.cpp | 51 typedef random_access_iterator<I> RAI; 60 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end())); 62 assert(std::copy(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end()));
|
copy_backward.pass.cpp | 51 typedef random_access_iterator<I> RAI; 59 assert(std::copy_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin())); 61 assert(std::copy_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin()));
|
move.pass.cpp | 51 typedef random_access_iterator<I> RAI; 59 assert(std::move(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end())); 61 assert(std::move(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end()));
|
move_backward.pass.cpp | 51 typedef random_access_iterator<I> RAI; 59 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin())); 61 assert(std::move_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin()));
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.special/ |
copy.pass.cpp | 51 typedef random_access_iterator<I> RAI; 60 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end())); 62 assert(std::copy(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end()));
|
copy_backward.pass.cpp | 51 typedef random_access_iterator<I> RAI; 59 assert(std::copy_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin())); 61 assert(std::copy_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin()));
|
move.pass.cpp | 51 typedef random_access_iterator<I> RAI; 59 assert(std::move(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end())); 61 assert(std::move(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end()));
|
move_backward.pass.cpp | 51 typedef random_access_iterator<I> RAI; 59 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin())); 61 assert(std::move_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin()));
|
/external/llvm/lib/Target/Hexagon/ |
RDFLiveness.h | 38 RAI(g.getRAI()), MRI(mri), Empty(), Trace(false) {} 68 const RegisterAliasInfo &RAI;
|
RDFGraph.h | 599 const MachineDominanceFrontier &mdf, const RegisterAliasInfo &rai, 631 return RAI; 795 const RegisterAliasInfo &RAI;
|
/external/llvm/lib/CodeGen/ |
GCRootLowering.cpp | 282 MachineBasicBlock::iterator RAI = CI; 283 ++RAI; 291 MCSymbol *Label = InsertLabel(*CI->getParent(), RAI, CI->getDebugLoc());
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
GCStrategy.cpp | 361 MachineBasicBlock::iterator RAI = CI; 362 ++RAI; 370 MCSymbol* Label = InsertLabel(*CI->getParent(), RAI, CI->getDebugLoc());
|