Home
last modified time | relevance | path

Searched refs:unique_nodes (Results 1 – 11 of 11) sorted by relevance

/dports/misc/lifelines/lifelines-3.1.1/src/gedlib/
H A Dnodeutls.c50 unique_nodes (NODE node, in unique_nodes() function
189 curs1 = node1 = unique_nodes(*pnode1, FALSE); in classify_nodes()
190 curs2 = node2 = unique_nodes(*pnode2, FALSE); in classify_nodes()
/dports/devel/brz/breezy-3.2.0/breezy/
H A Dgraph.py457 unique_nodes = unique_searcher.seen.difference(common_searcher.seen)
458 if not unique_nodes:
459 return unique_nodes
463 unique_nodes, unique_searcher, common_searcher)
467 true_unique_nodes = unique_nodes.difference(common_searcher.seen)
470 len(true_unique_nodes), len(unique_nodes))
513 def _make_unique_searchers(self, unique_nodes, unique_searcher, argument
523 unique_nodes, self.get_parent_map(unique_nodes))
569 len(unique_nodes), len(unique_tip_searchers),
/dports/sysutils/conan/conan-1.44.0/conans/client/graph/
H A Dgraph.py295 unique_nodes = {} # {PackageReference: Node (result, unique)}
303 if pref not in unique_nodes:
306 unique_nodes[pref] = result_node
308 result_node = unique_nodes[pref]
/dports/biology/py-scikit-bio/scikit-bio-0.5.6/skbio/diversity/beta/
H A D_unifrac.py350 unique_nodes = np.logical_xor(u_node_counts, v_node_counts)
352 unique_branch_length = (branch_lengths * unique_nodes).sum()
/dports/www/rt44/rt-4.4.5/share/html/Search/Elements/
H A DEditQuery194 my @unique_nodes = grep !$seen{ $_ + 0 }++,
198 foreach my $node ( @unique_nodes ) {
/dports/www/rt50/rt-5.0.2/share/html/Search/Elements/
H A DEditQuery196 my @unique_nodes = grep !$seen{ $_ + 0 }++,
200 foreach my $node ( @unique_nodes ) {
/dports/math/py-matplotlib/matplotlib-3.4.3/src/tri/
H A D_tri.h612 std::set<const Node*> unique_nodes, unique_trapezoid_nodes; member
H A D_tri.cpp1309 stats.unique_nodes.size(), in get_tree_stats()
1598 bool new_node = stats.unique_nodes.insert(this).second; in get_stats()
/dports/math/py-matplotlib2/matplotlib-2.2.4/lib/matplotlib/tri/
H A D_tri.h612 std::set<const Node*> unique_nodes, unique_trapezoid_nodes; member
H A D_tri.cpp1309 stats.unique_nodes.size(), in get_tree_stats()
1598 bool new_node = stats.unique_nodes.insert(this).second; in get_stats()
/dports/misc/lifelines/lifelines-3.1.1/src/hdrs/
H A Dgedcom.h478 NODE unique_nodes(NODE, BOOLEAN);