/dports/math/hmat-oss/hmat-oss-1.7.1/examples/ |
H A D | c-cholesky.c | 216 hmat_cluster_tree_t* cluster_tree; in main() local 298 cluster_tree, cluster_tree, 1, admissibilityCondition); in main() 329 hmat.vector_reorder(frhs, cluster_tree, 0, NULL, nrhs); in main() 331 hmat.vector_restore(frhs, cluster_tree, 0, NULL, nrhs); in main() 333 hmat.vector_reorder(drhs, cluster_tree, 0, NULL, nrhs); in main() 335 hmat.vector_restore(drhs, cluster_tree, 0, NULL, nrhs); in main() 359 hmat.vector_reorder(frhs, cluster_tree, 0, NULL, nrhs); in main() 361 hmat.vector_restore(frhs, cluster_tree, 0, NULL, nrhs); in main() 363 hmat.vector_reorder(drhs, cluster_tree, 0, NULL, nrhs); in main() 365 hmat.vector_restore(drhs, cluster_tree, 0, NULL, nrhs); in main() [all …]
|
H A D | c-simple-cylinder.c | 124 hmat_cluster_tree_t* cluster_tree; in main() local 182 cluster_tree = hmat_create_cluster_tree(points, 3, n, clustering); in main() 184 printf("ClusterTree node count = %d\n", hmat_tree_nodes_count(cluster_tree)); in main() 185 hmatrix = hmat.create_empty_hmatrix_admissibility(cluster_tree, cluster_tree, in main() 206 hmat_delete_cluster_tree(cluster_tree); in main()
|
H A D | c-simple-kriging.c | 301 hmat_cluster_tree_t* cluster_tree; in main() local 372 cluster_tree = hmat_create_cluster_tree(points, 3, n, clustering); in main() 374 printf("ClusterTree node count = %d\n", hmat_tree_nodes_count(cluster_tree)); in main() 377 cluster_tree, cluster_tree, 0, admissibilityCondition); in main() 411 hmat.vector_reorder(frhs, cluster_tree, 0, NULL, nrhs); in main() 413 hmat.vector_restore(frhs, cluster_tree, 0, NULL, nrhs); in main() 415 hmat.vector_reorder(drhs, cluster_tree, 0, NULL, nrhs); in main() 417 hmat.vector_restore(drhs, cluster_tree, 0, NULL, nrhs); in main() 435 hmat_delete_cluster_tree(cluster_tree); in main()
|
H A D | c-cylinder.c | 220 hmat_cluster_tree_t* cluster_tree; in main() local 279 cluster_tree = hmat_create_cluster_tree(points, 3, n, clustering); in main() 282 printf("ClusterTree node count = %d\n", hmat_tree_nodes_count(cluster_tree)); in main() 284 cluster_tree, cluster_tree, 0, admissibilityCondition); in main() 313 hmat_delete_cluster_tree(cluster_tree); in main()
|
/dports/math/py-hdbscan/hdbscan-0.8.27/hdbscan/ |
H A D | prediction.py | 84 self.cluster_tree['child'][np.in1d(self.cluster_tree['parent'], 91 children = self.cluster_tree[self.cluster_tree['parent'] == current_node]['child'] 293 tree_root = cluster_tree['parent'].min() 307 cluster_tree['lambda_val'][cluster_tree['child'] 309 potential_cluster = cluster_tree['parent'][cluster_tree['child'] 381 if clusterer.prediction_data_.cluster_tree.shape[0] == 0: 399 clusterer.prediction_data_.cluster_tree, 587 clusterer.prediction_data_.cluster_tree) 598 clusterer.prediction_data_.cluster_tree) 644 clusterer.prediction_data_.cluster_tree) [all …]
|
H A D | flat.py | 324 if prediction_data.cluster_tree.shape[0] == 0: 345 prediction_data.cluster_tree, 495 prediction_data.cluster_tree) 508 prediction_data.cluster_tree) 614 prediction_data.cluster_tree) 621 prediction_data.cluster_tree) 825 cluster_tree = tree[tree['child_size'] > 1] 886 eps = 1/cluster_tree['lambda_val'][cluster_tree['child'] == leaf][0] 909 root = cluster_tree['parent'].min() 910 parent = cluster_tree[cluster_tree['child'] == leaf]['parent'] [all …]
|
H A D | _prediction_utils.pyx | 122 np.ndarray cluster_tree): argument 140 parents = cluster_tree['parent'].astype(np.intp) 141 children = cluster_tree['child'].astype(np.intp) 190 np.ndarray cluster_tree): argument 207 # clusters, cluster_tree) 209 clusters, cluster_tree) 239 max_lambda_dict, cluster_tree): argument 264 np.ndarray cluster_tree): argument 303 np.ndarray cluster_tree, argument 312 cluster_tree) [all …]
|
H A D | _hdbscan_tree.pyx | 610 children = cluster_tree[cluster_tree['parent'] == current_node]['child'] 618 if cluster_tree.shape[0] == 0: 620 root = cluster_tree['parent'].min() 621 return recurse_leaf_dfs(cluster_tree, root) 625 root = cluster_tree['parent'].min() 626 parent = cluster_tree[cluster_tree['child'] == leaf]['parent'] 633 parent_eps = 1/cluster_tree[cluster_tree['child'] == parent]['lambda_val'] 645 eps = 1/cluster_tree['lambda_val'][cluster_tree['child'] == leaf][0] 704 cdef np.ndarray cluster_tree 725 cluster_tree = tree[tree['child_size'] > 1] [all …]
|
H A D | plots.py | 35 def _recurse_leaf_dfs(cluster_tree, current_node): argument 36 children = cluster_tree[cluster_tree['parent'] == current_node]['child'] 40 return sum([recurse_leaf_dfs(cluster_tree, child) for child in children], []) 43 cluster_tree = condensed_tree[condensed_tree['child_size'] > 1] 44 if cluster_tree.shape[0] == 0: 48 root = cluster_tree['parent'].min() 49 return _recurse_leaf_dfs(cluster_tree, root) 241 cluster_tree = self._raw_tree[self._raw_tree['child_size'] > 1] 245 child_selection = (cluster_tree['parent'] == node) 247 child in cluster_tree['child'][child_selection]]) [all …]
|
/dports/cad/xcircuit/xcircuit-3.10.30/asg/ |
H A D | netlist_structs.h | 268 typedef struct cluster_tree ctree; 367 struct cluster_tree struct
|
H A D | network.h | 287 typedef struct cluster_tree ctree; 366 struct cluster_tree struct
|
/dports/games/freecell-solver/freecell-solver-6.2.0/patsolve/patsolve/ |
H A D | tree.c | 18 static inline fcs_pats__treelist *cluster_tree( in cluster_tree() function 202 fcs_pats__treelist *const tl = cluster_tree(soft_thread, in fc_solve_pats__insert()
|
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/testsuite/gfortran.dg/ |
H A D | pr32738.f90 | 41 use cluster_tree
|
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/testsuite/gfortran.dg/ |
H A D | pr32738.f90 | 41 use cluster_tree
|
/dports/lang/gcc8/gcc-8.5.0/gcc/testsuite/gfortran.dg/ |
H A D | pr32738.f90 | 41 use cluster_tree
|
/dports/lang/gcc10/gcc-10.3.0/gcc/testsuite/gfortran.dg/ |
H A D | pr32738.f90 | 41 use cluster_tree
|
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/gfortran.dg/ |
H A D | pr32738.f90 | 41 use cluster_tree
|
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/testsuite/gfortran.dg/ |
H A D | pr32738.f90 | 41 use cluster_tree
|
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/testsuite/gfortran.dg/ |
H A D | pr32738.f90 | 41 use cluster_tree
|
/dports/devel/avr-gcc/gcc-10.2.0/gcc/testsuite/gfortran.dg/ |
H A D | pr32738.f90 | 41 use cluster_tree
|
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/testsuite/gfortran.dg/ |
H A D | pr32738.f90 | 41 use cluster_tree
|
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/testsuite/gfortran.dg/ |
H A D | pr32738.f90 | 41 use cluster_tree
|
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/gfortran.dg/ |
H A D | pr32738.f90 | 41 use cluster_tree
|
/dports/lang/gcc48/gcc-4.8.5/gcc/testsuite/gfortran.dg/ |
H A D | pr32738.f90 | 41 use cluster_tree
|
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/testsuite/gfortran.dg/ |
H A D | pr32738.f90 | 41 use cluster_tree
|