Home
last modified time | relevance | path

Searched refs:n_fill (Results 1 – 3 of 3) sorted by relevance

/third_party/boost/libs/histogram/test/
Dhistogram_threaded_test.cpp22 constexpr auto n_fill = 80000; variable
23 static_assert(n_fill % 4 == 0, "must be multiple of 4");
33 constexpr auto shift = n_fill / 4; in fill_test()
48 BOOST_TEST_EQ(algorithm::sum(h1), n_fill); in fill_test()
49 BOOST_TEST_EQ(algorithm::sum(h2), n_fill); in fill_test()
57 std::vector<int> vi(n_fill), vj(n_fill); in tests()
Dstorage_adaptor_threaded_test.cpp22 constexpr auto n_fill = 1000000; variable
31 for (unsigned i = 0; i < n_fill; ++i) { in tests()
46 BOOST_TEST_EQ(s[0], 4 * 2 * n_fill); in tests()
/third_party/python/Modules/_decimal/libmpdec/
Dio.c1156 size_t n_fill, len, i, j; in _mpd_add_pad() local
1161 n_fill = strlen(spec->fill); in _mpd_add_pad()
1164 add_bytes = add_chars * (mpd_ssize_t)n_fill; in _mpd_add_pad()
1196 memmove(cp+n_fill*lpad, cp, len); in _mpd_add_pad()
1198 for (j = 0; j < n_fill; j++) { in _mpd_add_pad()
1199 cp[i*n_fill+j] = spec->fill[j]; in _mpd_add_pad()
1202 cp += (n_fill*lpad + len); in _mpd_add_pad()
1204 for (j = 0; j < n_fill; j++) { in _mpd_add_pad()
1205 cp[i*n_fill+j] = spec->fill[j]; in _mpd_add_pad()