| /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.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/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/guava/guava/src/com/google/common/graph/ |
| D | EndpointPair.java | 59 return new Unordered<N>(nodeV, nodeU); in unordered()
193 private static final class Unordered<N> extends EndpointPair<N> { class in EndpointPair
194 private Unordered(N nodeU, N nodeV) { in Unordered() method in EndpointPair.Unordered
|
| /external/guava/android/guava/src/com/google/common/graph/ |
| D | EndpointPair.java | 59 return new Unordered<N>(nodeV, nodeU); in unordered()
193 private static final class Unordered<N> extends EndpointPair<N> { class in EndpointPair
194 private Unordered(N nodeU, N nodeV) { in Unordered() method in EndpointPair.Unordered
|
| /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/swiftshader/third_party/llvm-7.0/llvm/test/YAMLParser/ |
| D | construct-map.test | 3 # Unordered set of key: value pairs.
|
| /external/llvm/test/YAMLParser/ |
| D | construct-map.test | 3 # Unordered set of key: value pairs.
|
| /external/dokka/core/src/main/kotlin/Formats/ |
| D | MarkdownFormatService.kt | 10 Unordered
115 listStack.push(ListState(ListKind.Unordered)) in appendUnorderedList()
|
| /external/python/pybind11/tests/ |
| D | conftest.py | 61 class Unordered(Output): class
103 return Unordered(self.out)
|
| /external/markdown/tests/misc/ |
| D | br.txt | 13 Unordered (bulleted) lists use asterisks, pluses, and hyphens (`*`,
|
| /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/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/v8/src/builtins/ |
| D | typed-array-set.tq | 279 // true, Unordered).
281 // value, true, Unordered).
301 // srcType, true, Unordered).
303 // targetType, value, true, 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/freetype/docs/ |
| D | DOCGUIDE | 168 Unordered lists can be created with asterisks:
170 * Unordered list items can use asterisks.
|
| /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/golang-protobuf/ptypes/struct/ |
| D | struct.proto | 53 // Unordered map of dynamically typed values.
|
| /external/protobuf/src/google/protobuf/ |
| D | struct.proto | 52 // Unordered map of dynamically typed values.
|