Home
last modified time | relevance | path

Searched refs:__next_prime (Results 1 – 8 of 8) sorted by relevance

/external/libcxx/test/libcxx/containers/unord/
Dnext_prime.pass.cpp42 assert(std::__next_prime(0) == 0); in main()
45 std::size_t p = std::__next_prime(n); in main()
/external/llvm-project/libcxx/test/libcxx/containers/unord/
Dnext_prime.pass.cpp43 assert(std::__next_prime(0) == 0); in main()
46 std::size_t p = std::__next_prime(n); in main()
/external/llvm-project/libcxx/src/
Ddebug.cpp178 size_t nc = __next_prime(2*static_cast<size_t>(__cend_ - __cbeg_) + 1); in __insert_c()
515 size_t nc = __next_prime(2*static_cast<size_t>(__iend_ - __ibeg_) + 1); in __insert_iterator()
Dhash.cpp170 __next_prime(size_t n) in __next_prime() function
/external/libcxx/src/
Ddebug.cpp215 size_t nc = __next_prime(2*static_cast<size_t>(__cend_ - __cbeg_) + 1); in __insert_c()
555 size_t nc = __next_prime(2*static_cast<size_t>(__iend_ - __ibeg_) + 1); in __insert_iterator()
Dhash.cpp179 __next_prime(size_t n) in __next_prime() function
/external/llvm-project/libcxx/include/
D__hash_table50 size_t __next_prime(size_t __n);
2312 __n = __next_prime(__n);
2322__next_prime(size_t(ceil(float(size()) / max_load_factor())))
/external/libcxx/include/
D__hash_table53 size_t __next_prime(size_t __n);
2380 __n = __next_prime(__n);
2390__next_prime(size_t(ceil(float(size()) / max_load_factor())))