| /ndk/sources/host-tools/make-3.81/tests/scripts/variables/ |
| D | special | 9 X1 := $(sort $(filter FOO BAR,$(.VARIABLES)))
13 X2 := $(sort $(filter FOO BAR,$(.VARIABLES)))
20 @echo LAST = $(sort $(filter FOO BAR,$(.VARIABLES)))
31 # X1 := $(sort $(.TARGETS))
36 # @echo LAST = $(sort $(.TARGETS))
38 # X2 := $(sort $(.TARGETS))
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.sort/sort/ |
| D | sort.pass.cpp | 33 std::sort(save, save+len); in test_sort_helper()
89 std::sort(array, array+N); in test_larger_sorts()
93 std::sort(array, array+N); in test_larger_sorts()
96 std::sort(array, array+N); in test_larger_sorts()
100 std::sort(array, array+N); in test_larger_sorts()
104 std::sort(array, array+N); in test_larger_sorts()
109 std::sort(array, array+N); in test_larger_sorts()
132 std::sort(&d, &d); in main()
|
| D | sort_comp.pass.cpp | 40 std::sort(v.begin(), v.end(), std::greater<int>()); in main()
50 std::sort(v.begin(), v.end(), indirect_less()); in main()
|
| /ndk/build/tools/ |
| D | gen-system-symbols.sh | 85 …EADELF -s -D -W $1 | awk '$5 ~ /FUNC/ && $6 ~ /GLOBAL|WEAK/ && $8 !~ /UND/ { print $9; }' | sort -u
91 …DELF -s -D -W $1 | awk '$5 ~ /OBJECT/ && $6 ~ /GLOBAL|WEAK/ && $8 !~ /UND/ { print $9; }' | sort -u
141 (grep -v -f $SYMBOL_EXCLUDES $1 ; grep -f $SYMBOL_INCLUDES $1) | sort -u
152 (echo "$SYMBOLS" | tr ' ' '\n' | sort -u) > $SYMBOL_TMPFILE
|
| /ndk/sources/host-tools/make-3.81/tests/scripts/functions/ |
| D | wildcard | 22 print1: ;\@echo \$(sort \$(wildcard example.*))
24 \t\@echo \$(sort \$(wildcard example.?))
25 \t\@echo \$(sort \$(wildcard example.[a-z0-9]))
26 \t\@echo \$(sort \$(wildcard example.[!A-Za-z_\\!]))
28 \t$delete_command \$(sort \$(wildcard example.*))
|
| D | sort | 2 ."the ability of make to sort lists of object. Sort\n"
7 ."and includes some duplicates. Make should sort all of the elements\n"
31 … ."\t\@echo \$(sort \$(bar2) \$(foo) \$(addsuffix \$(s1), \$(bar) ) \$(t2) \$(bar2) \$(bar3))\n"
32 ."\t\@echo \$(sort \$(blank) \$(foo) \$(bar2) \$(t1) \$(p1) )\n"
33 ."\t\@echo \$(sort \$(foo) \$(bar2) \$(t1) \$(t4) \$(t5) \$(t7) \$(t6) )\n";
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.merge/ |
| D | inplace_merge_comp.pass.cpp | 44 std::sort(ia, ia+M, std::greater<int>()); in test_one()
45 std::sort(ia+M, ia+N, std::greater<int>()); in test_one()
100 std::sort(ia, ia+M, indirect_less()); in main()
101 std::sort(ia+M, ia+N, indirect_less()); in main()
|
| D | inplace_merge.pass.cpp | 32 std::sort(ia, ia+M); in test_one()
33 std::sort(ia+M, ia+N); in test_one()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| D | sort.pass.cpp | 25 c1.sort(); in main()
33 c1.sort(); in main()
|
| D | sort_comp.pass.cpp | 26 c1.sort(std::greater<int>()); in main()
34 c1.sort(std::greater<int>()); in main()
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| D | greater_test.cpp | 34 sort(array, array + 4, greater<int>() ); in greatert()
44 sort(array, array + 4, greater_equal<int>()); in greatereq()
|
| D | less_test.cpp | 34 sort(array, array + 4, less<int>()); in lesst()
44 sort(array, array + 4, less_equal<int>()); in lesseqt()
|
| D | bnegate_test.cpp | 34 sort(array, array + 4, binary_negate<greater<int> >(greater<int>())); in bnegate1()
43 sort(array, array + 4, not2(greater<int>())); in bnegate2()
|
| D | sort_test.cpp | 117 sort(numbers, numbers + 6); in sort1()
132 sort(numbers, numbers + count, greater<int>()); in sort2()
150 sort( boolVector.begin(), boolVector.end() ); in sort3()
200 sort(numbers, numbers + sizeof(numbers) / sizeof(numbers[0]), less_equal<int>()); in bad_predicate_detected()
|
| D | func_test.cpp | 59 sort(v.begin(), v.end(), bigger_than); in func2()
71 sort(v.begin(), v.end(), greater<int>()); in func3()
|
| /ndk/tests/device/test-stlport/unit/ |
| D | greater_test.cpp | 34 sort(array, array + 4, greater<int>() ); in greatert()
44 sort(array, array + 4, greater_equal<int>()); in greatereq()
|
| D | less_test.cpp | 34 sort(array, array + 4, less<int>()); in lesst()
44 sort(array, array + 4, less_equal<int>()); in lesseqt()
|
| D | bnegate_test.cpp | 34 sort(array, array + 4, binary_negate<greater<int> >(greater<int>())); in bnegate1()
43 sort(array, array + 4, not2(greater<int>())); in bnegate2()
|
| D | sort_test.cpp | 117 sort(numbers, numbers + 6); in sort1()
132 sort(numbers, numbers + count, greater<int>()); in sort2()
150 sort( boolVector.begin(), boolVector.end() ); in sort3()
200 sort(numbers, numbers + sizeof(numbers) / sizeof(numbers[0]), less_equal<int>()); in bad_predicate_detected()
|
| D | func_test.cpp | 59 sort(v.begin(), v.end(), bigger_than); in func2()
71 sort(v.begin(), v.end(), greater<int>()); in func3()
|
| D | collate_facets_test.cpp | 65 sort(strs, strs + 4, loc); in collate_facet()
71 sort(transformed, transformed + 4); in collate_facet()
116 sort(strs, strs + 4, loc); in collate_facet()
122 sort(transformed, transformed + 4); in collate_facet()
237 sort(v1.begin(), v1.end(), loc); in collate_by_name()
239 sort(v2.begin(), v2.end(), locale::classic()); in collate_by_name()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.dis/rand.dist.norm/rand.dist.norm.cauchy/ |
| D | eval.pass.cpp | 42 std::sort(u.begin(), u.end()); in main()
58 std::sort(u.begin(), u.end()); in main()
74 std::sort(u.begin(), u.end()); in main()
|
| D | eval_param.pass.cpp | 43 std::sort(u.begin(), u.end()); in main()
60 std::sort(u.begin(), u.end()); in main()
77 std::sort(u.begin(), u.end()); in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.dis/rand.dist.norm/rand.dist.norm.f/ |
| D | eval.pass.cpp | 64 std::sort(u.begin(), u.end()); in main()
82 std::sort(u.begin(), u.end()); in main()
100 std::sort(u.begin(), u.end()); in main()
|
| D | eval_param.pass.cpp | 65 std::sort(u.begin(), u.end()); in main()
84 std::sort(u.begin(), u.end()); in main()
103 std::sort(u.begin(), u.end()); in main()
|