Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:small_primes (Results 1 - 3 of 3) sorted by null

/external/libcxx/src/
hash.cpp	24 const unsigned small_primes[] = member in namespace:__anon23069 182 const size_t N = sizeof(small_primes) / sizeof(small_primes[0]); 183 // If n is small enough, search in small_primes 184 if (n <= small_primes[N-1]) 185 return *std::lower_bound(small_primes, small_primes + N, n); 186 // Else n > largest small_primes 208 const std::size_t p = small_primes[j];
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/src/
hash.cpp	24 const unsigned small_primes[] = member in namespace:__anon111768 182 const size_t N = sizeof(small_primes) / sizeof(small_primes[0]); 183 // If n is small enough, search in small_primes 184 if (n <= small_primes[N-1]) 185 return *std::lower_bound(small_primes, small_primes + N, n); 186 // Else n > largest small_primes 208 const std::size_t p = small_primes[j];
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/src/
hash.cpp	24 const unsigned small_primes[] = member in namespace:__anon112155 182 const size_t N = sizeof(small_primes) / sizeof(small_primes[0]); 183 // If n is small enough, search in small_primes 184 if (n <= small_primes[N-1]) 185 return *std::lower_bound(small_primes, small_primes + N, n); 186 // Else n > largest small_primes 208 const std::size_t p = small_primes[j];

Completed in 446 milliseconds