Home
last modified time | relevance | path

Searched refs:UF_find (Results 1 – 25 of 28) sorted by relevance

12

/dports/databases/postgis32/postgis-3.2.0/liblwgeom/
H A Dlwunionfind.c62 UF_find (UNIONFIND* uf, uint32_t i) in UF_find() function
81 return uf->cluster_sizes[UF_find(uf, i)]; in UF_size()
87 uint32_t a = UF_find(uf, i); in UF_union()
88 uint32_t b = UF_find(uf, j); in UF_union()
124 UF_find(uf, i); in UF_ordered_by_cluster()
159 uint32_t current_old_id = UF_find(uf, j); in UF_get_collapsed_cluster_ids()
H A Dlwgeom_geos_cluster.c195 if (p != q && UF_find(uf, p) != UF_find(uf, q)) in union_intersecting_pairs()
358 if (UF_find(uf, p) != UF_find(uf, q)) in union_dbscan_minpoints_1()
445 if (UF_find(uf, p) == UF_find(uf, q)) in union_dbscan_general()
562 (UF_find(uf, ordered_components[i]) != UF_find(uf, ordered_components[i+1]))) in combine_geometries()
H A Dlwunionfind.h46 uint32_t UF_find(UNIONFIND* uf, uint32_t i);
/dports/databases/postgis30/postgis-3.0.4/liblwgeom/
H A Dlwunionfind.c62 UF_find (UNIONFIND* uf, uint32_t i) in UF_find() function
81 return uf->cluster_sizes[UF_find(uf, i)]; in UF_size()
87 uint32_t a = UF_find(uf, i); in UF_union()
88 uint32_t b = UF_find(uf, j); in UF_union()
124 UF_find(uf, i); in UF_ordered_by_cluster()
159 uint32_t current_old_id = UF_find(uf, j); in UF_get_collapsed_cluster_ids()
H A Dlwgeom_geos_cluster.c195 if (p != q && UF_find(uf, p) != UF_find(uf, q)) in union_intersecting_pairs()
358 if (UF_find(uf, p) != UF_find(uf, q)) in union_dbscan_minpoints_1()
445 if (UF_find(uf, p) == UF_find(uf, q)) in union_dbscan_general()
562 (UF_find(uf, ordered_components[i]) != UF_find(uf, ordered_components[i+1]))) in combine_geometries()
H A Dlwunionfind.h46 uint32_t UF_find(UNIONFIND* uf, uint32_t i);
/dports/databases/postgis31/postgis-3.1.4/liblwgeom/
H A Dlwunionfind.c62 UF_find (UNIONFIND* uf, uint32_t i) in UF_find() function
81 return uf->cluster_sizes[UF_find(uf, i)]; in UF_size()
87 uint32_t a = UF_find(uf, i); in UF_union()
88 uint32_t b = UF_find(uf, j); in UF_union()
124 UF_find(uf, i); in UF_ordered_by_cluster()
159 uint32_t current_old_id = UF_find(uf, j); in UF_get_collapsed_cluster_ids()
H A Dlwgeom_geos_cluster.c195 if (p != q && UF_find(uf, p) != UF_find(uf, q)) in union_intersecting_pairs()
358 if (UF_find(uf, p) != UF_find(uf, q)) in union_dbscan_minpoints_1()
445 if (UF_find(uf, p) == UF_find(uf, q)) in union_dbscan_general()
562 (UF_find(uf, ordered_components[i]) != UF_find(uf, ordered_components[i+1]))) in combine_geometries()
H A Dlwunionfind.h46 uint32_t UF_find(UNIONFIND* uf, uint32_t i);
/dports/databases/postgis25/postgis-2.5.5/liblwgeom/
H A Dlwunionfind.c61 UF_find (UNIONFIND* uf, uint32_t i) in UF_find() function
80 return uf->cluster_sizes[UF_find(uf, i)]; in UF_size()
86 uint32_t a = UF_find(uf, i); in UF_union()
87 uint32_t b = UF_find(uf, j); in UF_union()
123 UF_find(uf, i); in UF_ordered_by_cluster()
158 uint32_t current_old_id = UF_find(uf, j); in UF_get_collapsed_cluster_ids()
H A Dlwgeom_geos_cluster.c195 if (p != q && UF_find(uf, p) != UF_find(uf, q)) in union_intersecting_pairs()
358 if (UF_find(uf, p) != UF_find(uf, q)) in union_dbscan_minpoints_1()
445 if (UF_find(uf, p) == UF_find(uf, q)) in union_dbscan_general()
562 (UF_find(uf, ordered_components[i]) != UF_find(uf, ordered_components[i+1]))) in combine_geometries()
H A Dlwunionfind.h46 uint32_t UF_find(UNIONFIND* uf, uint32_t i);
/dports/graphics/graphviz/graphviz-2.44.1/lib/spine/
H A Dunion_find.c10 node_t *UF_find(node_t * n) in UF_find() function
28 u = UF_find(u); in UF_union()
33 v = UF_find(v); in UF_union()
62 assert(u == UF_find(u)); in UF_setname()
H A Dunion_find.h6 extern Agnode_t *UF_find(Agnode_t *);
H A Dspine.c339 if (UF_find(agtail(e)) != UF_find(aghead(e))) in doBucket()
/dports/graphics/graphviz/graphviz-2.44.1/lib/dotgen/
H A Dclass1.c60 t0 = UF_find(t); in interclust1()
61 h0 = UF_find(h); in interclust1()
83 t = UF_find(agtail(e)); in class1()
84 h = UF_find(aghead(e)); in class1()
H A Dclass2.c66 rv = UF_find(v); in leader_of()
194 if ((ND_clust(n) == NULL) && (n == UF_find(n))) { in class2()
252 t = UF_find(agtail(e)); in class2()
253 h = UF_find(aghead(e)); in class2()
H A Ddecomp.c159 if ((ND_mark(other) != Cmark) && (other == UF_find(other))) in search_component()
187 if ((ND_mark(other) != Cmark) && (other == UF_find(other)))
210 else if (v != UF_find(v)) in decompose()
H A Drank.c382 GD_minset(g) = UF_find(GD_minset(g)); in minmax_edges()
384 GD_maxset(g) = UF_find(GD_maxset(g)); in minmax_edges()
389 assert(aghead(e) == UF_find(aghead(e))); in minmax_edges()
396 assert(agtail(e) == UF_find(agtail(e))); in minmax_edges()
411 if (n != UF_find(n)) in minmax_edges2()
458 leader = UF_find(n); in expand_ranksets()
/dports/databases/postgis25/postgis-2.5.5/liblwgeom/cunit/
H A Dcu_unionfind.c102 uint32_t root = UF_find(uf, 4); in test_unionfind_path_compression()
/dports/databases/postgis32/postgis-3.2.0/liblwgeom/cunit/
H A Dcu_unionfind.c102 uint32_t root = UF_find(uf, 4); in test_unionfind_path_compression()
/dports/databases/postgis30/postgis-3.0.4/liblwgeom/cunit/
H A Dcu_unionfind.c102 uint32_t root = UF_find(uf, 4); in test_unionfind_path_compression()
/dports/databases/postgis31/postgis-3.1.4/liblwgeom/cunit/
H A Dcu_unionfind.c102 uint32_t root = UF_find(uf, 4); in test_unionfind_path_compression()
/dports/graphics/graphviz/graphviz-2.44.1/lib/common/
H A Dutils.h65 extern Agnode_t *UF_find(Agnode_t *);
/dports/graphics/graphviz/graphviz-2.44.1/lib/
H A Dgvc.def290 UF_find

12