Home
last modified time | relevance | path

Searched refs:internalNodes (Results 1 – 22 of 22) sorted by relevance

/dports/biology/hyphy/hyphy-2.5.33/res/TemplateBatchFiles/Miscellaneous/phylohandbook/
H A DBranchAPriori.bf85 internalNodes = BranchCount(givenTree);
87 choiceMatrix = {internalNodes+leafNodes,2};
89 for (bc=0; bc<internalNodes; bc=bc+1)
97 choiceMatrix[bc+internalNodes][0] = TipName(givenTree,bc);
98 …choiceMatrix[bc+internalNodes][1] = "Terminal branch endin in " + choiceMatrix[bc+internalNodes][0…
/dports/cad/sumo/sumo-1.2.0/src/netwrite/
H A DNWWriter_DlrNavteq.h79 …st OptionsCont& oc, NBNodeCont& nc, NBEdgeCont& ec, std::map<NBEdge*, std::string>& internalNodes);
86 …ksUnsplitted(const OptionsCont& oc, NBEdgeCont& ec, std::map<NBEdge*, std::string>& internalNodes);
H A DNWWriter_DlrNavteq.cpp58 std::map<NBEdge*, std::string> internalNodes; in writeNetwork() local
59 writeNodesUnsplitted(oc, nb.getNodeCont(), nb.getEdgeCont(), internalNodes); in writeNetwork()
60 writeLinksUnsplitted(oc, nb.getEdgeCont(), internalNodes); in writeNetwork()
81 …t OptionsCont& oc, NBNodeCont& nc, NBEdgeCont& ec, std::map<NBEdge*, std::string>& internalNodes) { in writeNodesUnsplitted() argument
180 internalNodes[e] = internalNodeID; in writeNodesUnsplitted()
196 …sUnsplitted(const OptionsCont& oc, NBEdgeCont& ec, std::map<NBEdge*, std::string>& internalNodes) { in writeLinksUnsplitted() argument
206 … const std::string& betweenNodeID = (e->getGeometry().size() > 2) ? internalNodes[e] : UNDEFINED; in writeLinksUnsplitted()
/dports/biology/hyphy/hyphy-2.5.33/res/TemplateBatchFiles/
H A DTestBranchDNDS.bf337 internalNodes = BranchCount(givenTree);
339 choiceMatrix = {internalNodes+leafNodes,2};
341 for (bc=0; bc<internalNodes; bc=bc+1)
349 choiceMatrix[bc+internalNodes][0] = TipName(givenTree,bc);
350 …choiceMatrix[bc+internalNodes][1] = "Terminal branch endin in " + choiceMatrix[bc+internalNodes][0…
H A DRelativeRatio.bf212 internalNodes = BranchCount(tr2c);
214 choiceMatrix = {leafNodes+internalNodes,2};
220 for (bc=0; bc<internalNodes; bc=bc+1)
H A DYangNielsenBranchSite2005.bf240 internalNodes = BranchCount(givenTree);
242 choiceMatrix = {internalNodes+leafNodes,2};
243 for (bc=0; bc<internalNodes; bc=bc+1)
250 choiceMatrix[bc+internalNodes][0] = TipName(givenTree,bc);
251 choiceMatrix[bc+internalNodes][1] = "Leaf node " + choiceMatrix[bc+internalNodes][0];
H A DTreeTools.ibf411 ExecuteCommands ("internalNodes = BranchCount(`treeID`);");
414 choiceMatrix = {internalNodes+leafNodes,2};
416 for (bc=0; bc<internalNodes; bc=bc+1)
423 ExecuteCommands ("choiceMatrix[bc+internalNodes][0] = TipName(`treeID`,bc);");
424 …choiceMatrix[bc+internalNodes][1] = "Terminal branch endin in " + choiceMatrix[bc+internalNodes][0…
H A DSelectionLRT.bf207 internalNodes = BranchCount(givenTree);
209 choiceMatrix = {internalNodes,2};
211 for (bc=0; bc<internalNodes; bc=bc+1)
/dports/java/jgraph/jgraph-java-5.13.0.4/src/com/jgraph/layout/hierarchical/model/
H A DJGraphHierarchyModel.java312 Collection internalNodes = vertexMapper.values(); in initialRank() local
324 Iterator iter = internalNodes.iterator(); in initialRank()
336 Iterator iter = internalNodes.iterator(); in initialRank()
346 Iterator iter = internalNodes.iterator(); in initialRank()
477 iter = internalNodes.iterator(); in initialRank()
/dports/misc/openvdb/openvdb-9.0.0/openvdb/openvdb/tools/
H A DLevelSetUtil.h976 treePt->getNodes(internalNodes); in computeEnclosedRegionMask()
978 numInternalNodes = internalNodes.size(); in computeEnclosedRegionMask()
991 internalNodes[n]->getNodes(nodes); in computeEnclosedRegionMask()
1103 tree.getNodes(internalNodes); in computeInteriorMask()
1105 numInternalNodes = internalNodes.size(); in computeInteriorMask()
1118 internalNodes[n]->getNodes(nodes); in computeInteriorMask()
2180 tree.getNodes(internalNodes);
2182 numInternalNodes = internalNodes.size();
2231 std::vector<InternalNodeType*> internalNodes;
2232 newTree->getNodes(internalNodes);
[all …]
H A DVolumeToSpheres.h913 std::vector<const Index32InternalNodeT*> internalNodes; in initialize() local
918 if (node) internalNodes.push_back(node); in initialize()
922 mLeafRanges.resize(internalNodes.size()); in initialize()
929 for (size_t n = 0, N = internalNodes.size(); n < N; ++n) { in initialize()
934 for (leafIt = internalNodes[n]->cbeginChildOn(); leafIt; ++leafIt) { in initialize()
953 mNodeBoundingSpheres.resize(internalNodes.size()); in initialize()
H A DComposite.h175 std::vector<const InternalNodeType*> internalNodes; in operator() local
176 mLhsTree->getNodes(internalNodes); in operator()
178 ProcessInternalNodes op(internalNodes, *mRhsTree, *mSegment, leafNodes); in operator()
179 tbb::parallel_reduce(tbb::blocked_range<size_t>(0, internalNodes.size()), op); in operator()
383 std::vector<const InternalNodeType*> internalNodes; in operator() local
384 mRhsTree->getNodes(internalNodes); in operator()
386 ProcessInternalNodes op(internalNodes, *mLhsTree, *mSegment, leafNodes); in operator()
387 tbb::parallel_reduce(tbb::blocked_range<size_t>(0, internalNodes.size()), op); in operator()
/dports/biology/figtree/figtree-1.4.4/src/figtree/treeviewer/
H A DReRootedTree.java159 internalNodes.add(node); in createInternalNode()
292 return new LinkedHashSet<Node>(internalNodes); in getInternalNodes()
438 Set<Node> nodes = new LinkedHashSet<Node>(internalNodes); in getNodes()
687 private final Set<Node> internalNodes = new LinkedHashSet<Node>(); field in ReRootedTree
/dports/graphics/opencv/opencv-4.5.3/contrib/modules/cudaobjdetect/src/
H A Dcascadeclassifier.cpp712 FileNode internalNodes = fnw[CUDA_CC_INTERNAL_NODES]; in load() local
714 if ( internalNodes.empty() || leafValues.empty() ) in load()
717 int nodeCount = (int)internalNodes.size()/nodeStep; in load()
727 FileNodeIterator iIt = internalNodes.begin(), iEnd = internalNodes.end(); in load()
/dports/java/jgraphx/jgraphx-4.2.2/src/com/mxgraph/layout/hierarchical/model/
H A DmxGraphHierarchyModel.java270 Collection<mxGraphHierarchyNode> internalNodes = vertexMapper.values(); in initialRank() local
289 Iterator<mxGraphHierarchyNode> iter = internalNodes.iterator(); in initialRank()
401 iter = internalNodes.iterator(); in initialRank()
/dports/biology/checkm/CheckM-1.0.18/scripts/genometreeworkflow/
H A DconsistencyTest.py136 internalNodes = tree.internal_nodes()
137 for node in internalNodes:
/dports/misc/openvdb/openvdb-9.0.0/openvdb_maya/openvdb_maya/
H A DOpenVDBVisualizeNode.cc510 const bool internalNodes = MPlug(thisNode, aVisualizeInternalNodes).asBool(); in draw() local
549 if (internalNodes && MPlug(thisNode, aCachedInternalNodes).asBool()) { in draw()
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/test/java/org/apache/commons/math3/geometry/euclidean/twod/
H A DPolygonsSetTest.java1203 private int internalNodes; field in PolygonsSetTest.Counter
1208 internalNodes = 0; in count()
1214 ++internalNodes; in count()
1224 return internalNodes; in getInternalNodes()
/dports/graphics/opencv/opencv-4.5.3/modules/objdetect/src/
H A Dcascadedetect.cpp1516 FileNode internalNodes = fnw[CC_INTERNAL_NODES]; in read() local
1518 if( internalNodes.empty() || leafValues.empty() ) in read()
1522 tree.nodeCount = (int)internalNodes.size()/nodeStep; in read()
1533 …FileNodeIterator internalNodesIter = internalNodes.begin(), internalNodesEnd = internalNodes.end(); in read()
/dports/misc/openvdb/openvdb-9.0.0/openvdb/openvdb/tree/
H A DTree.h1326 std::vector<typename RootNodeType::ChildNodeType*> internalNodes;
1327 this->stealNodes(internalNodes);
1329 tbb::parallel_for(tbb::blocked_range<size_t>(0, internalNodes.size()),
1330 DeallocateNodes<typename RootNodeType::ChildNodeType>(internalNodes));
/dports/textproc/R-cran-XML/XML/
H A DMD5224 52a2f734918edcd65e9ff3e6d5d7aea2 *inst/examples/internalNodes.S
/dports/graphics/py-scikit-image/scikit-image-0.19.0/skimage/feature/
H A D_cascade.pyx904 internal_nodes = current_weak_classifier.find('internalNodes')