| /dports/textproc/sonic/sonic-1.3.0/cargo-crates/librocksdb-sys-6.7.4/rocksdb/util/ |
| H A D | bloom_impl.h | 30 static double StandardFpRate(double bits_per_key, int num_probes) { in StandardFpRate() argument
33 return std::pow(1.0 - std::exp(-num_probes / bits_per_key), num_probes); in StandardFpRate()
195 int num_probes, char *data) { in AddHash() argument
229 int rem_probes = num_probes; in HashMayMatchPrepared()
353 if (num_probes < 1) num_probes = 1; in ChooseNumProbes()
354 if (num_probes > 30) num_probes = 30; in ChooseNumProbes()
355 return num_probes; in ChooseNumProbes()
361 for (int i = 0; i < num_probes; i++) { in AddHash()
371 for (int i = 0; i < num_probes; i++) { in HashMayMatch()
433 for (int i = 0; i < num_probes; ++i) { in AddHash()
[all …]
|
| H A D | dynamic_bloom.cc | 29 uint32_t num_probes, size_t huge_page_tlb_size, in DynamicBloom() argument
32 : kNumDoubleProbes((num_probes + (num_probes == 1)) / 2) { in DynamicBloom()
33 assert(num_probes % 2 == 0); // limitation of current implementation in DynamicBloom()
34 assert(num_probes <= 10); // limitation of current implementation in DynamicBloom()
|
| /dports/databases/percona57-client/percona-server-5.7.36-39/storage/rocksdb/rocksdb/util/ |
| H A D | bloom_impl.h | 32 static double StandardFpRate(double bits_per_key, int num_probes) { in StandardFpRate() argument
35 return std::pow(1.0 - std::exp(-num_probes / bits_per_key), num_probes); in StandardFpRate()
197 int num_probes, char *data) { in AddHash() argument
231 int rem_probes = num_probes; in HashMayMatchPrepared()
355 if (num_probes < 1) num_probes = 1; in ChooseNumProbes()
356 if (num_probes > 30) num_probes = 30; in ChooseNumProbes()
357 return num_probes; in ChooseNumProbes()
363 for (int i = 0; i < num_probes; i++) { in AddHash()
373 for (int i = 0; i < num_probes; i++) { in HashMayMatch()
435 for (int i = 0; i < num_probes; ++i) { in AddHash()
[all …]
|
| H A D | dynamic_bloom.cc | 29 uint32_t num_probes, size_t huge_page_tlb_size, in DynamicBloom() argument
32 : kNumDoubleProbes((num_probes + (num_probes == 1)) / 2) { in DynamicBloom()
33 assert(num_probes % 2 == 0); // limitation of current implementation in DynamicBloom()
34 assert(num_probes <= 10); // limitation of current implementation in DynamicBloom()
|
| /dports/databases/rocksdb/rocksdb-6.26.1/util/ |
| H A D | bloom_impl.h | 32 static double StandardFpRate(double bits_per_key, int num_probes) { in StandardFpRate() argument
35 return std::pow(1.0 - std::exp(-num_probes / bits_per_key), num_probes); in StandardFpRate()
197 int num_probes, char *data) { in AddHash() argument
231 int rem_probes = num_probes; in HashMayMatchPrepared()
355 if (num_probes < 1) num_probes = 1; in ChooseNumProbes()
356 if (num_probes > 30) num_probes = 30; in ChooseNumProbes()
357 return num_probes; in ChooseNumProbes()
363 for (int i = 0; i < num_probes; i++) { in AddHash()
373 for (int i = 0; i < num_probes; i++) { in HashMayMatch()
435 for (int i = 0; i < num_probes; ++i) { in AddHash()
[all …]
|
| H A D | dynamic_bloom.cc | 29 uint32_t num_probes, size_t huge_page_tlb_size, in DynamicBloom() argument
32 : kNumDoubleProbes((num_probes + (num_probes == 1)) / 2) { in DynamicBloom()
33 assert(num_probes % 2 == 0); // limitation of current implementation in DynamicBloom()
34 assert(num_probes <= 10); // limitation of current implementation in DynamicBloom()
|
| /dports/databases/rocksdb-lite/rocksdb-6.26.1/util/ |
| H A D | bloom_impl.h | 32 static double StandardFpRate(double bits_per_key, int num_probes) { in StandardFpRate() argument
35 return std::pow(1.0 - std::exp(-num_probes / bits_per_key), num_probes); in StandardFpRate()
197 int num_probes, char *data) { in AddHash() argument
231 int rem_probes = num_probes; in HashMayMatchPrepared()
355 if (num_probes < 1) num_probes = 1; in ChooseNumProbes()
356 if (num_probes > 30) num_probes = 30; in ChooseNumProbes()
357 return num_probes; in ChooseNumProbes()
363 for (int i = 0; i < num_probes; i++) { in AddHash()
373 for (int i = 0; i < num_probes; i++) { in HashMayMatch()
435 for (int i = 0; i < num_probes; ++i) { in AddHash()
[all …]
|
| H A D | dynamic_bloom.cc | 29 uint32_t num_probes, size_t huge_page_tlb_size, in DynamicBloom() argument
32 : kNumDoubleProbes((num_probes + (num_probes == 1)) / 2) { in DynamicBloom()
33 assert(num_probes % 2 == 0); // limitation of current implementation in DynamicBloom()
34 assert(num_probes <= 10); // limitation of current implementation in DynamicBloom()
|
| /dports/databases/percona57-server/percona-server-5.7.36-39/storage/rocksdb/rocksdb/util/ |
| H A D | bloom_impl.h | 32 static double StandardFpRate(double bits_per_key, int num_probes) { in StandardFpRate() argument
35 return std::pow(1.0 - std::exp(-num_probes / bits_per_key), num_probes); in StandardFpRate()
197 int num_probes, char *data) { in AddHash() argument
231 int rem_probes = num_probes; in HashMayMatchPrepared()
355 if (num_probes < 1) num_probes = 1; in ChooseNumProbes()
356 if (num_probes > 30) num_probes = 30; in ChooseNumProbes()
357 return num_probes; in ChooseNumProbes()
363 for (int i = 0; i < num_probes; i++) { in AddHash()
373 for (int i = 0; i < num_probes; i++) { in HashMayMatch()
435 for (int i = 0; i < num_probes; ++i) { in AddHash()
[all …]
|
| H A D | dynamic_bloom.cc | 29 uint32_t num_probes, size_t huge_page_tlb_size, in DynamicBloom() argument
32 : kNumDoubleProbes((num_probes + (num_probes == 1)) / 2) { in DynamicBloom()
33 assert(num_probes % 2 == 0); // limitation of current implementation in DynamicBloom()
34 assert(num_probes <= 10); // limitation of current implementation in DynamicBloom()
|
| /dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/rocksdb/rocksdb/util/ |
| H A D | bloom_impl.h | 32 static double StandardFpRate(double bits_per_key, int num_probes) { in StandardFpRate() argument
35 return std::pow(1.0 - std::exp(-num_probes / bits_per_key), num_probes); in StandardFpRate()
197 int num_probes, char *data) { in AddHash() argument
231 int rem_probes = num_probes; in HashMayMatchPrepared()
355 if (num_probes < 1) num_probes = 1; in ChooseNumProbes()
356 if (num_probes > 30) num_probes = 30; in ChooseNumProbes()
357 return num_probes; in ChooseNumProbes()
363 for (int i = 0; i < num_probes; i++) { in AddHash()
373 for (int i = 0; i < num_probes; i++) { in HashMayMatch()
435 for (int i = 0; i < num_probes; ++i) { in AddHash()
[all …]
|
| H A D | dynamic_bloom.cc | 29 uint32_t num_probes, size_t huge_page_tlb_size, in DynamicBloom() argument
32 : kNumDoubleProbes((num_probes + (num_probes == 1)) / 2) { in DynamicBloom()
33 assert(num_probes % 2 == 0); // limitation of current implementation in DynamicBloom()
34 assert(num_probes <= 10); // limitation of current implementation in DynamicBloom()
|
| /dports/databases/mariadb104-server/mariadb-10.4.24/storage/rocksdb/rocksdb/util/ |
| H A D | bloom_impl.h | 30 static double StandardFpRate(double bits_per_key, int num_probes) { in StandardFpRate() argument
33 return std::pow(1.0 - std::exp(-num_probes / bits_per_key), num_probes); in StandardFpRate()
195 int num_probes, char *data) { in AddHash() argument
229 int rem_probes = num_probes; in HashMayMatchPrepared()
353 if (num_probes < 1) num_probes = 1; in ChooseNumProbes()
354 if (num_probes > 30) num_probes = 30; in ChooseNumProbes()
355 return num_probes; in ChooseNumProbes()
361 for (int i = 0; i < num_probes; i++) { in AddHash()
371 for (int i = 0; i < num_probes; i++) { in HashMayMatch()
433 for (int i = 0; i < num_probes; ++i) { in AddHash()
[all …]
|
| H A D | dynamic_bloom.cc | 29 uint32_t num_probes, size_t huge_page_tlb_size, in DynamicBloom() argument
32 : kNumDoubleProbes((num_probes + (num_probes == 1)) / 2) { in DynamicBloom()
33 assert(num_probes % 2 == 0); // limitation of current implementation in DynamicBloom()
34 assert(num_probes <= 10); // limitation of current implementation in DynamicBloom()
|
| /dports/databases/mariadb104-client/mariadb-10.4.24/storage/rocksdb/rocksdb/util/ |
| H A D | bloom_impl.h | 30 static double StandardFpRate(double bits_per_key, int num_probes) { in StandardFpRate() argument
33 return std::pow(1.0 - std::exp(-num_probes / bits_per_key), num_probes); in StandardFpRate()
195 int num_probes, char *data) { in AddHash() argument
229 int rem_probes = num_probes; in HashMayMatchPrepared()
353 if (num_probes < 1) num_probes = 1; in ChooseNumProbes()
354 if (num_probes > 30) num_probes = 30; in ChooseNumProbes()
355 return num_probes; in ChooseNumProbes()
361 for (int i = 0; i < num_probes; i++) { in AddHash()
371 for (int i = 0; i < num_probes; i++) { in HashMayMatch()
433 for (int i = 0; i < num_probes; ++i) { in AddHash()
[all …]
|
| H A D | dynamic_bloom.cc | 29 uint32_t num_probes, size_t huge_page_tlb_size, in DynamicBloom() argument
32 : kNumDoubleProbes((num_probes + (num_probes == 1)) / 2) { in DynamicBloom()
33 assert(num_probes % 2 == 0); // limitation of current implementation in DynamicBloom()
34 assert(num_probes <= 10); // limitation of current implementation in DynamicBloom()
|
| /dports/databases/mariadb105-client/mariadb-10.5.15/storage/rocksdb/rocksdb/util/ |
| H A D | bloom_impl.h | 30 static double StandardFpRate(double bits_per_key, int num_probes) { in StandardFpRate() argument
33 return std::pow(1.0 - std::exp(-num_probes / bits_per_key), num_probes); in StandardFpRate()
195 int num_probes, char *data) { in AddHash() argument
229 int rem_probes = num_probes; in HashMayMatchPrepared()
353 if (num_probes < 1) num_probes = 1; in ChooseNumProbes()
354 if (num_probes > 30) num_probes = 30; in ChooseNumProbes()
355 return num_probes; in ChooseNumProbes()
361 for (int i = 0; i < num_probes; i++) { in AddHash()
371 for (int i = 0; i < num_probes; i++) { in HashMayMatch()
433 for (int i = 0; i < num_probes; ++i) { in AddHash()
[all …]
|
| H A D | dynamic_bloom.cc | 29 uint32_t num_probes, size_t huge_page_tlb_size, in DynamicBloom() argument
32 : kNumDoubleProbes((num_probes + (num_probes == 1)) / 2) { in DynamicBloom()
33 assert(num_probes % 2 == 0); // limitation of current implementation in DynamicBloom()
34 assert(num_probes <= 10); // limitation of current implementation in DynamicBloom()
|
| /dports/databases/mariadb103-client/mariadb-10.3.34/storage/rocksdb/rocksdb/util/ |
| H A D | bloom_impl.h | 30 static double StandardFpRate(double bits_per_key, int num_probes) { in StandardFpRate() argument
33 return std::pow(1.0 - std::exp(-num_probes / bits_per_key), num_probes); in StandardFpRate()
195 int num_probes, char *data) { in AddHash() argument
229 int rem_probes = num_probes; in HashMayMatchPrepared()
353 if (num_probes < 1) num_probes = 1; in ChooseNumProbes()
354 if (num_probes > 30) num_probes = 30; in ChooseNumProbes()
355 return num_probes; in ChooseNumProbes()
361 for (int i = 0; i < num_probes; i++) { in AddHash()
371 for (int i = 0; i < num_probes; i++) { in HashMayMatch()
433 for (int i = 0; i < num_probes; ++i) { in AddHash()
[all …]
|
| H A D | dynamic_bloom.cc | 29 uint32_t num_probes, size_t huge_page_tlb_size, in DynamicBloom() argument
32 : kNumDoubleProbes((num_probes + (num_probes == 1)) / 2) { in DynamicBloom()
33 assert(num_probes % 2 == 0); // limitation of current implementation in DynamicBloom()
34 assert(num_probes <= 10); // limitation of current implementation in DynamicBloom()
|
| /dports/databases/mariadb103-server/mariadb-10.3.34/storage/rocksdb/rocksdb/util/ |
| H A D | bloom_impl.h | 30 static double StandardFpRate(double bits_per_key, int num_probes) { in StandardFpRate() argument
33 return std::pow(1.0 - std::exp(-num_probes / bits_per_key), num_probes); in StandardFpRate()
195 int num_probes, char *data) { in AddHash() argument
229 int rem_probes = num_probes; in HashMayMatchPrepared()
353 if (num_probes < 1) num_probes = 1; in ChooseNumProbes()
354 if (num_probes > 30) num_probes = 30; in ChooseNumProbes()
355 return num_probes; in ChooseNumProbes()
361 for (int i = 0; i < num_probes; i++) { in AddHash()
371 for (int i = 0; i < num_probes; i++) { in HashMayMatch()
433 for (int i = 0; i < num_probes; ++i) { in AddHash()
[all …]
|
| H A D | dynamic_bloom.cc | 29 uint32_t num_probes, size_t huge_page_tlb_size, in DynamicBloom() argument
32 : kNumDoubleProbes((num_probes + (num_probes == 1)) / 2) { in DynamicBloom()
33 assert(num_probes % 2 == 0); // limitation of current implementation in DynamicBloom()
34 assert(num_probes <= 10); // limitation of current implementation in DynamicBloom()
|
| /dports/databases/mariadb105-server/mariadb-10.5.15/storage/rocksdb/rocksdb/util/ |
| H A D | bloom_impl.h | 30 static double StandardFpRate(double bits_per_key, int num_probes) { in StandardFpRate() argument
33 return std::pow(1.0 - std::exp(-num_probes / bits_per_key), num_probes); in StandardFpRate()
195 int num_probes, char *data) { in AddHash() argument
229 int rem_probes = num_probes; in HashMayMatchPrepared()
353 if (num_probes < 1) num_probes = 1; in ChooseNumProbes()
354 if (num_probes > 30) num_probes = 30; in ChooseNumProbes()
355 return num_probes; in ChooseNumProbes()
361 for (int i = 0; i < num_probes; i++) { in AddHash()
371 for (int i = 0; i < num_probes; i++) { in HashMayMatch()
433 for (int i = 0; i < num_probes; ++i) { in AddHash()
[all …]
|
| H A D | dynamic_bloom.cc | 29 uint32_t num_probes, size_t huge_page_tlb_size, in DynamicBloom() argument
32 : kNumDoubleProbes((num_probes + (num_probes == 1)) / 2) { in DynamicBloom()
33 assert(num_probes % 2 == 0); // limitation of current implementation in DynamicBloom()
34 assert(num_probes <= 10); // limitation of current implementation in DynamicBloom()
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/abseil-cpp/absl/container/internal/ |
| H A D | hashtable_debug_hooks.h | 61 size_t num_probes = 0; in GetNumProbes() local
63 for (auto it = c.begin(bucket), e = c.end(bucket);; ++it, ++num_probes) { in GetNumProbes()
64 if (it == e) return num_probes; in GetNumProbes()
65 if (c.key_eq()(key, GetKey<Container>(*it, 0))) return num_probes; in GetNumProbes()
|