| /third_party/boost/libs/mpi/test/ |
| D | nonblocking_test.cpp | 49 nonblocking_tests( const communicator& comm, const T* values, int num_values, in nonblocking_tests() argument
52 nonblocking_test(comm, values, num_values, kind, mk_wait_any); in nonblocking_tests()
53 nonblocking_test(comm, values, num_values, kind, mk_test_any); in nonblocking_tests()
55 nonblocking_test(comm, values, num_values, kind, mk_wait_all); in nonblocking_tests()
56 nonblocking_test(comm, values, num_values, kind, mk_wait_all_keep); in nonblocking_tests()
58 nonblocking_test(comm, values, num_values, kind, mk_test_all); in nonblocking_tests()
59 nonblocking_test(comm, values, num_values, kind, mk_test_all_keep); in nonblocking_tests()
61 nonblocking_test(comm, values, num_values, kind, mk_wait_some); in nonblocking_tests()
62 nonblocking_test(comm, values, num_values, kind, mk_wait_some_keep); in nonblocking_tests()
63 nonblocking_test(comm, values, num_values, kind, mk_test_some); in nonblocking_tests()
[all …]
|
| D | ring_test.cpp | 73 boost::optional<int> num_values = stat.template count<T>(); in ring_array_test() local
75 BOOST_CHECK(num_values && *num_values == n); in ring_array_test()
77 BOOST_CHECK(!num_values || *num_values == n); in ring_array_test()
|
| /third_party/skia/third_party/externals/microhttpd/src/microspdy/ |
| D | structures.c | 98 container->num_values = 1; in SPDY_name_value_add()
141 pair->num_values = 1; in SPDY_name_value_add()
153 for(i=0; i<pair->num_values; ++i) in SPDY_name_value_add()
160 if (NULL == (temp_value = malloc((pair->num_values + 1) * sizeof(char *)))) in SPDY_name_value_add()
164 memcpy(temp_value, pair->value, pair->num_values * sizeof(char *)); in SPDY_name_value_add()
165 if (NULL == (temp_value[pair->num_values] = strdup (value))) in SPDY_name_value_add()
172 ++pair->num_values; in SPDY_name_value_add()
192 int *num_values) in SPDY_name_value_lookup() argument
196 if(NULL == container || NULL == name || NULL == num_values) in SPDY_name_value_lookup()
205 *num_values = temp->num_values; in SPDY_name_value_lookup()
[all …]
|
| D | applicationlayer.c | 95 if(1 != iterator->num_values) in spdy_handler_new_stream()
101 if(1 != iterator->num_values) in spdy_handler_new_stream()
107 if(1 != iterator->num_values) in spdy_handler_new_stream()
114 if(1 != iterator->num_values) in spdy_handler_new_stream()
120 if(1 != iterator->num_values) in spdy_handler_new_stream()
125 for(i=0; i<iterator->num_values; ++i) in spdy_handler_new_stream()
|
| /third_party/abseil-cpp/absl/random/internal/ |
| D | nanobenchmark.cc | 342 void CountingSort(T* values, size_t num_values) { in CountingSort() argument
346 for (size_t i = 0; i < num_values; ++i) { in CountingSort()
367 ABSL_RAW_CHECK(p == values + num_values, "Did not produce enough output"); in CountingSort()
398 const size_t num_values) { in ModeOfSorted() argument
400 size_t half_count = num_values / 2; in ModeOfSorted()
417 T Mode(T* values, const size_t num_values) { in Mode() argument
418 CountingSort(values, num_values); in Mode()
419 return ModeOfSorted(values, num_values); in Mode()
429 T Median(T* values, const size_t num_values) { in Median() argument
430 ABSL_RAW_CHECK(num_values != 0, "Empty input"); in Median()
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/random/internal/ |
| D | nanobenchmark.cc | 342 void CountingSort(T* values, size_t num_values) { in CountingSort() argument
346 for (size_t i = 0; i < num_values; ++i) { in CountingSort()
367 ABSL_RAW_CHECK(p == values + num_values, "Did not produce enough output"); in CountingSort()
398 const size_t num_values) { in ModeOfSorted() argument
400 size_t half_count = num_values / 2; in ModeOfSorted()
417 T Mode(T* values, const size_t num_values) { in Mode() argument
418 CountingSort(values, num_values); in Mode()
419 return ModeOfSorted(values, num_values); in Mode()
429 T Median(T* values, const size_t num_values) { in Median() argument
430 ABSL_RAW_CHECK(num_values != 0, "Empty input"); in Median()
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/base/ |
| D | bit_cast_test.cc | 32 void TestMarshall(const T values[], int num_values) { in TestMarshall() argument
33 for (int i = 0; i < num_values; ++i) { in TestMarshall()
52 void TestIntegral(const T values[], int num_values) { in TestIntegral() argument
53 for (int i = 0; i < num_values; ++i) { in TestIntegral()
|
| /third_party/abseil-cpp/absl/base/ |
| D | bit_cast_test.cc | 32 void TestMarshall(const T values[], int num_values) { in TestMarshall() argument
33 for (int i = 0; i < num_values; ++i) { in TestMarshall()
52 void TestIntegral(const T values[], int num_values) { in TestIntegral() argument
53 for (int i = 0; i < num_values; ++i) { in TestIntegral()
|
| /third_party/skia/third_party/externals/tint/src/transform/ |
| D | zero_init_workgroup_memory.cc | 127 var->Type()->UnwrapRef(), [&](uint32_t num_values) { in Run() argument
129 return Expression{b.Expr(var_name), num_values, ArrayIndices{}}; in Run()
269 using BuildZeroingExpr = std::function<Expression(uint32_t num_values)>;
297 BuildZeroingStatements(member->Type(), [&](uint32_t num_values) { in BuildZeroingStatements() argument
298 auto s = get_expr(num_values); in BuildZeroingStatements()
307 BuildZeroingStatements(arr->ElemType(), [&](uint32_t num_values) { in BuildZeroingStatements() argument
314 auto modulo = num_values * arr->Count(); in BuildZeroingStatements()
315 auto division = num_values; in BuildZeroingStatements()
|
| /third_party/boost/libs/intrusive/test/ |
| D | generic_assoc_test.hpp | 227 std::size_t num_values; in test_splay_up() local
231 num_values = testset.size(); in test_splay_up()
235 for(std::size_t i = 0; i != num_values; ++i){ in test_splay_up()
242 BOOST_TEST (testset.size() == num_values); in test_splay_up()
262 std::size_t num_values; in test_splay_down() local
266 num_values = testset.size(); in test_splay_down()
270 for(std::size_t i = 0; i != num_values; ++i){ in test_splay_down()
272 BOOST_TEST(testset.size() == num_values); in test_splay_down()
278 BOOST_TEST (testset.size() == num_values); in test_splay_down()
|
| D | list_test.cpp | 242 const int num_values = (int)values.size(); in test_shift() local
243 std::vector<int> expected_values(num_values); in test_shift()
245 for(int s = 1; s <= num_values; ++s){ in test_shift()
|
| /third_party/skia/third_party/externals/microhttpd/src/testspdy/ |
| D | test_struct_namevalue.c | 42 iterate_cb (void *cls, const char *name, const char * const * value, int num_values) in iterate_cb() argument
54 if(1 != num_values) in iterate_cb()
70 iterate_brake_cb (void *cls, const char *name, const char * const *value, int num_values) in iterate_brake_cb() argument
74 (void)num_values; in iterate_brake_cb()
|
| /third_party/mindspore/mindspore/lite/micro/coder/wrapper/base/ |
| D | detection_post_process_base_wrapper.c | 53 void PartialArgSort(const float *scores, int *indexes, int num_to_sort, int num_values) { in PartialArgSort() argument
60 for (int i = num_to_sort; i < num_values; ++i) { in PartialArgSort()
|
| D | detection_post_process_base_wrapper.h | 22 void PartialArgSort(const float *scores, int *indexes, int num_to_sort, int num_values);
|
| /third_party/mindspore/tests/st/ops/cpu/ |
| D | test_rolling_op.py | 72 def get_window_bounds(num_values: int, window_size: int, center: bool, closed: str = 'right') -> Tu…
76 end = np.arange(offset + 1, num_values + 1 + offset, dtype=np.int64)
83 end = np.clip(end, 0, num_values)
84 start = np.clip(start, 0, num_values)
|
| /third_party/mesa3d/src/gallium/drivers/llvmpipe/ |
| D | lp_test_arit.c | 84 unsigned num_values; member
451 for (j = 0; j < (test->num_values + length - 1) / length; j++) { in test_unary()
452 int num_vals = ((j + 1) * length <= test->num_values) ? length : in test_unary()
453 test->num_values % length; in test_unary()
|
| /third_party/skia/third_party/externals/microhttpd/src/examples/ |
| D | spdy_event_loop.c | 181 const char *name, const char * const *value, int num_values) in append_headers_to_data() argument
187 if(num_values) in append_headers_to_data()
188 for(i=0;i<num_values;++i) in append_headers_to_data()
|
| /third_party/boost/boost/gil/ |
| D | channel.hpp | 385 static const num_value_t num_values = static_cast< num_value_t >( 1 ) << NumBits ; member in boost::gil::detail::packed_channel_reference_base
386 static const max_value_t max_val = static_cast< max_value_t >( num_values - 1 );
404 this->derived().set_unsafe(((value % num_values) + num_values) % num_values); in set()
|
| /third_party/mesa3d/src/compiler/isaspec/ |
| D | decode.h | 42 unsigned num_values; member
|
| /third_party/skia/third_party/externals/microhttpd/src/spdy2http/ |
| D | proxy.c | 539 int num_values; in curl_header_cb() local
660 if(NULL != (values = SPDY_name_value_lookup(proxy->headers, name, &num_values))) in curl_header_cb()
661 for(i=0; i<(unsigned int)num_values; ++i) in curl_header_cb()
790 iterate_cb (void *cls, const char *name, const char * const * value, int num_values) in iterate_cb() argument
798 for(i=0; i<num_values; ++i) in iterate_cb()
814 for(i=0; i<num_values; ++i) in iterate_cb()
|
| /third_party/boost/libs/unordered/test/unordered/ |
| D | erase_equiv_tests.cpp | 189 void exhaustive_erase_tests(Container* x, int num_values, int num_duplicated) in exhaustive_erase_tests() argument
191 for (int i = 0; i < num_values; ++i) { in exhaustive_erase_tests()
|
| /third_party/mesa3d/src/intel/compiler/ |
| D | brw_compiler.c | 287 unsigned num_values) in brw_write_shader_relocs() argument
292 for (unsigned j = 0; j < num_values; j++) { in brw_write_shader_relocs()
|
| /third_party/skia/third_party/externals/microhttpd/src/include/ |
| D | microspdy.h | 641 int num_values);
1049 int *num_values);
|
| /third_party/python/Lib/test/ |
| D | test_winreg.py | 273 num_subkeys, num_values, t = QueryInfoKey(key)
274 for i in range(num_values):
291 num_subkeys, num_values, t = QueryInfoKey(key)
|
| /third_party/mindspore/mindspore/lite/src/runtime/kernel/arm/base/ |
| D | detection_post_process_base.cc | 32 void PartialArgSort(const float *scores, int *indexes, int num_to_sort, int num_values) { in PartialArgSort() argument
33 …std::partial_sort(indexes, indexes + num_to_sort, indexes + num_values, [&scores](const int i, con… in PartialArgSort()
|