| /external/llvm-project/pstl/test/std/algorithms/alg.modifying.operations/ |
| D | copy_move.pass.cpp | 31 Size n, T trash) in operator ()()
39 OutputIterator2 expected_last, Size size, Size n, T trash) in operator ()()
48 …tputIterator out_last, OutputIterator2 expected_first, OutputIterator2, Size size, Size n, T trash) in operator ()()
51 std::fill_n(expected_first, size, trash); in operator ()()
52 std::fill_n(out_first, size, trash); in operator ()()
63 std::fill_n(out_first, size, trash); in operator ()()
83 Size n, T trash) in operator ()()
91 OutputIterator2 expected_last, Size size, Size n, T trash) in operator ()()
99 …OutputIterator out_last, OutputIterator2 expected_first, OutputIterator2, Size size, Size, T trash) in operator ()()
102 std::fill_n(expected_first, size, trash); in operator ()()
[all …]
|
| D | replace_copy.pass.cpp | 30 const T& old_value, const T& new_value, T trash) in operator ()()
33 std::fill_n(expected_first, n, trash); in operator ()()
34 std::fill_n(out_first, n, trash); in operator ()()
42 std::fill_n(expected_first, n, trash); in operator ()()
43 std::fill_n(out_first, n, trash); in operator ()()
54 test(T trash, const T& old_value, const T& new_value, Predicate pred, Convert convert) in test() argument
60 Sequence<T> out(n, [=](size_t) { return trash; }); in test()
61 Sequence<T> expected(n, [=](size_t) { return trash; }); in test()
64 expected.end(), out.size(), pred, old_value, new_value, trash); in test()
66 expected.end(), out.size(), pred, old_value, new_value, trash); in test()
|
| D | unique_copy_equal.pass.cpp | 30 Predicate pred, T trash) in operator ()()
39 OutputIterator2 expected_last, Size n, Predicate pred, T trash) in operator ()()
49 T trash) in operator ()()
52 std::fill_n(expected_first, n, trash); in operator ()()
53 std::fill_n(out_first, n, trash); in operator ()()
66 std::fill_n(expected_first, n, trash); in operator ()()
67 std::fill_n(out_first, n, trash); in operator ()()
82 test(T trash, BinaryPredicate pred, Convert convert, bool check_weakness = true) in test() argument
94 Sequence<T> out(count, [=](size_t) { return trash; }); in test()
95 Sequence<T> expected(count, [=](size_t) { return trash; }); in test()
[all …]
|
| D | remove_copy.pass.cpp | 28 T trash) in operator ()()
31 std::fill_n(expected_first, n, trash); in operator ()()
32 std::fill_n(out_first, n, trash); in operator ()()
49 test(T trash, const T& value, Convert convert, bool check_weakness = true) in test() argument
64 Sequence<T> out(count, [=](size_t) { return trash; }); in test()
65 Sequence<T> expected(count, [=](size_t) { return trash; }); in test()
73 expected.end(), count, value, trash); in test()
75 expected.end(), count, value, trash); in test()
|
| D | remove.pass.cpp | 101 test(T trash, const T& value, Predicate pred, Convert convert) in test() argument
104 Sequence<T> out(max_size, [trash](size_t) { return trash; }); in test()
105 Sequence<T> expected(max_size, [trash](size_t) { return trash; }); in test()
|
| /external/llvm-project/pstl/test/std/algorithms/alg.sorting/ |
| D | partial_sort_copy.pass.cpp | 63 const T& trash, Compare compare) in operator ()()
70 const T& trash, Compare compare) in operator ()()
77 const T& trash) in operator ()()
84 const T& trash) in operator ()()
91 …perator()(Policy&& exec, InputIterator first, InputIterator last, Size n1, Size n2, const T& trash, in operator ()()
94 prepare_data(first, last, n1, trash); in operator ()()
104 …perator()(Policy&& exec, InputIterator first, InputIterator last, Size n1, Size n2, const T& trash) in operator ()()
106 prepare_data(first, last, n1, trash); in operator ()()
117 prepare_data(InputIterator first, InputIterator last, Size n1, const T& trash) in prepare_data()
123 std::fill(exp_first, exp_last, trash); in prepare_data()
[all …]
|
| /external/llvm-project/pstl/test/std/numerics/numeric.ops/ |
| D | scan.pass.cpp | 91 check_and_reset(Iterator expected_first, Iterator out_first, Size n, T trash) in check_and_reset() argument
95 std::fill_n(out_first, n, trash); in check_and_reset()
103 Iterator3 expected_first, Iterator3, Size n, T init, T trash) in operator ()()
115 check_and_reset(expected_first, out_first, n, trash); in operator ()()
116 fill(out_first, out_last, trash); in operator ()()
122 test_with_plus(T init, T trash, Convert convert) in test_with_plus() argument
128 Sequence<T> out(n, [&](int32_t) { return trash; }); in test_with_plus()
131 expected.end(), in.size(), init, trash); in test_with_plus()
133 expected.end(), in.size(), init, trash); in test_with_plus()
142 Iterator3 expected_first, Iterator3, Size n, T init, BinaryOp binary_op, T trash) in operator ()()
[all …]
|
| D | transform_scan.pass.cpp | 28 check_and_reset(Iterator expected_first, Iterator out_first, Size n, T trash) in check_and_reset() argument
33 std::fill_n(out_first, n, trash); in check_and_reset()
43 BinaryOp binary_op, T trash) in operator ()()
54 check_and_reset(expected_first, out_first, n, trash); in operator ()()
62 check_and_reset(expected_first, out_first, n, trash); in operator ()()
107 test(UnaryOp unary_op, Out init, BinaryOp binary_op, Out trash) in test() argument
128 Sequence<Out> out(n, [&](size_t) { return trash; }); in test()
135 check_and_reset(expected.begin(), out.begin(), out.size(), trash); in test()
138 expected.end(), in.size(), unary_op, init, binary_op, trash); in test()
140 expected.end(), in.size(), unary_op, init, binary_op, trash); in test()
[all …]
|
| D | adjacent_difference.pass.cpp | 102 Iterator2 actual_e, T trash, Function f) in operator ()()
108 Iterator2 actual_e, T trash, Function f) in operator ()()
116 T trash, Function f) in operator ()()
121 fill(actual_b, actual_e, trash); in operator ()()
128 fill(actual_b, actual_e, trash); in operator ()()
144 static constexpr T1 trash = T1(31); in test() local
153 actual.begin() + len, trash, pred); in test()
155 actual.begin() + len, trash, pred); in test()
|
| /external/llvm-project/pstl/test/std/algorithms/alg.modifying.operations/alg.copy/ |
| D | copy_if.pass.cpp | 30 Predicate pred, T trash) in operator ()()
38 OutputIterator2 expected_last, Size n, Predicate pred, T trash) in operator ()()
48 T trash) in operator ()()
51 std::fill_n(expected_first, n, trash); in operator ()()
52 std::fill_n(out_first, n, trash); in operator ()()
65 std::fill_n(expected_first, n, trash); in operator ()()
66 std::fill_n(out_first, n, trash); in operator ()()
81 test(T trash, Predicate pred, Convert convert, bool check_weakness = true) in test() argument
95 Sequence<T> out(count, [=](size_t) { return trash; }); in test()
96 Sequence<T> expected(count, [=](size_t) { return trash; }); in test()
[all …]
|
| /external/python/cpython3/Modules/ |
| D | gc_weakref.txt | 41 trash (CT) exists, then any call to any Python code whatsoever can end up
59 Clearing cyclic trash can call Python code. If there are weakrefs to
60 any of the cyclic trash, then those weakrefs can be used to resurrect
61 the objects. Therefore, *before* clearing cyclic trash, we need to
83 is that the weakly referenced object is unreachable trash at the time the
87 becomes part of a clump of cyclic trash. When enough cycles are broken by
102 Note that if it's possible for the callback to get at objects in the trash
104 trash cycles. Else the callback would have acted as an external root to
106 trash either.
111 More, if the callback itself is in cyclic trash, then the weakref to which
[all …]
|
| /external/python/cpython2/Modules/ |
| D | gc_weakref.txt | 41 trash (CT) exists, then any call to any Python code whatsoever can end up
59 Clearing cyclic trash can call Python code. If there are weakrefs to
60 any of the cyclic trash, then those weakrefs can be used to resurrect
61 the objects. Therefore, *before* clearing cyclic trash, we need to
83 is that the weakly referenced object is unreachable trash at the time the
87 becomes part of a clump of cyclic trash. When enough cycles are broken by
102 Note that if it's possible for the callback to get at objects in the trash
104 trash cycles. Else the callback would have acted as an external root to
106 trash either.
111 More, if the callback itself is in cyclic trash, then the weakref to which
[all …]
|
| /external/libaom/libaom/test/ |
| D | av1_horz_only_frame_superres_test.cc | 94 void FillEdge(ACMRandom *rnd, int num_pixels, int bd, bool trash, Pixel *data) { in FillEdge() argument
95 if (!trash) { in FillEdge()
|
| D | av1_convolve_scale_test.cc | 164 void FillEdge(ACMRandom *rnd, int num_pixels, int bd, bool trash, Pixel *data) { in FillEdge() argument
165 if (!trash) { in FillEdge()
|
| /external/gptfdisk/ |
| D | gptcurses.cc | 74 Space *trash; in EmptySpaces() local
77 trash = firstSpace; in EmptySpaces()
79 delete trash; in EmptySpaces()
|
| /external/igt-gpu-tools/tests/i915/ |
| D | gem_exec_reloc.c | 359 uint32_t trash = 0; in basic_reloc() local
434 trash = obj.handle; in basic_reloc()
496 if (trash) in basic_reloc()
497 gem_close(fd, trash); in basic_reloc()
|
| /external/python/cpython2/Lib/plat-mac/lib-scriptpackages/Finder/ |
| D | Finder_Basics.py | 118 trash = _Prop_trash() variable
|
| /external/tpm2-tss/src/tss2-tcti/ |
| D | tcti-mssim.c | 314 UINT32 trash; in tcti_mssim_receive() local
386 (unsigned char *)&trash, in tcti_mssim_receive()
|
| /external/mesa3d/docs/relnotes/ |
| D | 18.1.8.rst | 56 for TFB when statebuffer contain magic trash in the unused space
|
| D | 9.2.rst | 178 tiling2d in radeon trash vdpau UVD textures
|
| D | 18.3.0.rst | 175 for TFB when statebuffer contain magic trash in the unused space
|
| /external/python/cpython2/Misc/ |
| D | README.valgrind | 88 whatever trash gets read up will lead pymalloc to conclude
|
| /external/python/cpython3/Misc/ |
| D | README.valgrind | 99 whatever trash gets read up will lead pymalloc to conclude
|
| /external/libnl/ |
| D | ChangeLog | 63 Patrick McHardy <kaber@trash.net>
121 Patrick McHardy <kaber@trash.net>
|
| /external/fmtlib/doc/bootstrap/ |
| D | glyphicons.less | 61 .glyphicon-trash { &:before { content: "\e020"; } }
|