Home
last modified time | relevance | path

Searched refs:root1 (Results 1 – 25 of 956) sorted by relevance

12345678910>>...39

/dports/misc/lifelines/lifelines-3.1.1/src/gedlib/
H A Dequaliso.c39 equal_tree (NODE root1, in equal_tree() argument
46 while (root1) { in equal_tree()
48 str1 = nval(root1); in equal_tree()
54 root1 = nsibling(root1); in equal_tree()
81 iso_list (NODE root1, in iso_list() argument
92 node1 = root1; in iso_list()
116 while (root1) { in equal_nodes()
121 root1 = nsibling(root1); in equal_nodes()
130 iso_nodes (NODE root1, in iso_nodes() argument
143 return equal_node(root1, root2) && iso_nodes(nchild(root1), in iso_nodes()
[all …]
/dports/math/fcl05/fcl-0.5.0/src/broadphase/
H A Dbroadphase_dynamic_AABB_tree.cpp59 if(root1->isLeaf()) in collisionRecurse_()
125 if(!tree2->nodeHasChildren(root2) || (!root1->isLeaf() && (root1->bv.size() > root2_bv.size()))) in collisionRecurse_()
161 if(root1->isLeaf()) in collisionRecurse_()
168 if(root1->bv.overlap(root2_bv_t)) in collisionRecurse_()
198 if(root1->bv.overlap(root2_bv_t)) in collisionRecurse_()
218 if(!tree2->nodeHasChildren(root2) || (!root1->isLeaf() && (root1->bv.size() > root2_bv.size()))) in collisionRecurse_()
268 if(!tree2->nodeHasChildren(root2) || (!root1->isLeaf() && (root1->bv.size() > root2_bv.size()))) in distanceRecurse_()
357 if(!tree2->nodeHasChildren(root2) || (!root1->isLeaf() && (root1->bv.size() > root2_bv.size()))) in distanceRecurse_()
430 if(root1->isLeaf() && root2->isLeaf()) in collisionRecurse()
438 if(root2->isLeaf() || (!root1->isLeaf() && (root1->bv.size() > root2->bv.size()))) in collisionRecurse()
[all …]
H A Dbroadphase_dynamic_AABB_tree_array.cpp59 if(root1->isLeaf()) in collisionRecurse_()
124 if(!tree2->nodeHasChildren(root2) || (!root1->isLeaf() && (root1->bv.size() > root2_bv.size()))) in collisionRecurse_()
163 if(root1->isLeaf()) in collisionRecurse_()
170 if(root1->bv.overlap(root_bv_t)) in collisionRecurse_()
199 if(root1->bv.overlap(root_bv_t)) in collisionRecurse_()
219 if(!tree2->nodeHasChildren(root2) || (!root1->isLeaf() && (root1->bv.size() > root2_bv.size()))) in collisionRecurse_()
271 if(!tree2->nodeHasChildren(root2) || (!root1->isLeaf() && (root1->bv.size() > root2_bv.size()))) in distanceRecurse_()
353 if(!tree2->nodeHasChildren(root2) || (!root1->isLeaf() && (root1->bv.size() > root2_bv.size()))) in distanceRecurse_()
423 if(root1->isLeaf() && root2->isLeaf()) in collisionRecurse()
431 if(root2->isLeaf() || (!root1->isLeaf() && (root1->bv.size() > root2->bv.size()))) in collisionRecurse()
[all …]
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/nwpw/gw/Transfer/Utilities/
H A Dquadroots.f9023 root1=-bb/(2*aa)
24 root2=root1
33 root1=tt/aa
134 root2 = root1
135 root1 = temp
148 root1 = sqrt(root1) - bb/(4*aa)
176 yy = root1
187 root1 = root1 - bb/(4*aa)
190 root1 = root1 - bb/(4*aa)
200 temp = root1
[all …]
/dports/science/nwchem-data/nwchem-7.0.2-release/src/nwpw/gw/Transfer/Utilities/
H A Dquadroots.f9023 root1=-bb/(2*aa)
24 root2=root1
33 root1=tt/aa
134 root2 = root1
135 root1 = temp
148 root1 = sqrt(root1) - bb/(4*aa)
176 yy = root1
187 root1 = root1 - bb/(4*aa)
190 root1 = root1 - bb/(4*aa)
200 temp = root1
[all …]
/dports/math/gmp/gmp-6.2.1/tests/mpz/
H A Dt-root.c40 MPZ_CHECK_FORMAT (root1); in check_one()
46 mpz_pow_ui (temp, root1, nth); in check_one()
56 debug_mp (root1, 10); in check_one()
66 debug_mp (root1, 10); in check_one()
82 debug_mp (root1, 10); in check_one()
98 mpz_t root1; in main() local
115 mpz_init (root1); in main()
119 res = mpz_root (root1, x2, 2); in main()
141 mpz_pow_ui (x2, root1, nth); in main()
157 mpz_neg (root1, root1); in main()
[all …]
/dports/math/gap/gap-4.11.0/extern/gmp/tests/mpz/
H A Dt-root.c41 MPZ_CHECK_FORMAT (root1); in check_one()
47 mpz_pow_ui (temp, root1, nth); in check_one()
57 debug_mp (root1, 10); in check_one()
67 debug_mp (root1, 10); in check_one()
83 debug_mp (root1, 10); in check_one()
99 mpz_t root1; in main() local
116 mpz_init (root1); in main()
120 res = mpz_root (root1, x2, 2); in main()
142 mpz_pow_ui (x2, root1, nth); in main()
158 mpz_neg (root1, root1); in main()
[all …]
/dports/math/mingw32-libgmp/gmp-6.0.0/tests/mpz/
H A Dt-root.c40 MPZ_CHECK_FORMAT (root1); in check_one()
46 mpz_pow_ui (temp, root1, nth); in check_one()
56 debug_mp (root1, 10); in check_one()
66 debug_mp (root1, 10); in check_one()
82 debug_mp (root1, 10); in check_one()
98 mpz_t root1; in main() local
115 mpz_init (root1); in main()
119 mpz_root (root1, x2, 2); in main()
149 mpz_root (root1, x2, nth); in main()
157 mpz_neg (root1, root1); in main()
[all …]
/dports/math/kalker/gmp-mpfr-sys-21966f4bfb56c87d407eb14c72e92ef4e55856aa/gmp-6.2.1-c/tests/mpz/
H A Dt-root.c40 MPZ_CHECK_FORMAT (root1); in check_one()
46 mpz_pow_ui (temp, root1, nth); in check_one()
56 debug_mp (root1, 10); in check_one()
66 debug_mp (root1, 10); in check_one()
82 debug_mp (root1, 10); in check_one()
98 mpz_t root1; in main() local
115 mpz_init (root1); in main()
119 res = mpz_root (root1, x2, 2); in main()
141 mpz_pow_ui (x2, root1, nth); in main()
157 mpz_neg (root1, root1); in main()
[all …]
/dports/lang/gnustep-base/libs-base-base-1_27_0/Tests/base/NSXMLElement/
H A Dchildren.m14 NSXMLElement *root1;
19 root1 = [[NSXMLElement alloc] initWithName: @"root1"];
36 PASS_RUNS([root1 insertChild: child2 atIndex: 0],
40 PASS_RUNS([root1 removeChildAtIndex: 0],
59 PASS_RUNS([root1 insertChild: c atIndex: 0],
64 PASS_RUNS([root1 insertChild: c atIndex: 0],
68 PASS_RUNS([root1 insertChild: c atIndex: 0],
72 PASS_RUNS([root1 insertChild: c atIndex: 0],
78 PASS_RUNS([root1 insertChild: c atIndex: 0],
120 PASS_RUNS([root1 setChildren: nil],
[all …]
/dports/math/fcl/fcl-0.7.0/include/fcl/broadphase/
H A Dbroadphase_dynamic_AABB_tree-inl.h74 if(root1->isLeaf()) in collisionRecurse_()
140 if(!tree2->nodeHasChildren(root2) || (!root1->isLeaf() && (root1->bv.size() > root2_bv.size()))) in collisionRecurse_()
186 if(root1->isLeaf()) in collisionRecurse_()
193 if(root1->bv.overlap(root2_bv_t)) in collisionRecurse_()
225 if(root1->bv.overlap(root2_bv_t)) in collisionRecurse_()
247 if(!tree2->nodeHasChildren(root2) || (!root1->isLeaf() && (root1->bv.size() > root2_bv.size()))) in collisionRecurse_()
307 if(!tree2->nodeHasChildren(root2) || (!root1->isLeaf() && (root1->bv.size() > root2_bv.size()))) in distanceRecurse_()
356 S d = root1->bv.distance(aabb2); in distanceRecurse_()
418 if(!tree2->nodeHasChildren(root2) || (!root1->isLeaf() && (root1->bv.size() > root2_bv.size()))) in distanceRecurse_()
508 if(root2->isLeaf() || (!root1->isLeaf() && (root1->bv.size() > root2->bv.size()))) in collisionRecurse()
[all …]
H A Dbroadphase_dynamic_AABB_tree_array-inl.h78 if(root1->isLeaf()) in collisionRecurse_()
143 if(!tree2->nodeHasChildren(root2) || (!root1->isLeaf() && (root1->bv.size() > root2_bv.size()))) in collisionRecurse_()
192 if(root1->isLeaf()) in collisionRecurse_()
199 if(root1->bv.overlap(root_bv_t)) in collisionRecurse_()
230 if(root1->bv.overlap(root_bv_t)) in collisionRecurse_()
252 if(!tree2->nodeHasChildren(root2) || (!root1->isLeaf() && (root1->bv.size() > root2_bv.size()))) in collisionRecurse_()
306 if(!tree2->nodeHasChildren(root2) || (!root1->isLeaf() && (root1->bv.size() > root2_bv.size()))) in distanceRecurse_()
355 S d = root1->bv.distance(aabb2); in distanceRecurse_()
401 if(!tree2->nodeHasChildren(root2) || (!root1->isLeaf() && (root1->bv.size() > root2_bv.size()))) in distanceRecurse_()
482 if(root2->isLeaf() || (!root1->isLeaf() && (root1->bv.size() > root2->bv.size()))) in collisionRecurse()
[all …]
/dports/astro/pykep/pykep-2.6/src/third_party/cspice/
H A Drquad_c.c54 SpiceDouble root1[2], in rquad_c()
301 root1[1] = 0.; in rquad_c()
320 root2[0] = ( con / sqr ) / root1[0]; in rquad_c()
330 root1[0] = ( con / sqr ) / root2[0]; in rquad_c()
339 root2[0] = - root1[0]; in rquad_c()
352 root1[0] = -lin / ( 2. * sqr ); in rquad_c()
355 root2[0] = root1[0]; in rquad_c()
356 root2[1] = -root1[1]; in rquad_c()
368 root1[0] = - con / lin; in rquad_c()
369 root1[1] = 0.; in rquad_c()
[all …]
H A Drquad.c14 doublereal *root1, doublereal *root2) in rquad_() argument
293 root1[1] = 0.; in rquad_()
307 root2[0] = con / sqr / root1[0]; in rquad_()
313 root1[0] = con / sqr / root2[0]; in rquad_()
319 root2[0] = -root1[0]; in rquad_()
329 root1[0] = -lin / (sqr * 2.); in rquad_()
331 root2[0] = root1[0]; in rquad_()
332 root2[1] = -root1[1]; in rquad_()
339 root1[0] = -con / lin; in rquad_()
340 root1[1] = 0.; in rquad_()
[all …]
/dports/astro/py-pykep/pykep-2.6/src/third_party/cspice/
H A Drquad_c.c54 SpiceDouble root1[2], in rquad_c()
301 root1[1] = 0.; in rquad_c()
320 root2[0] = ( con / sqr ) / root1[0]; in rquad_c()
330 root1[0] = ( con / sqr ) / root2[0]; in rquad_c()
339 root2[0] = - root1[0]; in rquad_c()
352 root1[0] = -lin / ( 2. * sqr ); in rquad_c()
355 root2[0] = root1[0]; in rquad_c()
356 root2[1] = -root1[1]; in rquad_c()
368 root1[0] = - con / lin; in rquad_c()
369 root1[1] = 0.; in rquad_c()
[all …]
H A Drquad.c14 doublereal *root1, doublereal *root2) in rquad_() argument
293 root1[1] = 0.; in rquad_()
307 root2[0] = con / sqr / root1[0]; in rquad_()
313 root1[0] = con / sqr / root2[0]; in rquad_()
319 root2[0] = -root1[0]; in rquad_()
329 root1[0] = -lin / (sqr * 2.); in rquad_()
331 root2[0] = root1[0]; in rquad_()
332 root2[1] = -root1[1]; in rquad_()
339 root1[0] = -con / lin; in rquad_()
340 root1[1] = 0.; in rquad_()
[all …]
/dports/www/orangehrm/orangehrm-4.9/symfony/lib/vendor/lexpress/doctrine1/tests/Ticket/
H A D1225TestCase.php16 $root1 = new Ticket_1225_Tree();
17 $tree = $root1->getTable()->getTree();
19 $root1->name = 'Name 1';
20 $tree->createRoot($root1);
23 $root1->getNode()->moveAsPrevSiblingOf($root1);
30 $root1->getNode()->moveAsNextSiblingOf($root1);
37 $root1->getNode()->moveAsFirstChildOf($root1);
44 $root1->getNode()->moveAsLastChildOf($root1);
/dports/net/libyang/libyang-1.0.240/tests/internal/
H A Dtest_state_lists.c29 struct lyd_node *root1, *root2; member
99 lyd_hash_check(st->root1); in test_hash()
102 lyd_hash_check(st->root1); in test_hash()
105 lyd_hash_check(st->root1); in test_hash()
108 lyd_hash_check(st->root1); in test_hash()
139 st->root2 = lyd_dup(st->root1, 1); in setup_f()
140 if (!st->root1 || !st->root2) { in setup_f()
154 lyd_hash_check(st->root1); in teardown_f()
157 lyd_free(st->root1); in teardown_f()
310 node = lyd_dup(st->root1->child, 1); in test_merge_equal_list()
[all …]
/dports/math/SCIP/scip-7.0.3/applications/STP/src/
H A Dmisc_stp.c393 return root1; in SCIPpairheapMergeheaps()
394 if( root1 == NULL ) in SCIPpairheapMergeheaps()
403 root1->sibling->prev = root1; in SCIPpairheapMergeheaps()
411 return root1; in SCIPpairheapMergeheaps()
420 root1->sibling->prev = root1; in SCIPpairheapMergeheaps()
436 assert(root1 != NULL); in SCIPpairheapAddtoheap()
446 root1->sibling->prev = root1; in SCIPpairheapAddtoheap()
455 return root1; in SCIPpairheapAddtoheap()
464 root1->sibling->prev = root1; in SCIPpairheapAddtoheap()
608 assert(root1 != NULL); in SCIPpairheapMeldheaps()
[all …]
/dports/games/libtmcg/libTMCG-1.3.18/src/
H A Dmpz_sqrtm.cc439 mpz_mul(root1, root1, u); in tmcg_mpz_sqrtmn_r()
440 mpz_mul(root1, root1, p); in tmcg_mpz_sqrtmn_r()
444 mpz_mod(root1, root1, n); in tmcg_mpz_sqrtmn_r()
491 mpz_mul(root1, root1, u); in tmcg_mpz_sqrtmn()
492 mpz_mul(root1, root1, p); in tmcg_mpz_sqrtmn()
496 mpz_mod(root1, root1, n); in tmcg_mpz_sqrtmn()
544 mpz_mul(root1, root1, u); in tmcg_mpz_sqrtmn_r_all()
545 mpz_mul(root1, root1, p); in tmcg_mpz_sqrtmn_r_all()
549 mpz_mod(root1, root1, n); in tmcg_mpz_sqrtmn_r_all()
587 mpz_mul(root1, root1, u); in tmcg_mpz_sqrtmn_all()
[all …]
/dports/www/py-bokeh/bokeh-2.3.3/tests/unit/bokeh/document/
H A Dtest_document.py324 d.add_root(root1)
388 d.add_root(root1)
392 root1.child = None
416 d.add_root(root1)
753 d.add_root(root1)
771 d.add_root(root1)
835 d.add_root(root1)
839 event1 = ModelChangedEvent(d, root1, 'foo', root1.foo, 57, 57)
856 d.add_root(root1)
865 return root1.lookup('foo').serializable_value(root1)
[all …]
/dports/math/mpir/mpir-3.0.0/tests/mpz/
H A Dt-root.c48 mpz_t root1, root2, root3, rem2; in main() local
67 mpz_init (root1); in main()
86 mpz_root (root1, x2, nth); in main()
99 mpz_pow_ui (x2, root1, nth); in main()
107 mpz_root (root1, x2, nth); in main()
128 debug_mp (root1, 10); in main()
138 debug_mp (root1, 10); in main()
154 debug_mp (root1, 10); in main()
266 mpz_set(root1, cube); in main()
267 mpz_nthroot(root1, root1, 3); in main()
[all …]
/dports/www/orangehrm/orangehrm-4.9/symfony/lib/vendor/lexpress/doctrine1/tests/NestedSet/
H A DMultiRootTestCase.php88 $root1 = new NestedSet_MultiRootNode();
89 $root1->name = 'root1';
90 $root1->save();
93 $treeMngr->createRoot($root1);
94 $this->assertEqual(1, $root1['lft']);
96 $this->assertEqual($root1->id, $root1->root_id);
119 $root1->refresh(); // ! updates lft/rgt
125 $this->assertEqual(1, $root1->lft);
126 $this->assertEqual(4, $root1->rgt);
127 $this->assertEqual(0, $root1->level);
[all …]
/dports/sysutils/py-pywatchman/watchman-4.9.0/tests/integration/
H A Dtest_symlink.py170 root1, root2, root3 = make_roots()
173 expected = [root1, root2, root3]
196 root1, root2, root3 = make_roots()
199 expected = [root1, root2, root3]
222 root1, root2 = make_roots()
225 expected = [root1, root2]
249 root1, root2 = make_roots()
252 expected = [root1, root2]
274 root1, root2 = make_roots()
277 expected = [root1, root2]
[all …]
/dports/math/vtk9/VTK-9.1.0/ThirdParty/vtkm/vtkvtkm/vtk-m/vtkm/worklet/contourtree_augmented/meshtypes/
H A DMeshStructureMarchingCubes.h321 VTKM_ASSERT(0 <= root1 && root1 < N_ALL_NEIGHBOURS); in GetNeighbourComponentsMaskAndDegree()
327 while (parentId[root1] != root1) in GetNeighbourComponentsMaskAndDegree()
329 root1 = parentId[root1]; in GetNeighbourComponentsMaskAndDegree()
330 VTKM_ASSERT(0 <= root1 && root1 < N_ALL_NEIGHBOURS); in GetNeighbourComponentsMaskAndDegree()
332 if (root0 != root1) in GetNeighbourComponentsMaskAndDegree()
334 VTKM_ASSERT(0 <= root1 && root1 < N_ALL_NEIGHBOURS); in GetNeighbourComponentsMaskAndDegree()
354 VTKM_ASSERT(0 <= root1 && root1 < N_ALL_NEIGHBOURS); in GetNeighbourComponentsMaskAndDegree()
360 while (parentId[root1] != root1) in GetNeighbourComponentsMaskAndDegree()
362 root1 = parentId[root1]; in GetNeighbourComponentsMaskAndDegree()
363 VTKM_ASSERT(0 <= root1 && root1 < N_ALL_NEIGHBOURS); in GetNeighbourComponentsMaskAndDegree()
[all …]

12345678910>>...39