Home
last modified time | relevance | path

Searched refs:uf (Results 1 – 25 of 4274) sorted by relevance

12345678910>>...171

/dports/math/libsemigroups/libsemigroups-1.3.7/tests/
H A Dtest-uf.cpp66 REQUIRE(std::vector<size_t>(uf.cbegin(), uf.cend())
166 uf.cbegin(), uf.cend(), [&uf](size_t i) { return uf.find(i) == i; })); in __anon3f0defea0502()
176 uf.cbegin(), uf.cend(), [&uf](size_t i) { return uf.find(i) == i; })); in __anon3f0defea0602()
186 uf.cbegin(), uf.cend(), [&uf](size_t i) { return uf.find(i) == i; })); in __anon3f0defea0702()
196 uf.cbegin(), uf.cend(), [&uf](size_t i) { return uf.find(i) == i; })); in __anon3f0defea0802()
206 uf.cbegin(), uf.cend(), [&uf](size_t i) { return uf.find(i) == i; })); in __anon3f0defea0902()
223 uf.cbegin(), uf.cend(), [&uf](size_t i) { return uf.find(i) == i; })); in __anon3f0defea0a02()
233 uf.cbegin(), uf.cend(), [&uf](size_t i) { return uf.find(i) == i; })); in __anon3f0defea0b02()
243 uf.cbegin(), uf.cend(), [&uf](size_t i) { return uf.find(i) == i; })); in __anon3f0defea0c02()
253 uf.cbegin(), uf.cend(), [&uf](size_t i) { return uf.find(i) == i; })); in __anon3f0defea0d02()
[all …]
/dports/lang/racket/racket-8.3/share/pkgs/data-lib/data/
H A Dunion-find.rkt3 (provide uf-set? uf-new)
6 [uf-union! (-> uf-set? uf-set? void?)]
7 [uf-find (-> uf-set? any/c)]
9 [uf-same-set? (-> uf-set? uf-set? boolean?)]))
21 (recur (uf-find uf) port)
48 (define (uf-get-box a) (uf-set-x (uf-get-root a)))
94 (check-equal? (uf-same-set? (uf-new 1) (uf-new 2)) #f)
95 (check-equal? (uf-same-set? (uf-new 1) (uf-new 1)) #f)
190 (uf-union! (list-ref uf-sets 5) (list-ref uf-sets 7))
191 (uf-union! (list-ref uf-sets 1) (list-ref uf-sets 6))
[all …]
/dports/net-im/tg_owt/tg_owt-d578c76/src/rtc_base/
H A Duntyped_function_unittest.cc25 UntypedFunction uf; in TEST() local
26 EXPECT_FALSE(uf); in TEST()
32 EXPECT_FALSE(uf); in TEST()
38 EXPECT_FALSE(uf); in TEST()
44 EXPECT_TRUE(uf); in TEST()
51 EXPECT_TRUE(uf); in TEST()
59 EXPECT_TRUE(uf); in TEST()
68 EXPECT_TRUE(uf); in TEST()
79 EXPECT_TRUE(uf); in TEST()
99 auto uf = in TEST() local
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/webrtc/rtc_base/
H A Duntyped_function_unittest.cc25 UntypedFunction uf; in TEST() local
26 EXPECT_FALSE(uf); in TEST()
32 EXPECT_FALSE(uf); in TEST()
38 EXPECT_FALSE(uf); in TEST()
44 EXPECT_TRUE(uf); in TEST()
51 EXPECT_TRUE(uf); in TEST()
59 EXPECT_TRUE(uf); in TEST()
68 EXPECT_TRUE(uf); in TEST()
79 EXPECT_TRUE(uf); in TEST()
99 auto uf = in TEST() local
[all …]
/dports/www/firefox/firefox-99.0/third_party/libwebrtc/rtc_base/
H A Duntyped_function_unittest.cc25 UntypedFunction uf; in TEST() local
26 EXPECT_FALSE(uf); in TEST()
32 EXPECT_FALSE(uf); in TEST()
38 EXPECT_FALSE(uf); in TEST()
44 EXPECT_TRUE(uf); in TEST()
51 EXPECT_TRUE(uf); in TEST()
59 EXPECT_TRUE(uf); in TEST()
68 EXPECT_TRUE(uf); in TEST()
79 EXPECT_TRUE(uf); in TEST()
99 auto uf = in TEST() local
[all …]
/dports/graphics/ufraw/ufraw-f34669b/
H A Dufraw_ufraw.c363 if (uf->conf->fullCrop || uf->conf->CropX1 < 0) uf->conf->CropX1 = 0; in ufraw_get_image_dimensions()
364 if (uf->conf->fullCrop || uf->conf->CropY1 < 0) uf->conf->CropY1 = 0; in ufraw_get_image_dimensions()
365 if (uf->conf->fullCrop || uf->conf->CropX2 < 0) uf->conf->CropX2 = uf->rotatedWidth; in ufraw_get_image_dimensions()
366 if (uf->conf->fullCrop || uf->conf->CropY2 < 0) uf->conf->CropY2 = uf->rotatedHeight; in ufraw_get_image_dimensions()
369 uf->conf->aspectRatio = (double)uf->rotatedWidth / uf->rotatedHeight; in ufraw_get_image_dimensions()
866 uf->conf->CropX1 = (uf->rotatedWidth - uf->autoCropWidth) / 2; in ufraw_convert_image()
867 uf->conf->CropX2 = uf->conf->CropX1 + uf->autoCropWidth; in ufraw_convert_image()
868 uf->conf->CropY1 = (uf->rotatedHeight - uf->autoCropHeight) / 2; in ufraw_convert_image()
869 uf->conf->CropY2 = uf->conf->CropY1 + uf->autoCropHeight; in ufraw_convert_image()
1227 } else if (uf->conf->size > 0 && uf->HaveFilters && !uf->IsXTrans) { in ufraw_calculate_scale()
[all …]
H A Dufraw_writer.c122 ufraw_set_warning(uf, in jpeg_warning_handler()
137 ufraw_set_info(uf, in jpeg_error_handler()
145 ufraw_set_error(uf, in jpeg_error_handler()
193 (void)uf; in png_row_writer()
279 if (uf->conf->autoCrop && !uf->LoadingID) { in ufraw_write_image()
281 uf->conf->CropX1 = (uf->rotatedWidth - uf->autoCropWidth) / 2; in ufraw_write_image()
282 uf->conf->CropX2 = uf->conf->CropX1 + uf->autoCropWidth; in ufraw_write_image()
283 uf->conf->CropY1 = (uf->rotatedHeight - uf->autoCropHeight) / 2; in ufraw_write_image()
284 uf->conf->CropY2 = uf->conf->CropY1 + uf->autoCropHeight; in ufraw_write_image()
554 uf->conf->make, uf->conf->model); in ufraw_write_image()
[all …]
H A Dufraw_embedded.c63 dcraw_data *raw = uf->raw; in ufraw_read_embedded()
76 if (uf->conf->shrink < 2 && uf->conf->size == 0 && uf->conf->orientation == 0 && in ufraw_read_embedded()
87 unsigned srcHeight = uf->thumb.height, srcWidth = uf->thumb.width; in ufraw_read_embedded()
90 if (uf->conf->size > 0) { in ufraw_read_embedded()
179 unsigned srcHeight = uf->thumb.height, srcWidth = uf->thumb.width; in ufraw_convert_embedded()
182 if (uf->conf->size > 0) { in ufraw_convert_embedded()
248 dcraw_data *raw = uf->raw; in ufraw_write_embedded()
256 uf->conf->outputFilename, uf->conf->type); in ufraw_write_embedded()
272 if (uf->conf->shrink < 2 && uf->conf->size == 0 && uf->conf->orientation == 0 && in ufraw_write_embedded()
337 png_set_IHDR(png, info, uf->thumb.width, uf->thumb.height, in ufraw_write_embedded()
[all …]
H A Dufraw-batch.c26 ufraw_data *uf; in main() local
68 uf = ufraw_open(argFile); in main()
70 if (uf == NULL) { in main()
76 if (uf->conf && uf->conf->createID == only_id && cmd.createID == -1) in main()
81 ufraw_close(uf); in main()
82 g_free(uf); in main()
88 ufraw_close(uf); in main()
89 g_free(uf); in main()
107 ufraw_close(uf); in main()
108 g_free(uf); in main()
[all …]
H A Dufraw-gimp.c125 ufraw_data *uf; in run() local
168 uf = ufraw_open(filename); in run()
170 if (uf == NULL) { in run()
240 uf->conf->size = size; in run()
277 ufraw_close(uf); in run()
316 (void)uf; in gimp_row_writer()
345 uf->gimpImage = -1; in ufraw_save_gimp_image()
347 if (uf->conf->embeddedImage) { in ufraw_save_gimp_image()
370 uf->gimpImage = in ufraw_save_gimp_image()
377 if (uf->gimpImage == -1) { in ufraw_save_gimp_image()
[all …]
/dports/math/gap/gap-4.11.0/pkg/semigroups-3.2.3/libsemigroups/tests/
H A Dtest-uf.cpp33 UF uf(7); variable
52 UF uf2(uf);
112 uf.unite(8, 8);
147 uf.add_entry();
149 uf.add_entry();
153 uf.unite(1, 7);
161 uf.add_entry();
172 UF uf(tab);
177 uf.flatten();
189 uf.add_entry();
[all …]
/dports/databases/postgis25/postgis-2.5.5/liblwgeom/cunit/
H A Dcu_unionfind.c30 UF_destroy(uf); in test_unionfind_create()
50 UF_destroy(uf); in test_unionfind_union()
59 UNIONFIND uf = in test_unionfind_ordered_by_cluster() local
95 uf->clusters[1] = 0; in test_unionfind_path_compression()
96 uf->clusters[2] = 1; in test_unionfind_path_compression()
97 uf->clusters[3] = 2; in test_unionfind_path_compression()
98 uf->clusters[4] = 3; in test_unionfind_path_compression()
110 UF_destroy(uf); in test_unionfind_path_compression()
117 uf->clusters[0] = 8; in test_unionfind_collapse_cluster_ids()
118 uf->clusters[1] = 5; in test_unionfind_collapse_cluster_ids()
[all …]
/dports/databases/postgis32/postgis-3.2.0/liblwgeom/cunit/
H A Dcu_unionfind.c30 UF_destroy(uf); in test_unionfind_create()
50 UF_destroy(uf); in test_unionfind_union()
59 UNIONFIND uf = in test_unionfind_ordered_by_cluster() local
95 uf->clusters[1] = 0; in test_unionfind_path_compression()
96 uf->clusters[2] = 1; in test_unionfind_path_compression()
97 uf->clusters[3] = 2; in test_unionfind_path_compression()
98 uf->clusters[4] = 3; in test_unionfind_path_compression()
110 UF_destroy(uf); in test_unionfind_path_compression()
117 uf->clusters[0] = 8; in test_unionfind_collapse_cluster_ids()
118 uf->clusters[1] = 5; in test_unionfind_collapse_cluster_ids()
[all …]
/dports/databases/postgis30/postgis-3.0.4/liblwgeom/cunit/
H A Dcu_unionfind.c30 UF_destroy(uf); in test_unionfind_create()
50 UF_destroy(uf); in test_unionfind_union()
59 UNIONFIND uf = in test_unionfind_ordered_by_cluster() local
95 uf->clusters[1] = 0; in test_unionfind_path_compression()
96 uf->clusters[2] = 1; in test_unionfind_path_compression()
97 uf->clusters[3] = 2; in test_unionfind_path_compression()
98 uf->clusters[4] = 3; in test_unionfind_path_compression()
110 UF_destroy(uf); in test_unionfind_path_compression()
117 uf->clusters[0] = 8; in test_unionfind_collapse_cluster_ids()
118 uf->clusters[1] = 5; in test_unionfind_collapse_cluster_ids()
[all …]
/dports/databases/postgis31/postgis-3.1.4/liblwgeom/cunit/
H A Dcu_unionfind.c30 UF_destroy(uf); in test_unionfind_create()
50 UF_destroy(uf); in test_unionfind_union()
59 UNIONFIND uf = in test_unionfind_ordered_by_cluster() local
95 uf->clusters[1] = 0; in test_unionfind_path_compression()
96 uf->clusters[2] = 1; in test_unionfind_path_compression()
97 uf->clusters[3] = 2; in test_unionfind_path_compression()
98 uf->clusters[4] = 3; in test_unionfind_path_compression()
110 UF_destroy(uf); in test_unionfind_path_compression()
117 uf->clusters[0] = 8; in test_unionfind_collapse_cluster_ids()
118 uf->clusters[1] = 5; in test_unionfind_collapse_cluster_ids()
[all …]
/dports/databases/postgis32/postgis-3.2.0/liblwgeom/
H A Dlwunionfind.c39 uf->N = N; in UF_create()
50 return uf; in UF_create()
58 lwfree(uf); in UF_destroy()
81 return uf->cluster_sizes[UF_find(uf, i)]; in UF_size()
95 if (uf->cluster_sizes[a] < uf->cluster_sizes[b] || in UF_union()
96 (uf->cluster_sizes[a] == uf->cluster_sizes[b] && a > b)) in UF_union()
98 uf->clusters[a] = uf->clusters[b]; in UF_union()
99 uf->cluster_sizes[b] += uf->cluster_sizes[a]; in UF_union()
104 uf->clusters[b] = uf->clusters[a]; in UF_union()
105 uf->cluster_sizes[a] += uf->cluster_sizes[b]; in UF_union()
[all …]
/dports/databases/postgis30/postgis-3.0.4/liblwgeom/
H A Dlwunionfind.c39 uf->N = N; in UF_create()
50 return uf; in UF_create()
58 lwfree(uf); in UF_destroy()
81 return uf->cluster_sizes[UF_find(uf, i)]; in UF_size()
95 if (uf->cluster_sizes[a] < uf->cluster_sizes[b] || in UF_union()
96 (uf->cluster_sizes[a] == uf->cluster_sizes[b] && a > b)) in UF_union()
98 uf->clusters[a] = uf->clusters[b]; in UF_union()
99 uf->cluster_sizes[b] += uf->cluster_sizes[a]; in UF_union()
104 uf->clusters[b] = uf->clusters[a]; in UF_union()
105 uf->cluster_sizes[a] += uf->cluster_sizes[b]; in UF_union()
[all …]
/dports/databases/postgis31/postgis-3.1.4/liblwgeom/
H A Dlwunionfind.c39 uf->N = N; in UF_create()
50 return uf; in UF_create()
58 lwfree(uf); in UF_destroy()
81 return uf->cluster_sizes[UF_find(uf, i)]; in UF_size()
95 if (uf->cluster_sizes[a] < uf->cluster_sizes[b] || in UF_union()
96 (uf->cluster_sizes[a] == uf->cluster_sizes[b] && a > b)) in UF_union()
98 uf->clusters[a] = uf->clusters[b]; in UF_union()
99 uf->cluster_sizes[b] += uf->cluster_sizes[a]; in UF_union()
104 uf->clusters[b] = uf->clusters[a]; in UF_union()
105 uf->cluster_sizes[a] += uf->cluster_sizes[b]; in UF_union()
[all …]
/dports/databases/postgis25/postgis-2.5.5/liblwgeom/
H A Dlwunionfind.c38 uf->N = N; in UF_create()
49 return uf; in UF_create()
57 lwfree(uf); in UF_destroy()
80 return uf->cluster_sizes[UF_find(uf, i)]; in UF_size()
94 if (uf->cluster_sizes[a] < uf->cluster_sizes[b] || in UF_union()
95 (uf->cluster_sizes[a] == uf->cluster_sizes[b] && a > b)) in UF_union()
97 uf->clusters[a] = uf->clusters[b]; in UF_union()
98 uf->cluster_sizes[b] += uf->cluster_sizes[a]; in UF_union()
103 uf->clusters[b] = uf->clusters[a]; in UF_union()
104 uf->cluster_sizes[a] += uf->cluster_sizes[b]; in UF_union()
[all …]
/dports/math/yices/yices-2.6.2/src/mcsat/uf/
H A Duf_plugin.c78 uf->stats.propagations = statistics_new_int(uf->ctx->stats, "mcsat::uf::propagations"); in uf_plugin_stats_init()
79 uf->stats.conflicts = statistics_new_int(uf->ctx->stats, "mcsat::uf::conflicts"); in uf_plugin_stats_init()
80 uf->stats.egraph_terms = statistics_new_int(uf->ctx->stats, "mcsat::uf::egraph_terms"); in uf_plugin_stats_init()
93 uf->ctx->bump_variable_n(uf->ctx, t_var, find->val); in uf_plugin_bump_terms_and_reset()
103 uf->ctx = ctx; in uf_plugin_construct()
127 uf_plugin_stats_init(uf); in uf_plugin_construct()
287 eq_graph_get_conflict(&uf->eq_graph, &uf->conflict, NULL, &uf->tmp); in uf_plugin_propagate()
288 uf_plugin_bump_terms_and_reset(uf, &uf->tmp); in uf_plugin_propagate()
289 statistic_avg_add(uf->stats.avg_conflict_size, uf->conflict.size); in uf_plugin_propagate()
348 ctx_trace_term(uf->ctx, variable_db_get_term(uf->ctx->var_db, x)); in uf_plugin_decide()
[all …]
/dports/math/py-networkx/networkx-2.6.3/networkx/utils/tests/
H A Dtest_unionfind.py20 uf.union(1, 2)
21 uf.union(3, 4)
22 uf.union(4, 5)
23 uf.union(1, 5)
30 uf.union(1, 4, 7)
31 uf.union(2, 5, 8)
34 assert uf.weights[uf[1]] == 9
42 assert uf.weights[uf[1]] == 3
43 assert uf.weights[uf[4]] == 6
45 uf.union(1, 4)
[all …]
/dports/graphics/blender/blender-2.91.0/source/blender/editors/curve/
H A Deditfont_undo.c97 if ((uf)->id) { \ in uf_arraystore_compact_ex()
113 STATE_COMPACT(uf, textbuf, uf->len + 1); in uf_arraystore_compact_ex()
114 STATE_COMPACT(uf, textbufinfo, uf->len + 1); in uf_arraystore_compact_ex()
185 STATE_EXPAND(uf, textbuf, uf->len + 1); in uf_arraystore_expand()
186 STATE_EXPAND(uf, textbufinfo, uf->len + 1); in uf_arraystore_expand()
241 ef->pos = uf->pos; in undofont_to_editfont()
244 ef->len = uf->len; in undofont_to_editfont()
270 uf->pos = ef->pos; in undofont_from_editfont()
273 uf->len = ef->len; in undofont_from_editfont()
292 return uf; in undofont_from_editfont()
[all …]
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki/src/test/java/de/lmu/ifi/dbs/elki/utilities/datastructures/unionfind/
H A DWeightedQuickUnionStaticDBIDsTest.java49 uf.union(i1.seek(0), i2.seek(1)); in testTree()
51 uf.union(i1.seek(2), i2.seek(3)); in testTree()
53 uf.union(i1.seek(0), i2.seek(2)); in testTree()
55 uf.union(i1.seek(4), i2.seek(5)); in testTree()
56 uf.union(i1.seek(6), i2.seek(7)); in testTree()
57 uf.union(i1.seek(4), i2.seek(6)); in testTree()
59 uf.union(i1.seek(0), i2.seek(4)); in testTree()
87 uf.union(i1, i2); // always in testBruteForce()
111 uf.union(i1.seek(0), i2.seek(1)); in testWorstCase()
113 uf.union(i1.seek(2), i2.seek(3)); in testWorstCase()
[all …]
H A DWeightedQuickUnionRangeDBIDsTest.java49 uf.union(i1.seek(0), i2.seek(1)); in testTree()
51 uf.union(i1.seek(2), i2.seek(3)); in testTree()
53 uf.union(i1.seek(0), i2.seek(2)); in testTree()
55 uf.union(i1.seek(4), i2.seek(5)); in testTree()
56 uf.union(i1.seek(6), i2.seek(7)); in testTree()
57 uf.union(i1.seek(4), i2.seek(6)); in testTree()
59 uf.union(i1.seek(0), i2.seek(4)); in testTree()
87 uf.union(i1, i2); // always in testBruteForce()
111 uf.union(i1.seek(0), i2.seek(1)); in testWorstCase()
113 uf.union(i1.seek(2), i2.seek(3)); in testWorstCase()
[all …]
/dports/misc/visp/visp-3.4.0/3rdparty/apriltag/common/
H A Dunionfind.h55 uf->maxid = maxid; in unionfind_create()
58 uf->data[i].size = 1; in unionfind_create()
59 uf->data[i].parent = i; in unionfind_create()
61 return uf; in unionfind_create()
66 free(uf->data); in unionfind_destroy()
67 free(uf); in unionfind_destroy()
95 root = uf->data[root].parent; in unionfind_get_representative()
101 uf->data[id].parent = root; in unionfind_get_representative()
111 return uf->data[repid].size; in unionfind_get_set_size()
139 uf->data[aroot].size += bsize; in unionfind_connect()
[all …]

12345678910>>...171