| /dports/math/py-hdbscan/hdbscan-0.8.27/hdbscan/ |
| H A D | _hdbscan_reachability.pyx | 26 min_points : int, optional (default=5)
43 min_points = min(size - 1, min_points)
46 min_points,
47 axis=0)[min_points]
50 axis=0)[min_points]
79 if min_points < len(sorted_row_data):
80 core_distance[i] = sorted_row_data[min_points]
105 min_points = min(dim - 1, min_points)
127 min_points = min(dim - 1, min_points)
171 min_points = min(dim - 1, min_points)
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/geometry/test/robustness/overlay/areal_areal/ |
| H A D | intersection_stars.cpp | 65 void test_star(int count, int min_points, int max_points, T rotation, p_q_settings const& settings) in test_star() argument
74 for (int i = min_points; i <= max_points; i++) in test_star()
104 void test_type(int count, int min_points, int max_points, T rotation, p_q_settings const& settings) in test_type() argument
106 test_star<T, CalculationType>(count, min_points, max_points, rotation, settings); in test_type()
110 void test_all(std::string const& type, int count, int min_points, int max_points, T rotation, p_q_s… in test_all() argument
115 test_type<float, float>(count, min_points, max_points, rotation, settings); in test_all()
119 test_type<double, double>(count, min_points, max_points, rotation, settings); in test_all()
124 test_type<ttmath_big, ttmath_big>(count, min_points, max_points, rotation, settings); in test_all()
139 int min_points = 9; in main() local
151 … ("min_points", po::value<int>(&min_points)->default_value(9), "Minimum number of points") in main()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/geometry/test/robustness/overlay/areal_areal/ |
| H A D | intersection_stars.cpp | 65 void test_star(int count, int min_points, int max_points, T rotation, p_q_settings const& settings) in test_star() argument
74 for (int i = min_points; i <= max_points; i++) in test_star()
104 void test_type(int count, int min_points, int max_points, T rotation, p_q_settings const& settings) in test_type() argument
106 test_star<T, CalculationType>(count, min_points, max_points, rotation, settings); in test_type()
110 void test_all(std::string const& type, int count, int min_points, int max_points, T rotation, p_q_s… in test_all() argument
115 test_type<float, float>(count, min_points, max_points, rotation, settings); in test_all()
119 test_type<double, double>(count, min_points, max_points, rotation, settings); in test_all()
124 test_type<ttmath_big, ttmath_big>(count, min_points, max_points, rotation, settings); in test_all()
139 int min_points = 9; in main() local
151 … ("min_points", po::value<int>(&min_points)->default_value(9), "Minimum number of points") in main()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/geometry/test/robustness/overlay/areal_areal/ |
| H A D | intersection_stars.cpp | 65 void test_star(int count, int min_points, int max_points, T rotation, p_q_settings const& settings) in test_star() argument
74 for (int i = min_points; i <= max_points; i++) in test_star()
104 void test_type(int count, int min_points, int max_points, T rotation, p_q_settings const& settings) in test_type() argument
106 test_star<T, CalculationType>(count, min_points, max_points, rotation, settings); in test_type()
110 void test_all(std::string const& type, int count, int min_points, int max_points, T rotation, p_q_s… in test_all() argument
115 test_type<float, float>(count, min_points, max_points, rotation, settings); in test_all()
119 test_type<double, double>(count, min_points, max_points, rotation, settings); in test_all()
124 test_type<ttmath_big, ttmath_big>(count, min_points, max_points, rotation, settings); in test_all()
139 int min_points = 9; in main() local
151 … ("min_points", po::value<int>(&min_points)->default_value(9), "Minimum number of points") in main()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/geometry/test/robustness/overlay/areal_areal/ |
| H A D | intersection_stars.cpp | 65 void test_star(int count, int min_points, int max_points, T rotation, p_q_settings const& settings) in test_star() argument
74 for (int i = min_points; i <= max_points; i++) in test_star()
104 void test_type(int count, int min_points, int max_points, T rotation, p_q_settings const& settings) in test_type() argument
106 test_star<T, CalculationType>(count, min_points, max_points, rotation, settings); in test_type()
110 void test_all(std::string const& type, int count, int min_points, int max_points, T rotation, p_q_s… in test_all() argument
115 test_type<float, float>(count, min_points, max_points, rotation, settings); in test_all()
119 test_type<double, double>(count, min_points, max_points, rotation, settings); in test_all()
124 test_type<ttmath_big, ttmath_big>(count, min_points, max_points, rotation, settings); in test_all()
139 int min_points = 9; in main() local
151 … ("min_points", po::value<int>(&min_points)->default_value(9), "Minimum number of points") in main()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/libs/geometry/test/robustness/overlay/areal_areal/ |
| H A D | intersection_stars.cpp | 65 void test_star(int count, int min_points, int max_points, T rotation, p_q_settings const& settings) in test_star() argument
74 for (int i = min_points; i <= max_points; i++) in test_star()
104 void test_type(int count, int min_points, int max_points, T rotation, p_q_settings const& settings) in test_type() argument
106 test_star<T, CalculationType>(count, min_points, max_points, rotation, settings); in test_type()
110 void test_all(std::string const& type, int count, int min_points, int max_points, T rotation, p_q_s… in test_all() argument
115 test_type<float, float>(count, min_points, max_points, rotation, settings); in test_all()
119 test_type<double, double>(count, min_points, max_points, rotation, settings); in test_all()
124 test_type<ttmath_big, ttmath_big>(count, min_points, max_points, rotation, settings); in test_all()
139 int min_points = 9; in main() local
151 … ("min_points", po::value<int>(&min_points)->default_value(9), "Minimum number of points") in main()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/geometry/test/robustness/overlay/areal_areal/ |
| H A D | intersection_stars.cpp | 65 void test_star(int count, int min_points, int max_points, T rotation, p_q_settings const& settings) in test_star() argument
74 for (int i = min_points; i <= max_points; i++) in test_star()
104 void test_type(int count, int min_points, int max_points, T rotation, p_q_settings const& settings) in test_type() argument
106 test_star<T, CalculationType>(count, min_points, max_points, rotation, settings); in test_type()
110 void test_all(std::string const& type, int count, int min_points, int max_points, T rotation, p_q_s… in test_all() argument
115 test_type<float, float>(count, min_points, max_points, rotation, settings); in test_all()
119 test_type<double, double>(count, min_points, max_points, rotation, settings); in test_all()
124 test_type<ttmath_big, ttmath_big>(count, min_points, max_points, rotation, settings); in test_all()
139 int min_points = 9; in main() local
151 … ("min_points", po::value<int>(&min_points)->default_value(9), "Minimum number of points") in main()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/libs/geometry/test/robustness/overlay/areal_areal/ |
| H A D | intersection_stars.cpp | 65 void test_star(int count, int min_points, int max_points, T rotation, p_q_settings const& settings) in test_star() argument
74 for (int i = min_points; i <= max_points; i++) in test_star()
104 void test_type(int count, int min_points, int max_points, T rotation, p_q_settings const& settings) in test_type() argument
106 test_star<T, CalculationType>(count, min_points, max_points, rotation, settings); in test_type()
110 void test_all(std::string const& type, int count, int min_points, int max_points, T rotation, p_q_s… in test_all() argument
115 test_type<float, float>(count, min_points, max_points, rotation, settings); in test_all()
119 test_type<double, double>(count, min_points, max_points, rotation, settings); in test_all()
124 test_type<ttmath_big, ttmath_big>(count, min_points, max_points, rotation, settings); in test_all()
139 int min_points = 9; in main() local
151 … ("min_points", po::value<int>(&min_points)->default_value(9), "Minimum number of points") in main()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/libs/geometry/test/robustness/overlay/areal_areal/ |
| H A D | intersection_stars.cpp | 65 void test_star(int count, int min_points, int max_points, T rotation, p_q_settings const& settings) in test_star() argument
74 for (int i = min_points; i <= max_points; i++) in test_star()
104 void test_type(int count, int min_points, int max_points, T rotation, p_q_settings const& settings) in test_type() argument
106 test_star<T, CalculationType>(count, min_points, max_points, rotation, settings); in test_type()
110 void test_all(std::string const& type, int count, int min_points, int max_points, T rotation, p_q_s… in test_all() argument
115 test_type<float, float>(count, min_points, max_points, rotation, settings); in test_all()
119 test_type<double, double>(count, min_points, max_points, rotation, settings); in test_all()
124 test_type<ttmath_big, ttmath_big>(count, min_points, max_points, rotation, settings); in test_all()
139 int min_points = 9; in main() local
151 … ("min_points", po::value<int>(&min_points)->default_value(9), "Minimum number of points") in main()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/libs/geometry/test/robustness/overlay/areal_areal/ |
| H A D | intersection_stars.cpp | 65 void test_star(int count, int min_points, int max_points, T rotation, p_q_settings const& settings) in test_star() argument
74 for (int i = min_points; i <= max_points; i++) in test_star()
104 void test_type(int count, int min_points, int max_points, T rotation, p_q_settings const& settings) in test_type() argument
106 test_star<T, CalculationType>(count, min_points, max_points, rotation, settings); in test_type()
110 void test_all(std::string const& type, int count, int min_points, int max_points, T rotation, p_q_s… in test_all() argument
115 test_type<float, float>(count, min_points, max_points, rotation, settings); in test_all()
119 test_type<double, double>(count, min_points, max_points, rotation, settings); in test_all()
134 int min_points = 9; in main() local
146 … ("min_points", po::value<int>(&min_points)->default_value(9), "Minimum number of points") in main()
166 test_all(type, count, min_points, max_points, rotation, settings); in main()
|
| /dports/games/freedoko/FreeDoko_0.7.19/src/ui/gtkmm/ |
| H A D | party_points.graph.cpp | 100 int min_points = 0; // minimal points made by the players in on_draw() local
113 min_points = -max_points; in on_draw()
117 min_points = -max_points; in on_draw()
125 if (points < min_points) in on_draw()
126 min_points = points; in on_draw()
131 if (max_points == min_points) in on_draw()
244 if (min_points * scale_points in on_draw()
261 / static_cast<double>(max_points - min_points)); in on_draw()
284 if (height_graph / ((max_points - min_points) / s) in on_draw()
296 for (auto p = -((-min_points / points_step) * points_step); in on_draw()
[all …]
|
| H A D | party_finished.cpp | 158 int min_points = INT_MAX; // minimal points made by the players in redraw_points_graph() local
165 if (points < min_points) in redraw_points_graph()
166 min_points = points; in redraw_points_graph()
170 if (max_points == min_points) in redraw_points_graph()
187 - min(min_points, 0)); in redraw_points_graph()
195 + ((min_points < 0) in redraw_points_graph()
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Shape_detection/Efficient_RANSAC/ |
| H A D | Efficient_RANSAC.h | 183 std::size_t min_points; member
511 m_options.min_points =
514 m_options.min_points;
515 m_options.min_points = (m_options.min_points < 10) ? 10 : m_options.min_points;
520 if (m_options.min_points > m_num_available_points)
690 m_options.min_points) {
841 || best_expected >= m_options.min_points);
941 m_options.min_points); in get_best_candidate()
954 <= m_options.min_points) in get_best_candidate()
980 std::size_t min_points) { in improve_bound() argument
[all …]
|
| /dports/math/pdal/PDAL-2.3.0/doc/stages/ |
| H A D | filters.dbscan.rst | 25 "min_points":10,
39 min_points
40 The minimum cluster size ``min_points`` should be greater than or equal to
46 ``min_points`` minus one). ``eps`` defines the Euclidean distance that will
|
| /dports/science/scidavis/scidavis-2.4.0/libscidavis/src/ |
| H A D | Interpolation.cpp | 89 unsigned min_points = m + 3; in setMethod() local
90 if (d_n < min_points) { in setMethod()
93 .arg(min_points)); in setMethod()
98 d_min_points = min_points; in setMethod()
|
| /dports/databases/postgis31/postgis-3.1.4/liblwgeom/ |
| H A D | lwgeom_geos_cluster.c | 382 …WGEOM** geoms, uint32_t num_geoms, UNIONFIND* uf, double eps, uint32_t min_points, char** in_a_clu… in union_dbscan_general() argument
404 if (num_geoms < min_points) in union_dbscan_general()
420 neighbors = lwalloc(min_points * sizeof(uint32_t)); in union_dbscan_general()
432 if (cxt.num_items_found < min_points) in union_dbscan_general()
439 if (num_neighbors >= min_points) in union_dbscan_general()
467 if (num_neighbors < min_points) in union_dbscan_general()
474 if (num_neighbors == min_points) in union_dbscan_general()
514 int union_dbscan(LWGEOM** geoms, uint32_t num_geoms, UNIONFIND* uf, double eps, uint32_t min_points… in union_dbscan() argument
516 if (min_points <= 1) in union_dbscan()
519 return union_dbscan_general(geoms, num_geoms, uf, eps, min_points, in_a_cluster_ret); in union_dbscan()
|
| /dports/databases/postgis32/postgis-3.2.0/liblwgeom/ |
| H A D | lwgeom_geos_cluster.c | 382 …WGEOM** geoms, uint32_t num_geoms, UNIONFIND* uf, double eps, uint32_t min_points, char** in_a_clu… in union_dbscan_general() argument
404 if (num_geoms < min_points) in union_dbscan_general()
420 neighbors = lwalloc(min_points * sizeof(uint32_t)); in union_dbscan_general()
432 if (cxt.num_items_found < min_points) in union_dbscan_general()
439 if (num_neighbors >= min_points) in union_dbscan_general()
467 if (num_neighbors < min_points) in union_dbscan_general()
474 if (num_neighbors == min_points) in union_dbscan_general()
514 int union_dbscan(LWGEOM** geoms, uint32_t num_geoms, UNIONFIND* uf, double eps, uint32_t min_points… in union_dbscan() argument
516 if (min_points <= 1) in union_dbscan()
519 return union_dbscan_general(geoms, num_geoms, uf, eps, min_points, in_a_cluster_ret); in union_dbscan()
|
| /dports/databases/postgis30/postgis-3.0.4/liblwgeom/ |
| H A D | lwgeom_geos_cluster.c | 382 …WGEOM** geoms, uint32_t num_geoms, UNIONFIND* uf, double eps, uint32_t min_points, char** in_a_clu… in union_dbscan_general() argument
404 if (num_geoms < min_points) in union_dbscan_general()
420 neighbors = lwalloc(min_points * sizeof(uint32_t)); in union_dbscan_general()
432 if (cxt.num_items_found < min_points) in union_dbscan_general()
439 if (num_neighbors >= min_points) in union_dbscan_general()
467 if (num_neighbors < min_points) in union_dbscan_general()
474 if (num_neighbors == min_points) in union_dbscan_general()
514 int union_dbscan(LWGEOM** geoms, uint32_t num_geoms, UNIONFIND* uf, double eps, uint32_t min_points… in union_dbscan() argument
516 if (min_points <= 1) in union_dbscan()
519 return union_dbscan_general(geoms, num_geoms, uf, eps, min_points, in_a_cluster_ret); in union_dbscan()
|
| /dports/databases/postgis25/postgis-2.5.5/liblwgeom/ |
| H A D | lwgeom_geos_cluster.c | 382 …WGEOM** geoms, uint32_t num_geoms, UNIONFIND* uf, double eps, uint32_t min_points, char** in_a_clu… in union_dbscan_general() argument
404 if (num_geoms <= min_points) in union_dbscan_general()
420 neighbors = lwalloc(min_points * sizeof(uint32_t)); in union_dbscan_general()
432 if (cxt.num_items_found < min_points) in union_dbscan_general()
439 if (num_neighbors >= min_points) in union_dbscan_general()
467 if (num_neighbors < min_points) in union_dbscan_general()
474 if (num_neighbors == min_points) in union_dbscan_general()
514 int union_dbscan(LWGEOM** geoms, uint32_t num_geoms, UNIONFIND* uf, double eps, uint32_t min_points… in union_dbscan() argument
516 if (min_points <= 1) in union_dbscan()
519 return union_dbscan_general(geoms, num_geoms, uf, eps, min_points, in_a_cluster_ret); in union_dbscan()
|
| /dports/math/qtiplot-doc/qtiplot-0.9.8.9/qtiplot/src/analysis/ |
| H A D | Interpolation.cpp | 122 int min_points = m + 3;
135 gsl_interp *interp = gsl_interp_alloc(method, min_points);
136 min_points = gsl_interp_min_size(interp);
139 if (d_n < min_points){
141 tr("You need at least %1 points in order to perform this operation!").arg(min_points));
147 d_min_points = min_points;
|
| /dports/databases/postgis31/postgis-3.1.4/liblwgeom/cunit/ |
| H A D | cu_geos_cluster.c | 262 uint32_t min_points; member
277 union_dbscan(geoms, test.num_geoms, uf, test.eps, test.min_points, &in_a_cluster); in do_dbscan_test()
308 test.min_points = 5; in dbscan_test()
325 test.min_points = 5; in dbscan_test_3612a()
342 test.min_points = 1; in dbscan_test_3612b()
359 test.min_points = 5; in dbscan_test_3612c()
|
| /dports/databases/postgis30/postgis-3.0.4/liblwgeom/cunit/ |
| H A D | cu_geos_cluster.c | 262 uint32_t min_points; member
277 union_dbscan(geoms, test.num_geoms, uf, test.eps, test.min_points, &in_a_cluster); in do_dbscan_test()
308 test.min_points = 5; in dbscan_test()
325 test.min_points = 5; in dbscan_test_3612a()
342 test.min_points = 1; in dbscan_test_3612b()
359 test.min_points = 5; in dbscan_test_3612c()
|
| /dports/databases/postgis25/postgis-2.5.5/liblwgeom/cunit/ |
| H A D | cu_geos_cluster.c | 260 uint32_t min_points; member
275 union_dbscan(geoms, test.num_geoms, uf, test.eps, test.min_points, &in_a_cluster); in do_dbscan_test()
306 test.min_points = 5; in dbscan_test()
323 test.min_points = 5; in dbscan_test_3612a()
340 test.min_points = 1; in dbscan_test_3612b()
357 test.min_points = 5; in dbscan_test_3612c()
|
| /dports/databases/postgis32/postgis-3.2.0/liblwgeom/cunit/ |
| H A D | cu_geos_cluster.c | 262 uint32_t min_points; member
277 union_dbscan(geoms, test.num_geoms, uf, test.eps, test.min_points, &in_a_cluster); in do_dbscan_test()
308 test.min_points = 5; in dbscan_test()
325 test.min_points = 5; in dbscan_test_3612a()
342 test.min_points = 1; in dbscan_test_3612b()
359 test.min_points = 5; in dbscan_test_3612c()
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Shape_detection/deprecated/ |
| H A D | Region_growing.h | 181 : min_points((std::numeric_limits<std::size_t>::max)()) in Parameters()
187 …std::size_t min_points; ///< Minimum number of points of a shape. %Default value: 1% of total numb… member
534 m_options.min_points =
535 (m_options.min_points >= m_num_available_points) ?
537 m_options.min_points;
538 m_options.min_points = (m_options.min_points < 10) ? 10 : m_options.min_points;
570 std::size_t num_to_test = 1 + m_num_total_points - m_options.min_points;
679 if (index_container.size() >= m_options.min_points)
|