Home
last modified time | relevance | path

Searched refs:num_probes (Results 76 – 100 of 322) sorted by relevance

12345678910>>...13

/dports/databases/mariadb103-server/mariadb-10.3.34/storage/rocksdb/rocksdb/table/plain/
H A Dplain_table_bloom.h39 explicit PlainTableBloomV1(uint32_t num_probes = 6);
116 explicit BloomBlockBuilder(uint32_t num_probes = 6) : bloom_(num_probes) {} in bloom_() argument
H A Dplain_table_bloom.cc32 PlainTableBloomV1::PlainTableBloomV1(uint32_t num_probes) in PlainTableBloomV1() argument
33 : kTotalBits(0), kNumBlocks(0), kNumProbes(num_probes), data_(nullptr) {} in PlainTableBloomV1()
/dports/databases/mariadb105-client/mariadb-10.5.15/storage/rocksdb/rocksdb/table/plain/
H A Dplain_table_bloom.h39 explicit PlainTableBloomV1(uint32_t num_probes = 6);
116 explicit BloomBlockBuilder(uint32_t num_probes = 6) : bloom_(num_probes) {} in bloom_() argument
H A Dplain_table_bloom.cc32 PlainTableBloomV1::PlainTableBloomV1(uint32_t num_probes) in PlainTableBloomV1() argument
33 : kTotalBits(0), kNumBlocks(0), kNumProbes(num_probes), data_(nullptr) {} in PlainTableBloomV1()
/dports/databases/mariadb105-server/mariadb-10.5.15/storage/rocksdb/rocksdb/table/plain/
H A Dplain_table_bloom.h39 explicit PlainTableBloomV1(uint32_t num_probes = 6);
116 explicit BloomBlockBuilder(uint32_t num_probes = 6) : bloom_(num_probes) {} in bloom_() argument
H A Dplain_table_bloom.cc32 PlainTableBloomV1::PlainTableBloomV1(uint32_t num_probes) in PlainTableBloomV1() argument
33 : kTotalBits(0), kNumBlocks(0), kNumProbes(num_probes), data_(nullptr) {} in PlainTableBloomV1()
/dports/science/axom/axom-0.6.1/src/thirdparty/axom/sparsehash/internal/
H A Dsparsehashtable.h123 #define JUMP_(key, num_probes) ( num_probes ) argument
677 size_type num_probes = 0; // how many times we've probed in copy_from() local
683 ++num_probes; in copy_from()
684 assert(num_probes < bucket_count() in copy_from()
722 ++num_probes; in move_from()
723 assert(num_probes < bucket_count() in move_from()
839 size_type num_probes = 0; // how many times we've probed in find_position() local
846 SPARSEHASH_STAT_UPDATE(total_probes += num_probes); in find_position()
857 SPARSEHASH_STAT_UPDATE(total_probes += num_probes); in find_position()
860 ++num_probes; // we're doing another probe in find_position()
[all …]
/dports/devel/sparsehash/sparsehash-sparsehash-2.0.4/src/sparsehash/internal/
H A Dsparsehashtable.h123 #define JUMP_(key, num_probes) ( num_probes ) argument
677 size_type num_probes = 0; // how many times we've probed in copy_from() local
683 ++num_probes; in copy_from()
684 assert(num_probes < bucket_count() in copy_from()
722 ++num_probes; in move_from()
723 assert(num_probes < bucket_count() in move_from()
839 size_type num_probes = 0; // how many times we've probed in find_position() local
846 SPARSEHASH_STAT_UPDATE(total_probes += num_probes); in find_position()
857 SPARSEHASH_STAT_UPDATE(total_probes += num_probes); in find_position()
860 ++num_probes; // we're doing another probe in find_position()
[all …]
/dports/net-mgmt/portmon/portmon-2.0/src/
H A Dreport.c30 int report(int num_hosts, int num_probes, int lag_timeout, char *output_fmt) in report() argument
40 for(k = 0; k < num_probes; k++) { in report()
52 for(k = 0; k < num_probes; k++) { in report()
H A Dportmon.c159 int host_down, ret = 0, num_probes = 3, lag_timeout = MAXINT, avg_time; local
216 num_probes = atoi(optarg);
281 report(num_hosts, num_probes, lag_timeout, output_fmt);
314 for(k = 0; k < num_probes; k++) {
323 for(k = 0; k < num_probes; k++) {
/dports/textproc/sonic/sonic-1.3.0/cargo-crates/librocksdb-sys-6.7.4/rocksdb/table/plain/
H A Dplain_table_bloom.cc32 PlainTableBloomV1::PlainTableBloomV1(uint32_t num_probes) in PlainTableBloomV1() argument
33 : kTotalBits(0), kNumBlocks(0), kNumProbes(num_probes), data_(nullptr) {} in PlainTableBloomV1()
/dports/databases/rocksdb/rocksdb-6.26.1/table/plain/
H A Dplain_table_bloom.cc32 PlainTableBloomV1::PlainTableBloomV1(uint32_t num_probes) in PlainTableBloomV1() argument
33 : kTotalBits(0), kNumBlocks(0), kNumProbes(num_probes), data_(nullptr) {} in PlainTableBloomV1()
/dports/databases/percona57-client/percona-server-5.7.36-39/storage/rocksdb/rocksdb/table/plain/
H A Dplain_table_bloom.cc32 PlainTableBloomV1::PlainTableBloomV1(uint32_t num_probes) in PlainTableBloomV1() argument
33 : kTotalBits(0), kNumBlocks(0), kNumProbes(num_probes), data_(nullptr) {} in PlainTableBloomV1()
/dports/databases/percona57-server/percona-server-5.7.36-39/storage/rocksdb/rocksdb/table/plain/
H A Dplain_table_bloom.cc32 PlainTableBloomV1::PlainTableBloomV1(uint32_t num_probes) in PlainTableBloomV1() argument
33 : kTotalBits(0), kNumBlocks(0), kNumProbes(num_probes), data_(nullptr) {} in PlainTableBloomV1()
/dports/databases/rocksdb-lite/rocksdb-6.26.1/table/plain/
H A Dplain_table_bloom.cc32 PlainTableBloomV1::PlainTableBloomV1(uint32_t num_probes) in PlainTableBloomV1() argument
33 : kTotalBits(0), kNumBlocks(0), kNumProbes(num_probes), data_(nullptr) {} in PlainTableBloomV1()
/dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/rocksdb/rocksdb/table/plain/
H A Dplain_table_bloom.cc32 PlainTableBloomV1::PlainTableBloomV1(uint32_t num_probes) in PlainTableBloomV1() argument
33 : kTotalBits(0), kNumBlocks(0), kNumProbes(num_probes), data_(nullptr) {} in PlainTableBloomV1()
/dports/databases/mariadb104-server/mariadb-10.4.24/storage/rocksdb/rocksdb/table/plain/
H A Dplain_table_bloom.cc32 PlainTableBloomV1::PlainTableBloomV1(uint32_t num_probes) in PlainTableBloomV1() argument
33 : kTotalBits(0), kNumBlocks(0), kNumProbes(num_probes), data_(nullptr) {} in PlainTableBloomV1()
/dports/databases/mariadb104-client/mariadb-10.4.24/storage/rocksdb/rocksdb/table/plain/
H A Dplain_table_bloom.cc32 PlainTableBloomV1::PlainTableBloomV1(uint32_t num_probes) in PlainTableBloomV1() argument
33 : kTotalBits(0), kNumBlocks(0), kNumProbes(num_probes), data_(nullptr) {} in PlainTableBloomV1()
/dports/databases/mariadb103-client/mariadb-10.3.34/storage/rocksdb/rocksdb/table/plain/
H A Dplain_table_bloom.cc32 PlainTableBloomV1::PlainTableBloomV1(uint32_t num_probes) in PlainTableBloomV1() argument
33 : kTotalBits(0), kNumBlocks(0), kNumProbes(num_probes), data_(nullptr) {} in PlainTableBloomV1()
/dports/devel/gdb/gdb-11.1/gdb/
H A Ddtrace-probe.c390 int i, j, num_probes, num_enablers; in dtrace_process_dof_probe() local
429 num_probes = DOF_UINT (dof, probe->dofpr_noffs); in dtrace_process_dof_probe()
430 if (num_probes == 0) in dtrace_process_dof_probe()
448 for (i = 0; i < num_probes; i++) in dtrace_process_dof_probe()
576 int num_probes; in dtrace_process_dof() local
591 num_probes = DOF_UINT (dof, probes_s->dofs_size) / entsize; in dtrace_process_dof()
593 for (i = 0; i < num_probes; i++) in dtrace_process_dof()
/dports/math/igraph/igraph-0.9.5/vendor/plfit/
H A Dplfit.c450 size_t num_probes; /**< Number of probes */ member
530 for (i = 0; i < local_opt_data.num_probes-1; i++) { in plfit_i_continuous_xmin_opt_linear_scan()
610 opt_data.num_probes = num_uniques; in plfit_continuous()
612 success = (gss(0, opt_data.num_probes-5, &x, 0, in plfit_continuous()
638 opt_data.num_probes = num_strata; in plfit_continuous()
641 opt_data.num_probes = 0; in plfit_continuous()
648 opt_data.num_probes = 0; in plfit_continuous()
650 opt_data.num_probes += subdivision_length; in plfit_continuous()
652 opt_data.num_probes += subdivision_length; in plfit_continuous()
658 if (opt_data.num_probes > 0) { in plfit_continuous()
[all …]
/dports/math/R-cran-igraph/igraph/src/plfit/
H A Dplfit.c449 size_t num_probes; /**< Number of probes */ member
525 for (i = 0; i < local_opt_data.num_probes-1; i++) { in plfit_i_continuous_xmin_opt_linear_scan()
605 opt_data.num_probes = num_uniques; in plfit_continuous()
607 success = (gss(0, opt_data.num_probes-5, &x, 0, in plfit_continuous()
633 opt_data.num_probes = num_strata; in plfit_continuous()
636 opt_data.num_probes = 0; in plfit_continuous()
643 opt_data.num_probes = 0; in plfit_continuous()
645 opt_data.num_probes += subdivision_length; in plfit_continuous()
647 opt_data.num_probes += subdivision_length; in plfit_continuous()
653 if (opt_data.num_probes > 0) { in plfit_continuous()
[all …]
/dports/graphics/R-cran-s2/s2/src/s2/util/gtl/
H A Ddensehashtable.h136 #define JUMP_(key, num_probes) (num_probes) argument
697 size_type num_probes = 0; // how many times we've probed in copy_elements() local
703 JUMP_(key, num_probes)) & bucket_count_minus_one) { in copy_elements()
704 ++num_probes; in copy_elements()
705 assert(num_probes < dest_bucket_count in copy_elements()
1033 size_type num_probes = 0; // how many times we've probed in find_position_using_hash() local
1052 ++num_probes; // we're doing another probe in find_position_using_hash()
1054 assert(num_probes < bucket_count() in find_position_using_hash()
1072 size_type num_probes = 0; // how many times we've probed in find_if_present_using_hash() local
1081 ++num_probes; // we're doing another probe in find_if_present_using_hash()
[all …]
/dports/graphics/s2/s2geometry-0.9.0/src/s2/util/gtl/
H A Ddensehashtable.h136 #define JUMP_(key, num_probes) (num_probes) argument
697 size_type num_probes = 0; // how many times we've probed in copy_elements() local
703 JUMP_(key, num_probes)) & bucket_count_minus_one) { in copy_elements()
704 ++num_probes; in copy_elements()
705 assert(num_probes < dest_bucket_count in copy_elements()
1033 size_type num_probes = 0; // how many times we've probed in find_position_using_hash() local
1052 ++num_probes; // we're doing another probe in find_position_using_hash()
1054 assert(num_probes < bucket_count() in find_position_using_hash()
1072 size_type num_probes = 0; // how many times we've probed in find_if_present_using_hash() local
1081 ++num_probes; // we're doing another probe in find_if_present_using_hash()
[all …]
/dports/graphics/py-s2/s2geometry-0.9.0/src/s2/util/gtl/
H A Ddensehashtable.h136 #define JUMP_(key, num_probes) (num_probes) argument
697 size_type num_probes = 0; // how many times we've probed in copy_elements() local
703 JUMP_(key, num_probes)) & bucket_count_minus_one) { in copy_elements()
704 ++num_probes; in copy_elements()
705 assert(num_probes < dest_bucket_count in copy_elements()
1033 size_type num_probes = 0; // how many times we've probed in find_position_using_hash() local
1052 ++num_probes; // we're doing another probe in find_position_using_hash()
1054 assert(num_probes < bucket_count() in find_position_using_hash()
1072 size_type num_probes = 0; // how many times we've probed in find_if_present_using_hash() local
1081 ++num_probes; // we're doing another probe in find_if_present_using_hash()
[all …]

12345678910>>...13