/external/libcxx/test/std/containers/unord/unord.set/ |
D | erase_key.pass.cpp | 25 template <typename Unordered> 26 bool only_deletions ( const Unordered &whole, const Unordered &part ) { in only_deletions() 27 typename Unordered::const_iterator w = whole.begin(); in only_deletions() 28 typename Unordered::const_iterator p = part.begin(); in only_deletions()
|
/external/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/ |
D | erase_key.pass.cpp | 26 template <typename Unordered> 27 bool only_deletions ( const Unordered &whole, const Unordered &part ) { in only_deletions() 28 typename Unordered::const_iterator w = whole.begin(); in only_deletions() 29 typename Unordered::const_iterator p = part.begin(); in only_deletions()
|
/external/libcxx/test/std/containers/unord/unord.multiset/ |
D | erase_key.pass.cpp | 25 template <typename Unordered> 26 bool only_deletions ( const Unordered &whole, const Unordered &part ) { in only_deletions() 27 typename Unordered::const_iterator w = whole.begin(); in only_deletions() 28 typename Unordered::const_iterator p = part.begin(); in only_deletions()
|
/external/llvm/include/llvm/Support/ |
D | AtomicOrdering.h | 59 Unordered = 1, enumerator 122 return isStrongerThan(ao, AtomicOrdering::Unordered); in isStrongerThanUnordered()
|
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Support/ |
D | AtomicOrdering.h | 59 Unordered = 1, enumerator 121 return isStrongerThan(ao, AtomicOrdering::Unordered); in isStrongerThanUnordered()
|
/external/snakeyaml/src/test/resources/pyyaml/ |
D | construct-map.data | 1 # Unordered set of key: value pairs.
|
/external/llvm/test/YAMLParser/ |
D | construct-map.test | 3 # Unordered set of key: value pairs.
|
/external/swiftshader/third_party/llvm-7.0/llvm/test/YAMLParser/ |
D | construct-map.test | 3 # Unordered set of key: value pairs.
|
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
D | erase_key.pass.cpp | 26 template <typename Unordered> 27 bool only_deletions ( const Unordered &whole, const Unordered &part ) { in only_deletions() 28 typename Unordered::const_iterator w = whole.begin(); in only_deletions() 29 typename Unordered::const_iterator p = part.begin(); in only_deletions()
|
/external/markdown/tests/misc/ |
D | br.txt | 13 Unordered (bulleted) lists use asterisks, pluses, and hyphens (`*`,
|
/external/markdown/MarkdownTest/Tests_2004/ |
D | Ordered and unordered lists.text | 1 ## Unordered
|
/external/markdown/tests/markdown-test/ |
D | ordered-and-unordered-list.txt | 1 ## Unordered
|
/external/markdown/MarkdownTest/Tests_2007/ |
D | Ordered and unordered lists.text | 1 ## Unordered
|
/external/tensorflow/tensorflow/core/distributed_runtime/ |
D | recent_request_ids_test.cc | 44 TEST(RecentRequestIds, Unordered) { in TEST() argument
|
/external/swiftshader/third_party/llvm-7.0/llvm/docs/ |
D | Atomics.rst | 153 for a "safe" language like Java, use Unordered to load and store any shared 174 Unordered section in Atomic orderings 177 Unordered is the lowest level of atomicity. It essentially guarantees that races 236 it is legal to reorder non-atomic and Unordered loads around Monotonic 363 Unordered. This would be checked, for example, by LICM before hoisting an 380 optimize some atomic operations (Unordered operations in particular), make sure 390 * LICM: Unordered loads/stores can be moved out of a loop. It just treats 394 * DSE: Unordered stores can be DSE'ed like normal stores. Monotonic stores can
|
/external/llvm/docs/ |
D | Atomics.rst | 153 for a "safe" language like Java, use Unordered to load and store any shared 174 Unordered section in Atomic orderings 177 Unordered is the lowest level of atomicity. It essentially guarantees that races 236 it is legal to reorder non-atomic and Unordered loads around Monotonic 363 Unordered. This would be checked, for example, by LICM before hoisting an 380 optimize some atomic operations (Unordered operations in particular), make sure 390 * LICM: Unordered loads/stores can be moved out of a loop. It just treats 394 * DSE: Unordered stores can be DSE'ed like normal stores. Monotonic stores can
|
/external/swiftshader/third_party/LLVM/lib/Target/Sparc/ |
D | SparcInstrInfo.td | 161 def FCC_U : FCC_VAL<23>; // Unordered 163 def FCC_UG : FCC_VAL<21>; // Unordered or Greater 165 def FCC_UL : FCC_VAL<19>; // Unordered or Less 169 def FCC_UE : FCC_VAL<24>; // Unordered or Equal 171 def FCC_UGE : FCC_VAL<26>; // Unordered or Greater or Equal 173 def FCC_ULE : FCC_VAL<28>; // Unordered or Less or Equal
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
D | AliasAnalysis.cpp | 400 if (isStrongerThan(L->getOrdering(), AtomicOrdering::Unordered)) in getModRefInfo() 419 if (isStrongerThan(S->getOrdering(), AtomicOrdering::Unordered)) in getModRefInfo()
|
/external/protobuf/src/google/protobuf/ |
D | struct.proto | 53 // Unordered map of dynamically typed values.
|
/external/golang-protobuf/ptypes/struct/ |
D | struct.proto | 53 // Unordered map of dynamically typed values.
|
/external/spirv-llvm/lib/SPIRV/libSPIRV/ |
D | SPIRVOpCodeEnum.h | 152 _SPIRV_OP(Unordered, 163)
|
/external/pdfium/xfa/fxfa/parser/ |
D | xfa_basic_data_enum.cpp | 220 {0xc3621288, L"unordered", XFA_AttributeEnum::Unordered},
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Sparc/ |
D | SparcInstrInfo.td | 256 def FCC_U : FCC_VAL<23>; // Unordered 258 def FCC_UG : FCC_VAL<21>; // Unordered or Greater 260 def FCC_UL : FCC_VAL<19>; // Unordered or Less 264 def FCC_UE : FCC_VAL<26>; // Unordered or Equal 266 def FCC_UGE : FCC_VAL<28>; // Unordered or Greater or Equal 268 def FCC_ULE : FCC_VAL<30>; // Unordered or Less or Equal
|
/external/llvm/lib/Target/Sparc/ |
D | SparcInstrInfo.td | 252 def FCC_U : FCC_VAL<23>; // Unordered 254 def FCC_UG : FCC_VAL<21>; // Unordered or Greater 256 def FCC_UL : FCC_VAL<19>; // Unordered or Less 260 def FCC_UE : FCC_VAL<26>; // Unordered or Equal 262 def FCC_UGE : FCC_VAL<28>; // Unordered or Greater or Equal 264 def FCC_ULE : FCC_VAL<30>; // Unordered or Less or Equal
|
/external/pdfium/xfa/fxfa/ |
D | fxfa_basic.h | 307 Unordered, enumerator
|