/external/libcxx/test/containers/unord/unord.multiset/ |
erase_key.pass.cpp | 25 template <typename Unordered> 26 bool only_deletions ( const Unordered &whole, const Unordered &part ) { 27 typename Unordered::const_iterator w = whole.begin(); 28 typename Unordered::const_iterator p = part.begin();
|
/external/libcxx/test/containers/unord/unord.set/ |
erase_key.pass.cpp | 25 template <typename Unordered> 26 bool only_deletions ( const Unordered &whole, const Unordered &part ) { 27 typename Unordered::const_iterator w = whole.begin(); 28 typename Unordered::const_iterator p = part.begin();
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
erase_key.pass.cpp | 25 template <typename Unordered> 26 bool only_deletions ( const Unordered &whole, const Unordered &part ) { 27 typename Unordered::const_iterator w = whole.begin(); 28 typename Unordered::const_iterator p = part.begin();
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
erase_key.pass.cpp | 25 template <typename Unordered> 26 bool only_deletions ( const Unordered &whole, const Unordered &part ) { 27 typename Unordered::const_iterator w = whole.begin(); 28 typename Unordered::const_iterator p = part.begin();
|
/external/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/ |
erase_key.pass.cpp | 25 template <typename Unordered> 26 bool only_deletions ( const Unordered &whole, const Unordered &part ) { 27 typename Unordered::const_iterator w = whole.begin(); 28 typename Unordered::const_iterator p = part.begin();
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/ |
erase_key.pass.cpp | 25 template <typename Unordered> 26 bool only_deletions ( const Unordered &whole, const Unordered &part ) { 27 typename Unordered::const_iterator w = whole.begin(); 28 typename Unordered::const_iterator p = part.begin();
|
/external/llvm/lib/Target/X86/ |
X86AtomicExpandPass.cpp | 211 AI->getOrdering() == Unordered ? Monotonic : AI->getOrdering(); 274 SI->getOrdering() == Unordered ? Monotonic : SI->getOrdering();
|
/external/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
erase_key.pass.cpp | 25 template <typename Unordered> 26 bool only_deletions ( const Unordered &whole, const Unordered &part ) { 27 typename Unordered::const_iterator w = whole.begin(); 28 typename Unordered::const_iterator p = part.begin();
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
erase_key.pass.cpp | 25 template <typename Unordered> 26 bool only_deletions ( const Unordered &whole, const Unordered &part ) { 27 typename Unordered::const_iterator w = whole.begin(); 28 typename Unordered::const_iterator p = part.begin();
|
/external/chromium_org/v8/test/webkit/ |
array-enumerators-functions.js | 59 function returnIndex(a, index) { if (lastIndex >= index) throw "Unordered traversal"; lastIndex = index; count++; return index; } 96 // Test unordered object and array behaviour matches
|
/external/llvm/lib/Transforms/Instrumentation/ |
ThreadSanitizer.cpp | 426 case Unordered: // Fall-through.
|
MemorySanitizer.cpp | [all...] |
/external/llvm/lib/IR/ |
AsmWriter.cpp | [all...] |
Verifier.cpp | [all...] |
/external/llvm/bindings/ocaml/llvm/ |
llvm.mli | 173 Ordered means that neither operand is a QNAN while unordered means 186 | Uno (* Unordered (one operand at least is NaN) *) 187 | Ueq (* Unordered and equal *) 188 | Ugt (* Unordered and greater than *) 189 | Uge (* Unordered and greater or equal *) 190 | Ult (* Unordered and less than *) 191 | Ule (* Unordered and less or equal *) 192 | Une (* Unordered and not equal *) 292 | Unordered [all...] |
llvm.ml | 229 | Unordered [all...] |
/external/llvm/lib/Bitcode/Reader/ |
BitcodeReader.cpp | 189 case bitc::ORDERING_UNORDERED: return Unordered; [all...] |
/frameworks/compile/libbcc/bcinfo/BitReader_3_0/ |
BitcodeReader.cpp | 462 case bitc::ORDERING_UNORDERED: return Unordered; [all...] |
/external/llvm/lib/AsmParser/ |
LLParser.cpp | [all...] |
/external/llvm/include/llvm/IR/ |
Instructions.h | 39 Unordered = 1, 237 return getOrdering() <= Unordered && !isVolatile(); 357 return getOrdering() <= Unordered && !isVolatile(); [all...] |
/external/clang/lib/CodeGen/ |
CGObjC.cpp | 379 // be an undefined read and write of an object in unordered [all...] |
/external/llvm/lib/Bitcode/Writer/ |
BitcodeWriter.cpp | 129 case Unordered: return bitc::ORDERING_UNORDERED; [all...] |
/external/llvm/lib/Target/CppBackend/ |
CPPBackend.cpp | [all...] |
/frameworks/compile/slang/BitWriter_2_9_func/ |
BitcodeWriter.cpp | 126 case Unordered: return bitc::ORDERING_UNORDERED; [all...] |
/frameworks/compile/slang/BitWriter_3_2/ |
BitcodeWriter.cpp | 130 case Unordered: return bitc::ORDERING_UNORDERED; [all...] |