Home
last modified time | relevance | path

Searched refs:theTree (Results 1 – 25 of 43) sorted by relevance

12

/dports/cad/opencascade/opencascade-7.6.0/inc/
H A DBVH_BinaryTree.hxx152 …void EstimateSAH (const BVH_Tree<T, N, BVH_BinaryTree>* theTree, const int theNode, T theProb, T& … in EstimateSAH() argument
154 BVH_Box<T, N> aBox (theTree->MinPoint (theNode), in EstimateSAH()
155 theTree->MaxPoint (theNode)); in EstimateSAH()
157 if (theTree->IsOuter (theNode)) in EstimateSAH()
159 theSAH += theProb * (theTree->EndPrimitive (theNode) - theTree->BegPrimitive (theNode) + 1); in EstimateSAH()
165 BVH_Box<T, N> aLftBox (theTree->MinPoint (theTree->template Child<0> (theNode)), in EstimateSAH()
166 theTree->MaxPoint (theTree->template Child<0> (theNode))); in EstimateSAH()
170 EstimateSAH (theTree, theTree->template Child<0> (theNode), in EstimateSAH()
174 BVH_Box<T, N> aRghBox (theTree->MinPoint (theTree->template Child<1> (theNode)), in EstimateSAH()
175 theTree->MaxPoint (theTree->template Child<1> (theNode))); in EstimateSAH()
[all …]
H A DBVH_LinearBuilder.hxx172 const BVH_Vec4i aData = theTree->NodeInfoBuffer()[theNode]; in UpdateBounds()
175 const Standard_Integer aLftChild = theTree->NodeInfoBuffer()[theNode].y(); in UpdateBounds()
176 const Standard_Integer aRghChild = theTree->NodeInfoBuffer()[theNode].z(); in UpdateBounds()
178 const Standard_Integer aLftDepth = UpdateBounds (theSet, theTree, aLftChild); in UpdateBounds()
179 const Standard_Integer aRghDepth = UpdateBounds (theSet, theTree, aRghChild); in UpdateBounds()
181 typename BVH_Box<T, N>::BVH_VecNt aLftMinPoint = theTree->MinPointBuffer()[aLftChild]; in UpdateBounds()
182 typename BVH_Box<T, N>::BVH_VecNt aLftMaxPoint = theTree->MaxPointBuffer()[aLftChild]; in UpdateBounds()
189 theTree->MinPointBuffer()[theNode] = aLftMinPoint; in UpdateBounds()
190 theTree->MaxPointBuffer()[theNode] = aLftMaxPoint; in UpdateBounds()
195 typename BVH_Box<T, N>::BVH_VecNt& aMinPoint = theTree->MinPointBuffer()[theNode]; in UpdateBounds()
[all …]
/dports/cad/opencascade/opencascade-7.6.0/src/BVH/
H A DBVH_BinaryTree.hxx152 …void EstimateSAH (const BVH_Tree<T, N, BVH_BinaryTree>* theTree, const int theNode, T theProb, T& … in EstimateSAH() argument
154 BVH_Box<T, N> aBox (theTree->MinPoint (theNode), in EstimateSAH()
155 theTree->MaxPoint (theNode)); in EstimateSAH()
157 if (theTree->IsOuter (theNode)) in EstimateSAH()
159 theSAH += theProb * (theTree->EndPrimitive (theNode) - theTree->BegPrimitive (theNode) + 1); in EstimateSAH()
165 BVH_Box<T, N> aLftBox (theTree->MinPoint (theTree->template Child<0> (theNode)), in EstimateSAH()
166 theTree->MaxPoint (theTree->template Child<0> (theNode))); in EstimateSAH()
170 EstimateSAH (theTree, theTree->template Child<0> (theNode), in EstimateSAH()
174 BVH_Box<T, N> aRghBox (theTree->MinPoint (theTree->template Child<1> (theNode)), in EstimateSAH()
175 theTree->MaxPoint (theTree->template Child<1> (theNode))); in EstimateSAH()
[all …]
H A DBVH_LinearBuilder.hxx172 const BVH_Vec4i aData = theTree->NodeInfoBuffer()[theNode]; in UpdateBounds()
175 const Standard_Integer aLftChild = theTree->NodeInfoBuffer()[theNode].y(); in UpdateBounds()
176 const Standard_Integer aRghChild = theTree->NodeInfoBuffer()[theNode].z(); in UpdateBounds()
178 const Standard_Integer aLftDepth = UpdateBounds (theSet, theTree, aLftChild); in UpdateBounds()
179 const Standard_Integer aRghDepth = UpdateBounds (theSet, theTree, aRghChild); in UpdateBounds()
181 typename BVH_Box<T, N>::BVH_VecNt aLftMinPoint = theTree->MinPointBuffer()[aLftChild]; in UpdateBounds()
182 typename BVH_Box<T, N>::BVH_VecNt aLftMaxPoint = theTree->MaxPointBuffer()[aLftChild]; in UpdateBounds()
189 theTree->MinPointBuffer()[theNode] = aLftMinPoint; in UpdateBounds()
190 theTree->MaxPointBuffer()[theNode] = aLftMaxPoint; in UpdateBounds()
195 typename BVH_Box<T, N>::BVH_VecNt& aMinPoint = theTree->MinPointBuffer()[theNode]; in UpdateBounds()
[all …]
/dports/devel/py-cadquery-pywrap/pywrap-e8c7bc9/opencascade/
H A DBVH_BinaryTree.hxx152 …void EstimateSAH (const BVH_Tree<T, N, BVH_BinaryTree>* theTree, const int theNode, T theProb, T& … in EstimateSAH() argument
154 BVH_Box<T, N> aBox (theTree->MinPoint (theNode), in EstimateSAH()
155 theTree->MaxPoint (theNode)); in EstimateSAH()
157 if (theTree->IsOuter (theNode)) in EstimateSAH()
159 theSAH += theProb * (theTree->EndPrimitive (theNode) - theTree->BegPrimitive (theNode) + 1); in EstimateSAH()
165 BVH_Box<T, N> aLftBox (theTree->MinPoint (theTree->template Child<0> (theNode)), in EstimateSAH()
166 theTree->MaxPoint (theTree->template Child<0> (theNode))); in EstimateSAH()
170 EstimateSAH (theTree, theTree->template Child<0> (theNode), in EstimateSAH()
174 BVH_Box<T, N> aRghBox (theTree->MinPoint (theTree->template Child<1> (theNode)), in EstimateSAH()
175 theTree->MaxPoint (theTree->template Child<1> (theNode))); in EstimateSAH()
[all …]
H A DBVH_LinearBuilder.hxx171 const BVH_Vec4i aData = theTree->NodeInfoBuffer()[theNode]; in UpdateBounds()
174 const Standard_Integer aLftChild = theTree->NodeInfoBuffer()[theNode].y(); in UpdateBounds()
175 const Standard_Integer aRghChild = theTree->NodeInfoBuffer()[theNode].z(); in UpdateBounds()
177 const Standard_Integer aLftDepth = UpdateBounds (theSet, theTree, aLftChild); in UpdateBounds()
178 const Standard_Integer aRghDepth = UpdateBounds (theSet, theTree, aRghChild); in UpdateBounds()
180 typename BVH_Box<T, N>::BVH_VecNt aLftMinPoint = theTree->MinPointBuffer()[aLftChild]; in UpdateBounds()
181 typename BVH_Box<T, N>::BVH_VecNt aLftMaxPoint = theTree->MaxPointBuffer()[aLftChild]; in UpdateBounds()
188 theTree->MinPointBuffer()[theNode] = aLftMinPoint; in UpdateBounds()
189 theTree->MaxPointBuffer()[theNode] = aLftMaxPoint; in UpdateBounds()
194 typename BVH_Box<T, N>::BVH_VecNt& aMinPoint = theTree->MinPointBuffer()[theNode]; in UpdateBounds()
[all …]
/dports/graphics/cegui/cegui-0.8.7/samples/TreeDemo/
H A DSample_TreeDemo.cpp96 Tree * theTree; in initialise() local
151 theTree = (Tree *)TreeDemoWindow->getChild(TreeID); in initialise()
152 theTree->initialise(); in initialise()
153 …theTree->subscribeEvent(Tree::EventSelectionChanged, Event::Subscriber(&TreeDemoSample::handleEven… in initialise()
154 …theTree->subscribeEvent(Tree::EventBranchOpened, Event::Subscriber(&TreeDemoSample::handleEventBra… in initialise()
155 …theTree->subscribeEvent(Tree::EventBranchClosed, Event::Subscriber(&TreeDemoSample::handleEventBra… in initialise()
175 theTree->addItem(newTreeCtrlEntryLvl1); in initialise()
207 theTree->addItem(newTreeCtrlEntryLvl1); in initialise()
219 theTree->addItem(newTreeCtrlEntryLvl1); in initialise()
238 theTree->addItem(newTreeCtrlEntryLvl1); in initialise()
[all …]
/dports/graphics/ossim/ossim-OrchidIsland-2.11.1/src/base/
H A DossimQuadTreeWarp.cpp306 :theTree(NULL) in ossimQuadTreeWarp()
315 :theTree(NULL) in ossimQuadTreeWarp()
323 theTree(NULL) in ossimQuadTreeWarp()
384 theTree->theUlVertex = ul; in create()
385 theTree->theUrVertex = ur; in create()
386 theTree->theLrVertex = lr; in create()
401 return theTree; in getRoot()
406 return theTree; in getRoot()
411 return (theTree==NULL); in isEmpty()
546 if(theTree) in clear()
[all …]
/dports/java/bouncycastle15/crypto-169/core/src/main/java/org/bouncycastle/crypto/digests/
H A DKangaroo.java210 private final KangarooSponge theTree; field in Kangaroo.KangarooBase
290 return theTree.theRateBytes; in getByteLength()
380 theTree.squeeze(pOut, pOutOffset, pOutLen); in doOutput()
441 theTree.initSponge(); in reset()
459 theTree.absorb(FIRST, 0, FIRST.length); in switchLeaf()
471 theTree.absorb(myHash, 0, theChainLen); in switchLeaf()
526 theTree.absorb(SINGLE, 0, 1); in switchSingle()
529 theTree.padAndSwitchToSqueezingPhase(); in switchSingle()
542 theTree.absorb(myLength, 0, myLength.length); in switchFinal()
545 theTree.absorb(FINAL, 0, FINAL.length); in switchFinal()
[all …]
/dports/biology/hyphy/hyphy-2.5.33/Examples/SimpleConstraints/
H A DMolecularClockHKY85.bf54 Tree theTree = (TAAJ153,(HVRNASS,(RICRSS3,((ZMSUCS1,(OSRSS1A,(TASUCSYN1,HVSSYNMR))),(MZESUS1,ORRSS…
59 LikelihoodFunction theLnLik = (filteredData, theTree);
78 MolecularClock (theTree, trst);
89 ClearConstraints (theTree);
90 MolecularClock (theTree, trvs);
99 MolecularClock (theTree, trst);
H A DMolecularClockF81.bf91 Tree theTree = (TAAJ153,(HVRNASS,(RICRSS3,((ZMSUCS1,(OSRSS1A,(TASUCSYN1,HVSSYNMR)Internal1)),(MZES…
101 LikelihoodFunction theLnLik = (filteredData, theTree);
133 MolecularClock (theTree, mu);
159 ClearConstraints (theTree);
161 MolecularClock (theTree.Internal1, mu);
183 MolecularClock (theTree.Internal2, mu);
/dports/textproc/zorba/zorba-2.7.0/src/store/naive/
H A Djson_items.cpp88 delete theTree; in ~JSONItem()
115 if (theTree == NULL) in getCollection()
119 return theTree->getCollection(); in getCollection()
128 ZORBA_ASSERT(theTree); in getTreeId()
129 return theTree->getTreeId(); in getTreeId()
138 ZORBA_ASSERT(theTree); in getRoot()
139 return theTree->getRoot(); in getRoot()
184 if (theTree != NULL) in assertInvariant()
503 theTree = aTree; in setTree()
620 if (theTree != aTree) in isThisTreeOfAllDescendants()
[all …]
H A Dloader_fast.cpp108 theTree(NULL), in FastXmlLoader()
151 theTree->setRoot(root); in setRoot()
174 if (theTree != NULL) in abortload()
176 delete theTree; in abortload()
177 theTree = NULL; in abortload()
218 theTree = NULL; in reset()
281 theTree = GET_STORE().getNodeFactory().createXmlTree(); in loadXml()
444 docNode->setId(loader.theTree, &loader.theOrdPath); in startDocument()
524 loader.theTree->setDataGuide(rootGNode); in endDocument()
662 elemNode->setId(loader.theTree, &loader.theOrdPath); in startElement()
[all …]
H A Dloader_dtd.cpp190 theTree = GET_STORE().getNodeFactory().createXmlTree(); in loadXml()
596 theTree(NULL), in DtdXmlLoader()
637 theTree->setRoot(root); in setRoot()
649 if (theTree != NULL) in abortload()
651 delete theTree; in abortload()
652 theTree = NULL; in abortload()
704 theTree = NULL; in reset()
1072 docNode->setId(loader.theTree, &loader.theOrdPath); in startDocument()
1149 loader.theTree->setDataGuide(rootGNode); in endDocument()
1294 elemNode->setId(loader.theTree, &loader.theOrdPath); in startElement()
[all …]
/dports/textproc/sablotron/Sablot-1.0.3/src/engine/
H A Dparser.cpp71 theTree = NULL; in TreeConstructer()
91 theTree = t; in parseDataLineUsingGivenExpat()
164 theTree = t; in parseUsingSAX()
494 Tree *t = this_ -> theTree; in tcStartElement()
696 Tree *t = this_ -> theTree; in tcEndElement()
750 Tree *t = this_ -> theTree; in tcStartNamespace2()
800 Tree *t = this_ -> theTree; in tcEndNamespace()
830 Tree *t = this_ -> theTree; in tcComment()
863 Tree *t = this_ -> theTree; in tcPI()
900 Tree *t = this_ -> theTree; in tcCharacters()
[all …]
/dports/net/norm/norm-1.5r6/protolib/include/
H A DprotoTree.h290 SimpleIterator(ProtoTree& theTree);
370 Iterator(ProtoTreeTemplate& theTree,
373 : ProtoTree::Iterator(theTree, reverse, cursor) {} in Iterator() argument
391 SimpleIterator(ProtoTreeTemplate& theTree) in SimpleIterator() argument
392 : ProtoTree::SimpleIterator(theTree) {} in SimpleIterator()
642 Iterator(ProtoSortedTreeTemplate& theTree,
646 : ProtoSortedTree::Iterator(theTree, reverse, keyMin, keysize) {} in Iterator() argument
/dports/biology/hyphy/hyphy-2.5.33/src/core/
H A Dformula.cpp72 theTree = nil; in _Formula()
137 theTree = nil; in Initialize()
170 theTree = f_cast->theTree->duplicate_tree(); in Duplicate()
172 theTree = nil; in Duplicate()
247 if (theTree) { in Clear()
249 delete theTree; in Clear()
251 theTree = nil; in Clear()
301 delete theTree; in toStr()
302 theTree = nil; in toStr()
2515 if (theTree) { in ScanFormulaForHBLFunctions()
[all …]
/dports/lang/ghc/ghc-8.10.7/libraries/base/tests/
H A DT13191.hs63 theTree :: Tree ()
64 theTree = buildTree 7 () function
68 SomeVec v -> SomeVec $ traverse (const v) theTree
/dports/math/singular/Singular-Release-4-2-1/gfanlib/
H A Dgfanlib_symmetry.cpp131 TrieNode theTree; member in gfan::Trie
134 theTree(Permutation(n_),0), in Trie()
140 return theTree.size(0,n); in size()
144 theTree.insert(v,0); in insert()
160 theTree.search(v,building,tempPerm,ret,optimal,0,isImproving); in search()
170 theTree.searchStabalizer(v,building,tempPerm,ret,optimal,0,isImproving,toBeFixed); in searchStabalizer()
175 return theTree.stabilizerSize(v,0); in stabilizerSize()
/dports/math/gfan/gfan0.6.2/src/
H A Dgfanlib_symmetry.cpp131 TrieNode theTree; member in gfan::Trie
134 theTree(Permutation(n_),0), in Trie()
140 return theTree.size(0,n); in size()
144 theTree.insert(v,0); in insert()
160 theTree.search(v,building,tempPerm,ret,optimal,0,isImproving); in search()
170 theTree.searchStabalizer(v,building,tempPerm,ret,optimal,0,isImproving,toBeFixed); in searchStabalizer()
175 return theTree.stabilizerSize(v,0); in stabilizerSize()
H A Dsymmetry.cpp131 TrieNode theTree; member in Trie
135 theTree(SymmetryGroup::identity(n_),0,0) in Trie()
140 return theTree.size(0,n); in size()
144 theTree.insert(v,0,value); in insert()
160 theTree.search(v,building,tempPerm,ret,optimal,0,isImproving,value); in search()
170 theTree.searchStabalizer(v,building,tempPerm,ret,optimal,0,isImproving,toBeFixed); in searchStabalizer()
175 return theTree.stabilizerSize(v,0); in stabilizerSize()
639 trie->theTree.print(0,elements[0].size()); in createTrie()
/dports/math/gfanlib/gfan0.6.2/src/
H A Dgfanlib_symmetry.cpp131 TrieNode theTree; member in gfan::Trie
134 theTree(Permutation(n_),0), in Trie()
140 return theTree.size(0,n); in size()
144 theTree.insert(v,0); in insert()
160 theTree.search(v,building,tempPerm,ret,optimal,0,isImproving); in search()
170 theTree.searchStabalizer(v,building,tempPerm,ret,optimal,0,isImproving,toBeFixed); in searchStabalizer()
175 return theTree.stabilizerSize(v,0); in stabilizerSize()
H A Dsymmetry.cpp131 TrieNode theTree; member in Trie
135 theTree(SymmetryGroup::identity(n_),0,0) in Trie()
140 return theTree.size(0,n); in size()
144 theTree.insert(v,0,value); in insert()
160 theTree.search(v,building,tempPerm,ret,optimal,0,isImproving,value); in search()
170 theTree.searchStabalizer(v,building,tempPerm,ret,optimal,0,isImproving,toBeFixed); in searchStabalizer()
175 return theTree.stabilizerSize(v,0); in stabilizerSize()
639 trie->theTree.print(0,elements[0].size()); in createTrie()
/dports/devel/libantlr3c/libantlr3c-3.4/src/
H A Dantlr3commontree.c425 pANTLR3_COMMON_TREE theTree; in getType() local
427 theTree = (pANTLR3_COMMON_TREE)(tree->super); in getType()
429 if (theTree->token == NULL) in getType()
435 return theTree->token->getType(theTree->token); in getType()
H A Dantlr3basetreeadaptor.c73 static pANTLR3_STRING makeDot (pANTLR3_BASE_TREE_ADAPTOR adaptor, void * theTree);
359 makeDot (pANTLR3_BASE_TREE_ADAPTOR adaptor, void * theTree) in makeDot() argument
384 if (theTree == NULL) in makeDot()
392 sprintf(buff, "\tn%p[label=\"", theTree); in makeDot()
394 text = adaptor->getText(adaptor, theTree); in makeDot()
424 defineDotNodes(adaptor, theTree, dotSpec); in makeDot()
426 defineDotEdges(adaptor, theTree, dotSpec); in makeDot()

12