| /dports/biology/infernal/infernal-1.1.3/hmmer/profmark/ |
| H A D | rocplot.pl | 3 $nsearches = 2809;
8 if ($opt_n) { $nsearches = $opt_n; }
12 if (/^\s*(\S+)/) { $nsearches--; $excluded{$1} = 1; }
16 if ($opt_x) { $nsearches--; $excluded{$opt_x} = 1; }
30 printf("%.4f %d\n", $fp / $nsearches, $tp);
38 if ($fp >= $nsearches * 10) { last; }
|
| /dports/biology/hmmer/hmmer-3.3/profmark/ |
| H A D | rocplot.pl | 3 $nsearches = 2809;
8 if ($opt_n) { $nsearches = $opt_n; }
12 if (/^\s*(\S+)/) { $nsearches--; $excluded{$1} = 1; }
16 if ($opt_x) { $nsearches--; $excluded{$opt_x} = 1; }
30 printf("%.4f %d\n", $fp / $nsearches, $tp);
38 if ($fp >= $nsearches * 10) { last; }
|
| /dports/devel/cmph/cmph-2.0/cxxmph/ |
| H A D | bm_common.h | 37 SearchUrlsBenchmark(const std::string& urls_file, uint32_t nsearches, float miss_ratio)
38 : UrlsBenchmark(urls_file), nsearches_(nsearches), miss_ratio_(miss_ratio) {}
61 SearchUint64Benchmark(uint32_t count, uint32_t nsearches)
62 : Uint64Benchmark(count), nsearches_(nsearches) { }
|
| H A D | bm_map.cc | 37 BM_SearchUrls(const std::string& urls_file, int nsearches, float miss_ratio) in BM_SearchUrls() argument
38 : SearchUrlsBenchmark(urls_file, nsearches, miss_ratio) { } in BM_SearchUrls()
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/lib/ |
| H A D | interval_tree_test.c | 17 __param(int, nsearches, 100, "Number of searches to the interval tree");
58 for (i = 0; i < nsearches; i++) in init()
73 queries = kmalloc_array(nsearches, sizeof(int), GFP_KERNEL); in interval_tree_test_init()
108 for (j = 0; j < nsearches; j++) { in interval_tree_test_init()
|
| /dports/multimedia/libv4l/linux-5.13-rc2/lib/ |
| H A D | interval_tree_test.c | 17 __param(int, nsearches, 100, "Number of searches to the interval tree");
58 for (i = 0; i < nsearches; i++) in init()
73 queries = kmalloc_array(nsearches, sizeof(int), GFP_KERNEL); in interval_tree_test_init()
108 for (j = 0; j < nsearches; j++) { in interval_tree_test_init()
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/lib/ |
| H A D | interval_tree_test.c | 17 __param(int, nsearches, 100, "Number of searches to the interval tree");
58 for (i = 0; i < nsearches; i++) in init()
73 queries = kmalloc_array(nsearches, sizeof(int), GFP_KERNEL); in interval_tree_test_init()
108 for (j = 0; j < nsearches; j++) { in interval_tree_test_init()
|
| /dports/net/samba412/samba-4.12.15/lib/ldb/tools/ |
| H A D | ldbtest.c | 227 unsigned int nrecords, unsigned int nsearches) in search_uid() argument
231 for (i=0;i<nsearches;i++) { in search_uid()
261 unsigned int nsearches) in start_test() argument
276 search_uid(ldb, basedn, nrecords, nsearches); in start_test()
|
| /dports/net-mgmt/wmi-client/wmi-1.3.16/Samba/source/lib/ldb/tools/ |
| H A D | ldbtest.c | 221 static void search_uid(struct ldb_context *ldb, struct ldb_dn *basedn, int nrecords, int nsearches) in search_uid() argument
225 for (i=0;i<nsearches;i++) { in search_uid()
254 static void start_test(struct ldb_context *ldb, int nrecords, int nsearches) in start_test() argument
269 search_uid(ldb, basedn, nrecords, nsearches); in start_test()
|
| /dports/databases/ldb15/ldb-1.5.6/tools/ |
| H A D | ldbtest.c | 227 unsigned int nrecords, unsigned int nsearches)
231 for (i=0;i<nsearches;i++) {
261 unsigned int nsearches)
276 search_uid(ldb, basedn, nrecords, nsearches);
|
| /dports/databases/ldb20/ldb-2.0.10/tools/ |
| H A D | ldbtest.c | 227 unsigned int nrecords, unsigned int nsearches) in search_uid() argument
231 for (i=0;i<nsearches;i++) { in search_uid()
261 unsigned int nsearches) in start_test() argument
276 search_uid(ldb, basedn, nrecords, nsearches); in start_test()
|
| /dports/databases/ldb22/ldb-2.2.1/tools/ |
| H A D | ldbtest.c | 227 unsigned int nrecords, unsigned int nsearches) in search_uid() argument
231 for (i=0;i<nsearches;i++) { in search_uid()
261 unsigned int nsearches) in start_test() argument
276 search_uid(ldb, basedn, nrecords, nsearches); in start_test()
|
| /dports/databases/ldb21/ldb-2.1.5/tools/ |
| H A D | ldbtest.c | 227 unsigned int nrecords, unsigned int nsearches) in search_uid() argument
231 for (i=0;i<nsearches;i++) { in search_uid()
261 unsigned int nsearches) in start_test() argument
276 search_uid(ldb, basedn, nrecords, nsearches); in start_test()
|
| /dports/science/ascent/ascent-0.7.1-66-gbcf2742a/src/examples/proxies/kripke/tools/ |
| H A D | kripke.cpp | 398 int nsearches = grp_list.size() * dir_list.size() * nest_list.size(); in main() local
462 printf("Search space size: %d points\n", nsearches); in main()
520 point+1, nsearches, in main()
|
| /dports/news/inn-current/inn-2.7-20211226/storage/ovdb/ |
| H A D | ovdb.c | 2212 static int nsearches = 0; variable
2275 nsearches = 0; in ovdb_opensearch()
2279 if (nsearches == maxsearches) { in ovdb_opensearch()
2284 searches[nsearches] = s; in ovdb_opensearch()
2285 nsearches++; in ovdb_opensearch()
2487 for (i = 0; i < nsearches; i++) { in ovdb_closesearch()
2492 nsearches--; in ovdb_closesearch()
2493 for (; i < nsearches; i++) { in ovdb_closesearch()
3092 while (searches != NULL && nsearches) { in ovdb_close()
|
| /dports/news/inn/inn-2.6.4/storage/ovdb/ |
| H A D | ovdb.c | 2149 static int nsearches = 0; variable
2213 nsearches = 0; in ovdb_opensearch()
2217 if(nsearches == maxsearches) { in ovdb_opensearch()
2221 searches[nsearches] = s; in ovdb_opensearch()
2222 nsearches++; in ovdb_opensearch()
2423 for(i = 0; i < nsearches; i++) { in ovdb_closesearch()
2428 nsearches--; in ovdb_closesearch()
2429 for( ; i < nsearches; i++) { in ovdb_closesearch()
3038 while(searches != NULL && nsearches) { in ovdb_close()
|
| /dports/sysutils/shlock/inn-2.6.4/storage/ovdb/ |
| H A D | ovdb.c | 2149 static int nsearches = 0; variable
2213 nsearches = 0; in ovdb_opensearch()
2217 if(nsearches == maxsearches) { in ovdb_opensearch()
2221 searches[nsearches] = s; in ovdb_opensearch()
2222 nsearches++; in ovdb_opensearch()
2423 for(i = 0; i < nsearches; i++) { in ovdb_closesearch()
2428 nsearches--; in ovdb_closesearch()
2429 for( ; i < nsearches; i++) { in ovdb_closesearch()
3038 while(searches != NULL && nsearches) { in ovdb_close()
|
| /dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | bitmap.h | 139 uint64_t nsearches, uint64_t search_iter) in bitmap_usage()
141 m_nsearches (nsearches), m_search_iter (search_iter) {} in bitmap_usage()
|
| /dports/devel/riscv64-gcc/gcc-8.3.0/gcc/ |
| H A D | bitmap.h | 139 uint64_t nsearches, uint64_t search_iter) in bitmap_usage()
141 m_nsearches (nsearches), m_search_iter (search_iter) {} in bitmap_usage()
|
| /dports/lang/gnat_util/gcc-6-20180516/gcc/ |
| H A D | bitmap.h | 139 uint64_t nsearches, uint64_t search_iter) in bitmap_usage()
141 m_nsearches (nsearches), m_search_iter (search_iter) {} in bitmap_usage()
|
| /dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | bitmap.h | 139 uint64_t nsearches, uint64_t search_iter) in bitmap_usage()
141 m_nsearches (nsearches), m_search_iter (search_iter) {} in bitmap_usage()
|
| /dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/ |
| H A D | bitmap.h | 139 uint64_t nsearches, uint64_t search_iter) in bitmap_usage()
141 m_nsearches (nsearches), m_search_iter (search_iter) {} in bitmap_usage()
|
| /dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | bitmap.h | 139 uint64_t nsearches, uint64_t search_iter) in bitmap_usage()
141 m_nsearches (nsearches), m_search_iter (search_iter) {} in bitmap_usage()
|
| /dports/lang/gcc8/gcc-8.5.0/gcc/ |
| H A D | bitmap.h | 139 uint64_t nsearches, uint64_t search_iter) in bitmap_usage()
141 m_nsearches (nsearches), m_search_iter (search_iter) {} in bitmap_usage()
|
| /dports/lang/gcc6-aux/gcc-6-20180516/gcc/ |
| H A D | bitmap.h | 139 uint64_t nsearches, uint64_t search_iter) in bitmap_usage()
141 m_nsearches (nsearches), m_search_iter (search_iter) {} in bitmap_usage()
|