Home
last modified time | relevance | path

Searched refs:union_find (Results 1 – 25 of 138) sorted by relevance

123456

/dports/cad/cura-engine/CuraEngine-fadb5d6b/tests/utils/
H A DUnionFindTest.cpp18 UnionFind<char> union_find; member in cura::UnionFindTest
53 union_find.unite(a, b); in TEST_F()
55 a = union_find.find('A'); in TEST_F()
56 b = union_find.find('B'); in TEST_F()
69 union_find.unite(a, b); in TEST_F()
70 union_find.unite(b, c); in TEST_F()
72 a = union_find.find('A'); in TEST_F()
73 b = union_find.find('B'); in TEST_F()
92 union_find.unite(a, b); in TEST_F()
93 union_find.unite(c, d); in TEST_F()
[all …]
/dports/biology/iqtree/IQ-TREE-2.0.6/terraphast/lib/
H A Dunion_find.cpp9 union_find::union_find(index n, utils::stack_allocator<index> a) : m_parent(n, n, a) { in union_find() function in terraces::union_find
15 index union_find::find(index x) { in find()
28 void union_find::compress() { in compress()
37 void union_find::merge(index x, index y) { in merge()
59 union_find union_find::make_bipartition(const std::vector<bool>& split, in make_bipartition()
61 union_find result(split.size(), alloc); in make_bipartition()
H A Dunion_find_debug.hpp11 const union_find& m_sets;
25 union_find_sets_iterator(const union_find& sets, index i = 0) in union_find_sets_iterator()
38 const union_find& sets;
45 const union_find& m_sets;
60 union_find_set_iterator(const union_find& sets, index rep, index i = 0) in union_find_set_iterator()
73 const union_find& sets;
H A Dunion_find.hpp12 class union_find { class
23 union_find(index, utils::stack_allocator<index> a);
34 static union_find make_bipartition(const std::vector<bool>& split,
H A Dbipartitions.hpp22 const union_find& m_sets;
33 bipartitions(const ranked_bitvector& leaves, const union_find& sets,
51 const union_find& sets() const { return m_sets; } in sets()
/dports/databases/grass7/grass-7.8.6/lib/vector/neta/
H A Dspanningtree.c23 struct union_find struct
28 static int uf_initialize(struct union_find *uf, int size) in uf_initialize() argument
39 static void uf_release(struct union_find *uf) in uf_release()
44 static int uf_find(struct union_find *uf, int v) in uf_find()
59 static void uf_union(struct union_find *uf, int u, int v) in uf_union()
95 struct union_find uf; in NetA_spanning_tree()
/dports/sysutils/vector/lucet-d4fc14a03bdb99ac83173d27fddf1aca48412a86/wasmtime/cranelift/codegen/src/regalloc/
H A Dvirtregs.rs52 union_find: SecondaryMap<Value, i32>, field
67 union_find: SecondaryMap::new(), in new()
78 self.union_find.clear(); in clear()
298 match UFEntry::decode(self.union_find[val]) { in find()
308 self.union_find[val] = UFEntry::encode_link(found.0); in find()
339 self.union_find[leader_a] = UFEntry::encode_link(leader_b); in union()
342 self.union_find[leader_b] = UFEntry::encode_link(leader_a); in union()
348 self.union_find[leader_a] += 1; in union()
349 self.union_find[leader_b] = UFEntry::encode_link(leader_a); in union()
392 self.union_find[val] = 0; in finish_union_find()
/dports/www/geckodriver/mozilla-central-e9783a644016aa9b317887076618425586730d73/testing/geckodriver/cargo-crates/cranelift-codegen-0.44.0/src/regalloc/
H A Dvirtregs.rs52 union_find: SecondaryMap<Value, i32>, field
67 union_find: SecondaryMap::new(), in new()
78 self.union_find.clear(); in clear()
298 match UFEntry::decode(self.union_find[val]) { in find()
308 self.union_find[val] = UFEntry::encode_link(found.0); in find()
339 self.union_find[leader_a] = UFEntry::encode_link(leader_b); in union()
342 self.union_find[leader_b] = UFEntry::encode_link(leader_a); in union()
348 self.union_find[leader_a] += 1; in union()
349 self.union_find[leader_b] = UFEntry::encode_link(leader_a); in union()
392 self.union_find[val] = 0; in finish_union_find()
/dports/www/firefox/firefox-99.0/third_party/rust/cranelift-codegen/src/regalloc/
H A Dvirtregs.rs52 union_find: SecondaryMap<Value, i32>, field
67 union_find: SecondaryMap::new(), in new()
78 self.union_find.clear(); in clear()
298 match UFEntry::decode(self.union_find[val]) { in find()
308 self.union_find[val] = UFEntry::encode_link(found.0); in find()
339 self.union_find[leader_a] = UFEntry::encode_link(leader_b); in union()
342 self.union_find[leader_b] = UFEntry::encode_link(leader_a); in union()
348 self.union_find[leader_a] += 1; in union()
349 self.union_find[leader_b] = UFEntry::encode_link(leader_a); in union()
392 self.union_find[val] = 0; in finish_union_find()
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/cranelift-codegen/src/regalloc/
H A Dvirtregs.rs52 union_find: SecondaryMap<Value, i32>, field
67 union_find: SecondaryMap::new(), in new()
78 self.union_find.clear(); in clear()
298 match UFEntry::decode(self.union_find[val]) { in find()
308 self.union_find[val] = UFEntry::encode_link(found.0); in find()
339 self.union_find[leader_a] = UFEntry::encode_link(leader_b); in union()
342 self.union_find[leader_b] = UFEntry::encode_link(leader_a); in union()
348 self.union_find[leader_a] += 1; in union()
349 self.union_find[leader_b] = UFEntry::encode_link(leader_a); in union()
392 self.union_find[val] = 0; in finish_union_find()
/dports/lang/rust/rustc-1.58.1-src/vendor/cranelift-codegen/src/regalloc/
H A Dvirtregs.rs52 union_find: SecondaryMap<Value, i32>, field
67 union_find: SecondaryMap::new(), in new()
78 self.union_find.clear(); in clear()
298 match UFEntry::decode(self.union_find[val]) { in find()
308 self.union_find[val] = UFEntry::encode_link(found.0); in find()
339 self.union_find[leader_a] = UFEntry::encode_link(leader_b); in union()
342 self.union_find[leader_b] = UFEntry::encode_link(leader_a); in union()
348 self.union_find[leader_a] += 1; in union()
349 self.union_find[leader_b] = UFEntry::encode_link(leader_a); in union()
392 self.union_find[val] = 0; in finish_union_find()
/dports/www/firefox-esr/firefox-91.8.0/third_party/rust/cranelift-codegen/src/regalloc/
H A Dvirtregs.rs52 union_find: SecondaryMap<Value, i32>, field
67 union_find: SecondaryMap::new(), in new()
78 self.union_find.clear(); in clear()
298 match UFEntry::decode(self.union_find[val]) { in find()
308 self.union_find[val] = UFEntry::encode_link(found.0); in find()
339 self.union_find[leader_a] = UFEntry::encode_link(leader_b); in union()
342 self.union_find[leader_b] = UFEntry::encode_link(leader_a); in union()
348 self.union_find[leader_a] += 1; in union()
349 self.union_find[leader_b] = UFEntry::encode_link(leader_a); in union()
392 self.union_find[val] = 0; in finish_union_find()
/dports/lang/spidermonkey78/firefox-78.9.0/third_party/rust/cranelift-codegen/src/regalloc/
H A Dvirtregs.rs52 union_find: SecondaryMap<Value, i32>, field
67 union_find: SecondaryMap::new(), in new()
78 self.union_find.clear(); in clear()
298 match UFEntry::decode(self.union_find[val]) { in find()
308 self.union_find[val] = UFEntry::encode_link(found.0); in find()
339 self.union_find[leader_a] = UFEntry::encode_link(leader_b); in union()
342 self.union_find[leader_b] = UFEntry::encode_link(leader_a); in union()
348 self.union_find[leader_a] += 1; in union()
349 self.union_find[leader_b] = UFEntry::encode_link(leader_a); in union()
392 self.union_find[val] = 0; in finish_union_find()
/dports/math/py-z3-solver/z3-z3-4.8.10/src/util/
H A Dunion_find.h40 class union_find {
51 union_find & m_owner;
53 mk_var_trail(union_find & o):m_owner(o) {} in mk_var_trail()
68 union_find & m_owner;
71 merge_trail(union_find & o, unsigned r1):m_owner(o), m_r1(r1) {} in merge_trail()
88 union_find(Ctx & ctx):m_ctx(ctx), m_trail_stack(ctx.get_trail_stack()), m_mk_var_trail(*this) {} in union_find() function
/dports/math/z3/z3-z3-4.8.13/src/util/
H A Dunion_find.h39 class union_find {
50 union_find & m_owner;
52 mk_var_trail(union_find & o):m_owner(o) {} in mk_var_trail()
66 union_find & m_owner;
69 merge_trail(union_find & o, unsigned r1):m_owner(o), m_r1(r1) {} in merge_trail()
85 union_find(Ctx & ctx):m_ctx(ctx), m_trail_stack(ctx.get_trail_stack()), m_mk_var_trail(*this) {} in union_find() function
/dports/math/py-or-tools/or-tools-9.2/ortools/sat/
H A Dsymmetry_util.cc148 MergingPartition union_find; in GetOrbits() local
149 union_find.Reset(n); in GetOrbits()
161 union_find.MergePartsOf(first, x); in GetOrbits()
170 if (union_find.NumNodesInSamePartAs(i) == 1) continue; in GetOrbits()
171 const int root = union_find.GetRootAndCompressPath(i); in GetOrbits()
/dports/biology/iqtree/IQ-TREE-2.0.6/terraphast/test/
H A Dunion_find.cpp13 union_find leaves(3, alloc);
22 union_find leaves(5, alloc);
38 auto uf = union_find::make_bipartition(vec, alloc); in __anonb0b7cce40102()
/dports/graphics/graphviz/graphviz-2.44.1/lib/spine/
H A DMakefile.am12 noinst_HEADERS = spinehdr.h quad.h spine.h subset.h union_find.h
15 libspine_C_la_SOURCES = quad.c spine.c subset.c union_find.c
/dports/math/z3/z3-z3-4.8.13/src/muz/rel/
H A Ddl_vector_relation.h42 union_find<>* m_eqs;
50 m_eqs(alloc(union_find<>, m_ctx)) { in relation_base()
129 m_eqs = alloc(union_find<>,m_ctx); in set_empty()
150 …virtual T mk_eq(union_find<> const& old_eqs, union_find<> const& neq_eqs, T const& t) const { retu… in mk_eq()
343 union_find<>* uf = alloc(union_find<>, m_ctx); in mk_union()
/dports/math/py-z3-solver/z3-z3-4.8.10/src/muz/rel/
H A Ddl_vector_relation.h42 union_find<>* m_eqs;
50 m_eqs(alloc(union_find<>, m_ctx)) { in relation_base()
129 m_eqs = alloc(union_find<>,m_ctx); in set_empty()
150 …virtual T mk_eq(union_find<> const& old_eqs, union_find<> const& neq_eqs, T const& t) const { retu… in mk_eq()
343 union_find<>* uf = alloc(union_find<>, m_ctx); in mk_union()
/dports/misc/mnn/MNN-1.2.0/tools/script/
H A DfastTestOnnx.py40 self.union_find = self.__data__[9]
51 if v == self.union_find[v]:
53 y = self.__push_union_find(self.union_find[v])
54 if self.dfn[self.sdom[self.best[self.union_find[v]]]] < self.dfn[self.sdom[self.best[v]]]:
55 self.best[v] = self.best[self.union_find[v]]
56 self.union_find[v] = y
84 self.union_find[u] = self.father[u]
/dports/graphics/blender/blender-2.91.0/extern/ceres/internal/ceres/
H A Dgraph_algorithms.h231 std::unordered_map<Vertex, Vertex>* union_find) { in FindConnectedComponent() argument
232 auto it = union_find->find(vertex); in FindConnectedComponent()
233 DCHECK(it != union_find->end()); in FindConnectedComponent()
235 it->second = FindConnectedComponent(it->second, union_find); in FindConnectedComponent()
/dports/math/ceres-solver/ceres-solver-2.0.0/internal/ceres/
H A Dgraph_algorithms.h231 std::unordered_map<Vertex, Vertex>* union_find) { in FindConnectedComponent() argument
232 auto it = union_find->find(vertex); in FindConnectedComponent()
233 DCHECK(it != union_find->end()); in FindConnectedComponent()
235 it->second = FindConnectedComponent(it->second, union_find); in FindConnectedComponent()
/dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/lemon/
H A Dgreedy_tsp.h123 UnionFind<FullGraph::NodeMap<int> > union_find(item_int_map); in run()
125 union_find.insert(n); in run()
136 if (union_find.join(u, v)) { in run()
/dports/math/lemon/lemon-1.3.1/lemon/
H A Dgreedy_tsp.h123 UnionFind<FullGraph::NodeMap<int> > union_find(item_int_map); in run()
125 union_find.insert(n); in run()
136 if (union_find.join(u, v)) { in run()

123456