/dports/math/nanoflann/nanoflann-1.3.2/tests/ |
H A D | test_main.cpp | 80 std::vector<size_t> ret_index(num_results); in L2_vs_L2_simple_test() 81 std::vector<num_t> out_dist_sqr(num_results); in L2_vs_L2_simple_test() 93 for (size_t i=0;i<num_results;i++) in L2_vs_L2_simple_test() 139 const size_t num_results = 1; in L2_vs_bruteforce_test() local 141 std::vector<NUM> out_dists_sqr(num_results); in L2_vs_bruteforce_test() 192 const size_t num_results = 1; in SO3_vs_bruteforce_test() local 245 const size_t num_results = 1; in SO2_vs_bruteforce_test() local 314 const size_t num_results = 1; in L2_dynamic_vs_bruteforce_test() local 352 const size_t num_results = 1; in L2_dynamic_vs_bruteforce_test() local 414 const size_t num_results = 1; in TEST() local [all …]
|
/dports/audio/exaile/exaile-4.1.1/plugins/jamendo/ |
H A D | jamapi.py | 47 def __init__(self, search_term, order_by, num_results, callback): argument 51 self.num_results = num_results 57 % (self.search_term, self.order_by, self.num_results) 75 def __init__(self, search_term, order_by, num_results, callback): argument 79 self.num_results = num_results 85 % (self.search_term, self.order_by, self.num_results) 103 def __init__(self, search_term, order_by, num_results, callback): argument 107 self.num_results = num_results 113 % (self.search_term, self.order_by, self.num_results) 134 self.num_results = num_results [all …]
|
/dports/math/libmesh/libmesh-1.6.2/contrib/nanoflann/examples/ |
H A D | pointcloud_kdd_radius.cpp | 68 size_t num_results = 5; in kdtree_demo() local 69 std::vector<size_t> ret_index(num_results); in kdtree_demo() 70 std::vector<num_t> out_dist_sqr(num_results); in kdtree_demo() 72 num_results = index.knnSearch(&query_pt[0], num_results, &ret_index[0], &out_dist_sqr[0]); in kdtree_demo() 75 ret_index.resize(num_results); in kdtree_demo() 76 out_dist_sqr.resize(num_results); in kdtree_demo() 78 cout << "knnSearch(): num_results=" << num_results << "\n"; in kdtree_demo() 79 for (size_t i = 0; i < num_results; i++) in kdtree_demo()
|
H A D | vector_of_vectors_example.cpp | 79 const size_t num_results = 3; in kdtree_demo() local 80 std::vector<size_t> ret_indexes(num_results); in kdtree_demo() 81 std::vector<double> out_dists_sqr(num_results); in kdtree_demo() 83 nanoflann::KNNResultSet<double> resultSet(num_results); in kdtree_demo() 88 std::cout << "knnSearch(nn="<<num_results<<"): \n"; in kdtree_demo() 89 for (size_t i = 0; i < num_results; i++) in kdtree_demo()
|
H A D | matrix_example.cpp | 95 const size_t num_results = 3; in kdtree_demo() local 96 vector<size_t> ret_indexes(num_results); in kdtree_demo() 97 vector<num_t> out_dists_sqr(num_results); in kdtree_demo() 99 nanoflann::KNNResultSet<num_t> resultSet(num_results); in kdtree_demo() 104 std::cout << "knnSearch(nn="<<num_results<<"): \n"; in kdtree_demo() 105 for (size_t i=0; i<num_results; i++) in kdtree_demo()
|
/dports/math/nanoflann/nanoflann-1.3.2/examples/ |
H A D | pointcloud_kdd_radius.cpp | 68 size_t num_results = 5; in kdtree_demo() local 69 std::vector<size_t> ret_index(num_results); in kdtree_demo() 70 std::vector<num_t> out_dist_sqr(num_results); in kdtree_demo() 72 num_results = index.knnSearch(&query_pt[0], num_results, &ret_index[0], &out_dist_sqr[0]); in kdtree_demo() 75 ret_index.resize(num_results); in kdtree_demo() 76 out_dist_sqr.resize(num_results); in kdtree_demo() 78 cout << "knnSearch(): num_results=" << num_results << "\n"; in kdtree_demo() 79 for (size_t i = 0; i < num_results; i++) in kdtree_demo()
|
H A D | dynamic_pointcloud_example.cpp | 76 const size_t num_results = 1; in kdtree_demo() local 79 nanoflann::KNNResultSet<num_t> resultSet(num_results); in kdtree_demo() 83 cout << "knnSearch(nn="<<num_results<<"): \n"; in kdtree_demo() 92 const size_t num_results = 5; in kdtree_demo() local 93 cout << "Searching for " << num_results << " elements" << endl; in kdtree_demo() 94 size_t ret_index[num_results]; in kdtree_demo() 95 num_t out_dist_sqr[num_results]; in kdtree_demo() 96 nanoflann::KNNResultSet<num_t> resultSet(num_results); in kdtree_demo() 100 cout << "knnSearch(nn="<<num_results<<"): \n"; in kdtree_demo()
|
H A D | vector_of_vectors_example.cpp | 79 const size_t num_results = 3; in kdtree_demo() local 80 std::vector<size_t> ret_indexes(num_results); in kdtree_demo() 81 std::vector<double> out_dists_sqr(num_results); in kdtree_demo() 83 nanoflann::KNNResultSet<double> resultSet(num_results); in kdtree_demo() 88 std::cout << "knnSearch(nn="<<num_results<<"): \n"; in kdtree_demo() 89 for (size_t i = 0; i < num_results; i++) in kdtree_demo()
|
H A D | matrix_example.cpp | 111 const size_t num_results = 3; in kdtree_demo() local 112 vector<size_t> ret_indexes(num_results); in kdtree_demo() 113 vector<num_t> out_dists_sqr(num_results); in kdtree_demo() 115 nanoflann::KNNResultSet<num_t> resultSet(num_results); in kdtree_demo() 121 std::cout << "knnSearch(nn=" << num_results << "): \n"; in kdtree_demo() 122 for (size_t i = 0; i < num_results; i++) in kdtree_demo()
|
/dports/net/google-cloud-sdk/google-cloud-sdk/platform/gsutil/gslib/vendored/boto/boto/sdb/ |
H A D | queryresultset.py | 25 num_results = 0 32 if num_results == max_items: 35 num_results += 1 52 num_results = 0 58 if num_results == max_items: 61 num_results += 1 77 num_results = 0 83 if self.max_items and num_results >= self.max_items: 86 num_results += 1 88 if self.max_items and num_results >= self.max_items:
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/depot_tools/external_bin/gsutil/gsutil_4.28/gsutil/third_party/boto/boto/sdb/ |
H A D | queryresultset.py | 25 num_results = 0 32 if num_results == max_items: 35 num_results += 1 52 num_results = 0 58 if num_results == max_items: 61 num_results += 1 77 num_results = 0 83 if self.max_items and num_results >= self.max_items: 86 num_results += 1 88 if self.max_items and num_results >= self.max_items:
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/catapult/third_party/gsutil/gslib/vendored/boto/boto/sdb/ |
H A D | queryresultset.py | 25 num_results = 0 32 if num_results == max_items: 35 num_results += 1 52 num_results = 0 58 if num_results == max_items: 61 num_results += 1 77 num_results = 0 83 if self.max_items and num_results >= self.max_items: 86 num_results += 1 88 if self.max_items and num_results >= self.max_items:
|
/dports/devel/py-boto/boto-2.49.0/boto/sdb/ |
H A D | queryresultset.py | 25 num_results = 0 32 if num_results == max_items: 35 num_results += 1 52 num_results = 0 58 if num_results == max_items: 61 num_results += 1 77 num_results = 0 83 if self.max_items and num_results >= self.max_items: 86 num_results += 1 88 if self.max_items and num_results >= self.max_items:
|
/dports/www/py-google-api-core/google-api-core-2.2.2/tests/asyncio/ |
H A D | test_page_iterator_async.py | 46 assert iterator.num_results == 0 103 assert iterator.num_results == 0 108 assert iterator.num_results == 1 114 assert iterator.num_results == 0 120 assert iterator.num_results == 0 146 assert iterator.num_results == 0 148 assert iterator.num_results == 1 151 assert iterator.num_results == 2 154 assert iterator.num_results == 3 218 assert iterator.num_results == 0 [all …]
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/gpu/command_buffer/common/ |
H A D | common_cmd_format.h | 37 static base::CheckedNumeric<uint32_t> ComputeSize(uint32_t num_results) { in ComputeSize() 38 base::CheckedNumeric<uint32_t> size = num_results; in ComputeSize() 56 void SetNumResults(base::CheckedNumeric<uint32_t> num_results) { in SetNumResults() 57 base::CheckedNumeric<uint32_t> bytes = num_results; in SetNumResults() 66 base::CheckedNumeric<uint32_t> num_results = size; in GetNumResults() local 67 num_results /= sizeof(T); in GetNumResults() 68 return num_results.ValueOrDie<int32_t>(); in GetNumResults()
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/gpu/command_buffer/common/ |
H A D | common_cmd_format.h | 37 static base::CheckedNumeric<uint32_t> ComputeSize(uint32_t num_results) { in ComputeSize() 38 base::CheckedNumeric<uint32_t> size = num_results; in ComputeSize() 56 void SetNumResults(base::CheckedNumeric<uint32_t> num_results) { in SetNumResults() 57 base::CheckedNumeric<uint32_t> bytes = num_results; in SetNumResults() 66 base::CheckedNumeric<uint32_t> num_results = size; in GetNumResults() local 67 num_results /= sizeof(T); in GetNumResults() 68 return num_results.ValueOrDie<int32_t>(); in GetNumResults()
|
/dports/www/py-google-api-core/google-api-core-2.2.2/tests/unit/ |
H A D | test_page_iterator.py | 109 assert iterator.num_results == 0 156 assert iterator.num_results == 0 161 assert iterator.num_results == 1 166 assert iterator.num_results == 0 172 assert iterator.num_results == 0 197 assert iterator.num_results == 0 200 assert iterator.num_results == 1 203 assert iterator.num_results == 2 206 assert iterator.num_results == 3 374 iterator.num_results = 3 [all …]
|
/dports/databases/opentsdb/opentsdb-2.3.0/src/query/expression/ |
H A D | HighestCurrent.java | 74 int num_results = 0; in evaluate() local 76 num_results += results.length; in evaluate() 80 new PostAggregatedDataPoints[num_results]; in evaluate() 100 final SeekableView[] views = new SeekableView[num_results]; in evaluate() 101 for (int i = 0; i < num_results; i++) { in evaluate() 107 "maxLatest", num_results, data_query.startTime(), data_query.endTime()); in evaluate() 123 new TopNSortingEntry[num_results]; in evaluate() 125 for (int i = 0; i < num_results; i++) { in evaluate() 130 for (int i = 0; i < num_results; i++) { in evaluate() 134 for (int i = 0; i < num_results; i++) { in evaluate() [all …]
|
H A D | HighestMax.java | 75 int num_results = 0; in evaluate() local 77 num_results += results.length; in evaluate() 81 new PostAggregatedDataPoints[num_results]; in evaluate() 101 final SeekableView[] views = new SeekableView[num_results]; in evaluate() 102 for (int i = 0; i < num_results; i++) { in evaluate() 107 Aggregators.Interpolation.LERP, "maxCache", num_results, in evaluate() 123 final TopNSortingEntry[] max_by_ts = new TopNSortingEntry[num_results]; in evaluate() 125 for (int i = 0; i < num_results; i++) { in evaluate() 130 for (int i = 0; i < num_results; i++) { in evaluate() 134 for (int i = 0; i < num_results; i++) { in evaluate() [all …]
|
/dports/sysutils/fsearch/fsearch-0.1beta4/src/ |
H A D | database_search.c | 60 uint32_t num_results; member 136 ctx->num_results = 0; in search_thread_context_new() 178 uint32_t num_results = 0; in search_thread() local 202 results[num_results] = node; in search_thread() 203 num_results++; in search_thread() 230 ctx->num_results = num_results; in search_thread() 285 uint32_t num_results = 0; in search_regex_thread() local 320 num_results++; in search_regex_thread() 323 ctx->num_results = num_results; in search_regex_thread() 573 uint32_t num_results = 0; in db_search() local [all …]
|
/dports/textproc/htdig/htdig-3.2.0b6/libhtdigphp/ |
H A D | htdig_search.php | 50 $num_results = htsearch_query($htsearch_query); variable 52 if ($num_results > 0) 54 for($i = 0; $i < $num_results; $i++) 67 echo "Num Results: ".$num_results."\n";
|
/dports/sysutils/py-azure-cli/azure-cli-2.29.2/azure/cli/command_modules/storage/operations/ |
H A D | queue.py | 11 def list_queues(client, include_metadata=False, marker=None, num_results=None, argument 15 results_per_page=num_results, **kwargs) 17 result = list_generator(pages=pages, num_results=num_results)
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/ |
H A D | ConcurrentMetaIterator.cpp | 441 size_t num_results = prpResults.size(); in print_results() local 442 for (i=0; i<num_results; ++i) { in print_results() 461 IntArray set_ids(num_results); in print_results() 477 for(int i = 0; i < num_results; ++i) in print_results() 486 num_results, num_cv, best_parameters_scales); in print_results() 487 for(int i = 0; i < num_results; ++i) in print_results() 499 for(int i = 0; i < num_results; ++i) in print_results() 511 for(int i = 0; i < num_results; ++i) in print_results() 523 for(int i = 0; i < num_results; ++i) in print_results() 534 num_results, num_fns, best_responses_scales); in print_results() [all …]
|
/dports/lang/spidermonkey60/firefox-60.9.0/gfx/harfbuzz/src/ |
H A D | hb-ot-color.cc | 165 unsigned int num_results = 0; 169 i < cpal.numPaletteEntries && num_results < *color_count; ++i) 171 hb_ot_color_t* result = &colors[num_results]; 176 ++num_results; 180 if (likely (color_count)) *color_count = num_results;
|
/dports/textproc/R-cran-xml2/xml2/src/ |
H A D | xml2_xpath.cpp | 38 SEXP search(const char* xpath, int num_results) { in search() argument 57 int n = std::min(result_->nodesetval->nodeNr, num_results); in search() 112 double num_results = REAL(num_results_sxp)[0]; in xpath_search() local 114 if (num_results == R_PosInf) { in xpath_search() 115 num_results = INT_MAX; in xpath_search() 119 return seeker.search(xpath, num_results); in xpath_search()
|