Home
last modified time | relevance | path

Searched refs:tree1 (Results 1 – 25 of 1189) sorted by relevance

12345678910>>...48

/dports/devel/brz/breezy-3.2.0/breezy/tests/per_intertree/
H A Dtest_compare.py77 tree1 = self.get_tree_no_parents_no_content(tree1)
91 tree1 = self.get_tree_no_parents_no_content(tree1)
134 tree1 = self.get_tree_no_parents_abc_content(tree1)
151 tree1 = self.get_tree_no_parents_abc_content(tree1)
168 tree1 = self.get_tree_no_parents_abc_content(tree1)
185 tree1 = self.get_tree_no_parents_abc_content(tree1)
202 tree1 = self.get_tree_no_parents_abc_content(tree1)
236 tree1 = self.get_tree_no_parents_no_content(tree1)
251 tree1 = self.get_tree_no_parents_no_content(tree1)
269 tree1 = self.get_tree_no_parents_no_content(tree1)
[all …]
H A Dtest_find_path.py36 tree1.add('file')
38 tree1, tree2 = self.mutable_trees_to_test_trees(self, tree1, tree2)
52 tree1, tree2 = self.mutable_trees_to_test_trees(self, tree1, tree2)
63 tree1.add('file')
64 tree1, tree2 = self.mutable_trees_to_test_trees(self, tree1, tree2)
74 tree1.add('file')
79 tree1, tree2 = self.mutable_trees_to_test_trees(self, tree1, tree2)
91 tree1.add('file')
97 tree1, tree2 = self.mutable_trees_to_test_trees(self, tree1, tree2)
109 tree1.add('file')
[all …]
H A Dtest_file_content_matches.py25 tree1 = self.make_branch_and_tree('1')
31 tree1.add('file', b'file-id-1')
33 tree1, tree2 = self.mutable_trees_to_test_trees(self, tree1, tree2)
34 inter = self.intertree_class(tree1, tree2)
38 tree1 = self.make_branch_and_tree('1')
44 tree1.add('file', b'file-id-1')
46 tree1, tree2 = self.mutable_trees_to_test_trees(self, tree1, tree2)
47 inter = self.intertree_class(tree1, tree2)
/dports/mail/dovecot/dovecot-2.3.17/src/doveadm/dsync/
H A Dtest-dsync-mailbox-tree-sync.c187 test_tree_fixup(tree1); in test_trees_nofree()
191 trees_dump(tree1, tree2); in test_trees_nofree()
282 test_trees(tree1, tree2); in test_dsync_mailbox_tree_sync_creates()
301 test_trees(tree1, tree2); in test_dsync_mailbox_tree_sync_deletes()
330 test_trees(tree1, tree2); in test_dsync_mailbox_tree_sync_renames1()
348 test_trees(tree1, tree2); in test_dsync_mailbox_tree_sync_renames2()
366 test_trees(tree1, tree2); in test_dsync_mailbox_tree_sync_renames3()
383 test_trees(tree1, tree2); in test_dsync_mailbox_tree_sync_renames4()
400 test_trees(tree1, tree2); in test_dsync_mailbox_tree_sync_renames5()
418 test_trees(tree1, tree2); in test_dsync_mailbox_tree_sync_renames6()
[all …]
/dports/devel/p5-Tree-Simple/Tree-Simple-1.33/t/
H A D14_Tree_Simple_leak_test.t23 my $tree1 = Tree::Simple->new("1");
24 $tree1_UID = $tree1->getUID();
25 $tree1->addChild($tree2);
45 $tree1->addChild($tree2);
49 $tree1->DESTROY();
70 $tree1->addChild($tree2);
80 $tree1->DESTROY();
104 $tree1->addChild($tree2);
115 is($tree1->getChild(0)->getParent(), $tree1, '... tree2s parent is tree1');
127 $tree1->addChild($tree2);
[all …]
H A D14a_Tree_Simple_weak_refs_test.t23 my $tree1 = Tree::Simple->new("1");
24 $tree1->addChild($tree2);
47 my $tree1 = Tree::Simple->new("1");
48 $tree1->addChild($tree2);
55 weakened_memory_cycle_exists($tree1, '... there is a cycle in tree1');
74 my $tree1 = Tree::Simple->new("1");
79 $tree1->addChild($tree2);
88 is($tree1->getChild(0)->getParent(), $tree1, '... tree2s parent is tree1');
94 my $tree1 = Tree::Simple->new("1");
100 $tree1->addChild($tree2);
[all …]
/dports/databases/p5-DBIx-Class-Tree-NestedSet/DBIx-Class-Tree-NestedSet-0.10/t/
H A D16-siblings.t48 $tree1->discard_changes;
163 $tree1->discard_changes;
166 $tree1->discard_changes;
175 $tree1->discard_changes;
179 $tree1->discard_changes;
189 $tree1->discard_changes;
193 $tree1->discard_changes;
203 $tree1->discard_changes;
208 $tree1->discard_changes;
212 $tree1->discard_changes;
[all …]
H A D14-attach.t36 my $child1_1 = $tree1->add_to_children({ content => '1 child 1' });
37 my $child1_2 = $tree1->add_to_children({ content => '1 child 2' });
38 my $child1_3 = $tree1->add_to_children({ content => '1 child 3' });
51 [map { $_->id} $tree1->nodes],
55 $tree1->discard_changes;
56 $test_tree->structure($tree1,"Initial Tree");
62 $tree1->discard_changes;
64 my @children = $tree1->children;
71 $tree1->discard_changes;
83 $tree1->discard_changes;
[all …]
H A D12-append.t28 my $tree1 = $trees->create({ content => 'tree1 root', root_id => 10});
31 is($tree1->ancestors->count, 0, "Root has no ancestors");
44 $tree1->discard_changes;
54 [map { $_->id} $tree1->nodes],
61 $tree1->discard_changes;
70 [map { $_->id} $tree1->nodes],
77 $tree1->discard_changes;
84 [map { $_->id} $tree1->nodes],
95 [map { $_->id} $tree1->nodes],
96 [map { $_->id} $tree1],
[all …]
/dports/www/webtrees20/webtrees-2.0.19/webtrees/app/Http/RequestHandlers/
H A DMergeTreesAction.php75 …if ($tree1 instanceof Tree && $tree2 instanceof Tree && $tree1 !== $tree2 && $this->admin_service-…
90 ->where('i_file', '=', $tree1->id());
109 ->where('f_file', '=', $tree1->id());
124 ->where('s_file', '=', $tree1->id());
137 ->where('m_file', '=', $tree1->id());
156 ->where('m_file', '=', $tree1->id());
172 ->where('o_file', '=', $tree1->id());
205 ->where('n_file', '=', $tree1->id());
232 ->where('d_file', '=', $tree1->id());
248 ->where('l_file', '=', $tree1->id());
[all …]
/dports/math/fcl05/fcl-0.5.0/include/fcl/traversal/
H A Dtraversal_node_octree.h87 OcTreeIntersectRecurse(tree1, tree1->getRoot(), tree1->getRootBV(), in OcTreeIntersect()
101 OcTreeDistanceRecurse(tree1, tree1->getRoot(), tree1->getRootBV(), in OcTreeDistance()
116 OcTreeMeshIntersectRecurse(tree1, tree1->getRoot(), tree1->getRootBV(), in OcTreeMeshIntersect()
131 OcTreeMeshDistanceRecurse(tree1, tree1->getRoot(), tree1->getRootBV(), in OcTreeMeshDistance()
162 OcTreeMeshDistanceRecurse(tree1, 0, in MeshOcTreeDistance()
247 if(!tree1->nodeHasChildren(root1)) in OcTreeShapeDistanceRecurse()
249 if(tree1->isNodeOccupied(root1)) in OcTreeShapeDistanceRecurse()
338 cresult->addContact(Contact(tree1, &s, root1 - tree1->getRoot(), Contact::NONE)); in OcTreeShapeIntersectRecurse()
451 if(tree1->isNodeOccupied(root1)) in OcTreeMeshDistanceRecurse()
467 dresult->update(dist, tree1, tree2, root1 - tree1->getRoot(), primitive_id); in OcTreeMeshDistanceRecurse()
[all …]
/dports/math/fcl/fcl-0.7.0/include/fcl/narrowphase/detail/traversal/octree/
H A Doctree_solver-inl.h67 const OcTree<S>* tree1, in OcTreeIntersect() argument
77 OcTreeIntersectRecurse(tree1, tree1->getRoot(), tree1->getRootBV(), in OcTreeIntersect()
85 const OcTree<S>* tree1, in OcTreeDistance() argument
95 OcTreeDistanceRecurse(tree1, tree1->getRoot(), tree1->getRootBV(), in OcTreeDistance()
104 const OcTree<S>* tree1, in OcTreeMeshIntersect() argument
114 OcTreeMeshIntersectRecurse(tree1, tree1->getRoot(), tree1->getRootBV(), in OcTreeMeshIntersect()
123 const OcTree<S>* tree1, in OcTreeMeshDistance() argument
133 OcTreeMeshDistanceRecurse(tree1, tree1->getRoot(), tree1->getRootBV(), in OcTreeMeshDistance()
142 const BVHModel<BV>* tree1, in MeshOcTreeIntersect() argument
163 const BVHModel<BV>* tree1, in MeshOcTreeDistance() argument
[all …]
/dports/net/samba412/samba-4.12.15/source4/torture/smb2/
H A Dmultichannel.c510 smb2_util_close(tree1, _h); in test_multichannel_oplock_break_test1()
601 tree1->session = session1; in test_multichannel_oplock_break_test1()
618 talloc_free(tree1); in test_multichannel_oplock_break_test1()
852 tree1->session = session1; in test_multichannel_oplock_break_test2()
872 talloc_free(tree1); in test_multichannel_oplock_break_test2()
1058 tree1->session = session1; in test_multichannel_lease_break_test1()
1079 talloc_free(tree1); in test_multichannel_lease_break_test1()
1370 tree1->session = session1; in test_multichannel_lease_break_test2()
1391 talloc_free(tree1); in test_multichannel_lease_break_test2()
1529 talloc_free(tree1); in test_multichannel_lease_break_test3()
[all …]
H A Doplock.c326 tree1->session->transport->oplock.private_data = tree1; in test_smb2_oplock_exclusive1()
393 tree1->session->transport->oplock.private_data = tree1; in test_smb2_oplock_exclusive2()
471 tree1->session->transport->oplock.private_data = tree1; in test_smb2_oplock_exclusive3()
540 tree1->session->transport->oplock.private_data = tree1; in test_smb2_oplock_exclusive4()
609 tree1->session->transport->oplock.private_data = tree1; in test_smb2_oplock_exclusive5()
691 tree1->session->transport->oplock.private_data = tree1; in test_smb2_oplock_exclusive6()
809 tree1->session->transport->oplock.private_data = tree1; in test_smb2_oplock_exclusive9()
878 tree1->session->transport->oplock.private_data = tree1; in test_smb2_oplock_batch1()
964 tree1->session->transport->oplock.private_data = tree1; in test_smb2_oplock_batch2()
1143 status = smb2_read(tree1, tree1, &r); in test_smb2_oplock_batch4()
[all …]
H A Drename.c50 struct smb2_tree *tree1) in torture_smb2_rename_simple() argument
62 smb2_deltree(tree1, BASEDIR); in torture_smb2_rename_simple()
131 smb2_deltree(tree1, BASEDIR); in torture_smb2_rename_simple()
141 struct smb2_tree *tree1) in torture_smb2_rename_simple2() argument
152 smb2_deltree(tree1, BASEDIR); in torture_smb2_rename_simple2()
223 struct smb2_tree *tree1) in torture_smb2_rename_no_sharemode() argument
314 struct smb2_tree *tree1) in torture_smb2_rename_with_delete_access() argument
442 struct smb2_tree *tree1) in torture_smb2_rename_with_delete_access2() argument
568 struct smb2_tree *tree1) in torture_smb2_rename_no_delete_access() argument
706 struct smb2_tree *tree1) in torture_smb2_rename_no_delete_access2() argument
[all …]
/dports/lang/mit-scheme/mit-scheme-9.2/src/runtime/
H A Dwttree.scm290 ((empty? tree2) tree1)
333 ((empty? tree2) tree1)
343 ((empty? tree2) tree1)
359 ((empty? tree2) tree1)
384 (or (empty? tree1)
386 (with-n-node tree1
580 ((tree-type/union (tree/type tree1)) tree1 tree2))
584 ((tree-type/union-merge (tree/type tree1)) tree1 tree2 merge))
588 ((tree-type/intersection (tree/type tree1)) tree1 tree2))
592 ((tree-type/difference (tree/type tree1)) tree1 tree2))
[all …]
/dports/misc/openvdb/openvdb-9.0.0/openvdb/openvdb/unittest/
H A DTestTree.cc1259 tree1.topologyUnion(tree0); in TEST_F()
1426 tree0.topologyUnion(tree1); in TEST_F()
1512 tree1.clear(); in TEST_F()
1538 EXPECT_TRUE(!tree1.empty()); in TEST_F()
1540 EXPECT_TRUE(tree1.empty()); in TEST_F()
1555 EXPECT_TRUE(!tree1.empty()); in TEST_F()
1557 EXPECT_TRUE(!tree1.empty()); in TEST_F()
1578 EXPECT_TRUE(!tree1.empty()); in TEST_F()
1580 EXPECT_TRUE(!tree1.empty()); in TEST_F()
1602 EXPECT_TRUE(tree1.empty()); in TEST_F()
[all …]
/dports/science/py-DendroPy/DendroPy-4.4.0/src/dendropy/calculate/
H A Dtreecompare.py87 tree1,
99 tree1, argument
241 tree1, argument
439 tree1, argument
632 tree1, argument
640 tree1=tree1,
649 tree=tree1,
723 tree1.encode_bipartitions()
738 tree1, argument
832 tree1, argument
[all …]
/dports/math/vtk6/VTK-6.2.0/Infovis/Core/
H A DvtkTreeDifferenceFilter.cxx74 vtkTree* tree1 = vtkTree::SafeDownCast( in RequestData() local
84 outputTree->CheckedShallowCopy(tree1); in RequestData()
93 if (!this->GenerateMapping(tree1, tree2)) in RequestData()
114 this->ComputeDifference(tree1, tree2); in RequestData()
116 if (!outputTree->CheckedShallowCopy(tree1)) in RequestData()
161 vtkIdType root1 = tree1->GetRoot(); in GenerateMapping()
194 edgeId1 = tree1->GetEdgeId(tree1->GetParent(vertexId1), vertexId1); in GenerateMapping()
203 vertexId1 = tree1->GetParent(vertexId1); in GenerateMapping()
208 edgeId1 = tree1->GetEdgeId(tree1->GetParent(vertexId1), vertexId1); in GenerateMapping()
232 treeData1 = tree1->GetVertexData(); in ComputeDifference()
[all …]
/dports/devel/brz/breezy-3.2.0/breezy/tests/per_branch/
H A Dtest_create_checkout.py46 tree1 = self.make_branch_and_tree('base')
48 tree1.add(['a'])
49 rev1 = tree1.commit('first')
51 tree1.add(['b'])
52 tree1.commit('second')
54 tree2 = tree1.branch.create_checkout('checkout', revision_id=rev1)
61 tree1 = self.make_branch_and_tree('base')
62 tree2 = tree1.branch.create_checkout('checkout', lightweight=True)
63 self.assertNotEqual(tree1.basedir, tree2.basedir)
64 self.assertEqual(tree1.branch.base, tree2.branch.base)
[all …]
/dports/lang/slib/slib-3b6/
H A Dwttree.scm499 (or (empty? tree1)
721 (lambda (tree1 tree2)
723 ((tree-type/union (tree/type tree1)) tree1 tree2)))
728 ((tree-type/union-merge (tree/type tree1)) tree1 tree2 merge)))
731 (lambda (tree1 tree2)
733 ((tree-type/intersection (tree/type tree1)) tree1 tree2)))
736 (lambda (tree1 tree2)
738 ((tree-type/difference (tree/type tree1)) tree1 tree2)))
741 (lambda (tree1 tree2)
743 ((tree-type/subset? (tree/type tree1)) tree1 tree2)))
[all …]
/dports/math/vtk8/VTK-8.2.0/Infovis/Core/
H A DvtkTreeDifferenceFilter.cxx74 vtkTree* tree1 = vtkTree::SafeDownCast( in RequestData() local
84 outputTree->CheckedShallowCopy(tree1); in RequestData()
93 if (!this->GenerateMapping(tree1, tree2)) in RequestData()
114 this->ComputeDifference(tree1, tree2); in RequestData()
116 if (!outputTree->CheckedShallowCopy(tree1)) in RequestData()
161 vtkIdType root1 = tree1->GetRoot(); in GenerateMapping()
194 edgeId1 = tree1->GetEdgeId(tree1->GetParent(vertexId1), vertexId1); in GenerateMapping()
203 vertexId1 = tree1->GetParent(vertexId1); in GenerateMapping()
208 edgeId1 = tree1->GetEdgeId(tree1->GetParent(vertexId1), vertexId1); in GenerateMapping()
232 treeData1 = tree1->GetVertexData(); in ComputeDifference()
[all …]
/dports/math/vtk9/VTK-9.1.0/Infovis/Core/
H A DvtkTreeDifferenceFilter.cxx81 outputTree->CheckedShallowCopy(tree1); in RequestData()
89 if (!this->GenerateMapping(tree1, tree2)) in RequestData()
111 if (!outputTree->CheckedShallowCopy(tree1)) in RequestData()
136 this->EdgeMap.assign(tree1->GetNumberOfEdges(), -1); in GenerateMapping()
156 vtkIdType root1 = tree1->GetRoot(); in GenerateMapping()
188 edgeId1 = tree1->GetEdgeId(tree1->GetParent(vertexId1), vertexId1); in GenerateMapping()
196 vertexId1 = tree1->GetParent(vertexId1); in GenerateMapping()
201 edgeId1 = tree1->GetEdgeId(tree1->GetParent(vertexId1), vertexId1); in GenerateMapping()
213 vtkTree* tree1, vtkTree* tree2) in ComputeDifference() argument
225 treeData1 = tree1->GetVertexData(); in ComputeDifference()
[all …]
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.resources/tests/org.eclipse.core.tests.resources/src/org/eclipse/core/tests/internal/dtree/
H A DDeltaDataTreeTest.java123 tree1.immutable(); in testAddAndRemoveOnSameLayer()
139 tree1.reroot(); in testAddAndRemoveOnSameLayer()
155 tree1.immutable(); in testAddTwiceAndDelete()
156 tree1 = tree1.newEmptyDeltaTree(); in testAddTwiceAndDelete()
160 tree1.immutable(); in testAddTwiceAndDelete()
161 tree1 = tree1.newEmptyDeltaTree(); in testAddTwiceAndDelete()
164 tree1.immutable(); in testAddTwiceAndDelete()
838 tree1 = tree1.newEmptyDeltaTree(); in testRegression1FVVP6L()
844 tree1 = tree1.newEmptyDeltaTree(); in testRegression1FVVP6L()
872 tree1 = tree1.newEmptyDeltaTree(); in testRegression1FVVP6LWithChildren()
[all …]
/dports/math/gap/gap-4.11.0/src/
H A Ddt.c696 Equal( tree1, DT_RIGHT(tree1, index1) , in Leftof()
699 if ( Equal( tree1, DT_LEFT(tree1, index1), in Leftof()
731 else if (Equal(tree1, DT_RIGHT(tree1, index1), tree2, index2 ) ) in Leftof2()
735 else if (Equal(tree1, DT_LEFT(tree1, index1), tree2, index2) ) in Leftof2()
738 return Leftof(tree1, DT_LEFT(tree1, index1), tree2, index2); in Leftof2()
760 if ( Equal(tree1, DT_RIGHT(tree1, index1), in Earlier()
764 if ( DT_GEN(tree1, DT_RIGHT(tree1, index1) ) == in Earlier()
766 return Leftof( tree1, DT_RIGHT(tree1, index1) , in Earlier()
768 return (DT_GEN(tree1, DT_RIGHT(tree1, index1) ) < in Earlier()
791 tree1; in GetPols() local
[all …]

12345678910>>...48