| /external/markdown/tests/misc/ |
| br.html | 9 <p>Unordered (bulleted) lists use asterisks, pluses, and hyphens (<code>*</code>,
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| TestIntegerSetGenerator.java | 59 * unordered container. An equally valid implementation for an unordered
|
| TestStringSetGenerator.java | 63 * unordered container. An equally valid implementation for an unordered
|
| /external/llvm/test/Assembler/ |
| atomic.ll | 6 ; CHECK: load atomic i32, i32* %x unordered, align 4
7 load atomic i32, i32* %x unordered, align 4
|
| /external/llvm/lib/Target/Sparc/ |
| Sparc.h | 62 FCC_U = 7+16, // Unordered
64 FCC_UG = 5+16, // Unordered or Greater
66 FCC_UL = 3+16, // Unordered or Less
70 FCC_UE = 10+16, // Unordered or Equal
72 FCC_UGE = 12+16, // Unordered or Greater or Equal
74 FCC_ULE = 14+16, // Unordered or Less or Equal
|
| /external/libcxx/test/std/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/std/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();
|
| /libcore/ojluni/src/main/java/java/util/stream/ |
| BaseStream.java | 119 * <a href="package-summary.html#Ordering">unordered</a>. May return
120 * itself, either because the stream was already unordered, or because
121 * the underlying stream state was modified to be unordered.
126 * @return an unordered stream
128 S unordered(); method in interface:BaseStream
|
| /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();
|
| /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/clang/test/CodeGenObjC/ |
| atomic-aggregate-property.m | 32 // CHECK-LP64: load atomic i64, i64* {{%.*}} unordered, align 8
35 // CHECK-LP64: store atomic i64 {{%.*}}, i64* {{%.*}} unordered, align 8
|
| /external/easymock/src/org/easymock/internal/ |
| UnorderedBehavior.java | 82 boolean unordered = !checkOrder;
87 if (unordered && validCallCount && !match) {
|
| /external/llvm/test/CodeGen/SystemZ/ |
| spill-01.ll | 258 %val0 = load atomic i32 , i32 *%ptr0 unordered, align 4
259 %val1 = load atomic i32 , i32 *%ptr1 unordered, align 4
260 %val2 = load atomic i32 , i32 *%ptr2 unordered, align 4
261 %val3 = load atomic i32 , i32 *%ptr3 unordered, align 4
262 %val4 = load atomic i32 , i32 *%ptr4 unordered, align 4
263 %val5 = load atomic i32 , i32 *%ptr5 unordered, align 4
264 %val6 = load atomic i32 , i32 *%ptr6 unordered, align 4
265 %val7 = load atomic i32 , i32 *%ptr7 unordered, align 4
266 %val8 = load atomic i32 , i32 *%ptr8 unordered, align 4
270 store atomic i32 %val0, i32 *%ptr0 unordered, align
[all...] |
| /external/protobuf/m4/ |
| stl_hash.m4 | 3 # namespace unordered/hash_map lives in within that include file. We
10 # This also checks if unordered map exists.
|
| /external/blktrace/ |
| verify_blkparse.c | 62 fprintf(stdout, "Events %Lu: %d unordered, %d aliases\n", total_entries, nr, alias);
|
| /external/clang/test/CodeGenCXX/ |
| static-member-variable-explicit-specialization.cpp | 41 template int A<short>::a; // Unordered
44 int d = A<void>::a; // Unordered
55 template short x<short>; // Unordered
57 int e = x<char>; // Unordered
|
| /external/e2fsprogs/tests/f_h_badroot/ |
| expect.1 | 20 Problem in HTREE directory inode 80065: block #0 has an unordered hash table
|
| /external/llvm/docs/ |
| Atomics.rst | 157 for a "safe" language like Java, use Unordered to load and store any shared
178 Unordered
181 Unordered is the lowest level of atomicity. It essentially guarantees that races
197 languages would normally split a 64-bit store on ARM into two 32-bit unordered
206 call. Reordering unordered operations is safe, though, and optimizers should
207 take advantage of that because unordered operations are common in languages
212 unordered loads and unordered stores, a load cannot see a value which was
214 note that an unordered load or store cannot be split into multiple
240 it is legal to reorder non-atomic and Unordered loads around Monotoni
[all...] |
| /external/llvm/test/Bitcode/ |
| memInstructions.3.2.ll | 86 ; CHECK: %res1 = load atomic i8, i8* %ptr1 unordered, align 1
87 %res1 = load atomic i8, i8* %ptr1 unordered, align 1
98 ; CHECK-NEXT: %res5 = load atomic volatile i8, i8* %ptr1 unordered, align 1
99 %res5 = load atomic volatile i8, i8* %ptr1 unordered, align 1
110 ; CHECK-NEXT: %res9 = load atomic i8, i8* %ptr1 singlethread unordered, align 1
111 %res9 = load atomic i8, i8* %ptr1 singlethread unordered, align 1
122 ; CHECK-NEXT: %res13 = load atomic volatile i8, i8* %ptr1 singlethread unordered, align 1
123 %res13 = load atomic volatile i8, i8* %ptr1 singlethread unordered, align 1
172 ; CHECK: store atomic i8 2, i8* %ptr1 unordered, align 1
173 store atomic i8 2, i8* %ptr1 unordered, align
[all...] |
| /external/llvm/test/CodeGen/AArch64/ |
| arm64-atomic.ll | 165 %val_regoff = load atomic i8, i8* %ptr_regoff unordered, align 1
175 %val_random = load atomic i8, i8* %ptr_random unordered, align 1
190 %val_regoff = load atomic i16, i16* %ptr_regoff unordered, align 2
200 %val_random = load atomic i16, i16* %ptr_random unordered, align 2
215 %val_regoff = load atomic i32, i32* %ptr_regoff unordered, align 4
225 %val_random = load atomic i32, i32* %ptr_random unordered, align 4
240 %val_regoff = load atomic i64, i64* %ptr_regoff unordered, align 8
250 %val_random = load atomic i64, i64* %ptr_random unordered, align 8
273 store atomic i8 %val, i8* %ptr_regoff unordered, align 1
281 store atomic i8 %val, i8* %ptr_random unordered, align
[all...] |
| /external/markdown/MarkdownTest/Tests_2004/ |
| Ordered and unordered lists.text | 0 ## Unordered
|
| /external/markdown/MarkdownTest/Tests_2007/ |
| Ordered and unordered lists.text | 0 ## Unordered
|
| /external/markdown/tests/markdown-test/ |
| ordered-and-unordered-list.txt | 0 ## Unordered
|
| /external/valgrind/none/tests/mips64/ |
| fpu_branches.c | 44 printf("--- C.UN.S/D --- if unordered(fs, ft) then " \
58 printf("--- C.UEQ.S/D --- if (unordered(fs, ft) or (fs == ft)) then " \
72 printf("--- C.ULT.S/D --- if (unordered(fs, ft) or (fs < ft)) then " \
86 printf("--- C.ULE.S/D --- if (unordered(fs, ft) or (fs <= ft)) then " \
|
