| /dports/math/dune-spgrid/dune-spgrid-3977013bee93d1b113b155cc5b881d28d3ee37f5/dune/grid/spgrid/ |
| H A D | tree.hh | 22 template< int codim, class Grid, class IsLeaf >
25 template< class Grid, class IsLeaf >
45 class TreeIterator< Dune::Entity< codim, dim, Grid, EImpl >, IsLeaf >
107 IsLeaf isLeaf_;
115 template< class Grid, class IntersectionImpl, class IsLeaf >
133 explicit TreeIterator ( int face, const IsLeaf &isLeaf ) in TreeIterator()
190 IsLeaf isLeaf_;
201 class EntityTree< codim, SPGrid< ct, dim, Ref, Comm >, IsLeaf >
220 IsLeaf isLeaf_;
229 class IntersectionTree< SPGrid< ct, dim, Ref, Comm >, IsLeaf >
[all …]
|
| /dports/math/vtk9/VTK-9.1.0/Filters/HyperTree/ |
| H A D | vtkHyperTreeGridToDualGrid.cxx | 233 if (cursor->IsLeaf()) in TraverseDualRecursively()
401 if (cursorSW->HasTree() && cursorSW->IsLeaf() && cursorS->HasTree() && cursorS->IsLeaf() && in GenerateDualCornerFromLeaf2D()
402 cursorW->HasTree() && cursorW->IsLeaf()) in GenerateDualCornerFromLeaf2D()
412 if (cursorS->HasTree() && cursorS->IsLeaf() && cursorSE->HasTree() && cursorSE->IsLeaf() && in GenerateDualCornerFromLeaf2D()
423 if (cursorE->HasTree() && cursorE->IsLeaf() && cursorNE->HasTree() && cursorNE->IsLeaf() && in GenerateDualCornerFromLeaf2D()
435 if (cursorW->HasTree() && cursorW->IsLeaf() && cursorN->HasTree() && cursorN->IsLeaf() && in GenerateDualCornerFromLeaf2D()
554 if (cursor->IsLeaf()) in TraverseDualRecursively()
1025 cursor->IsLeaf(dS) && cursor->IsLeaf(dW)) in GenerateDualCornerFromLeaf2D()
1042 cursor->IsLeaf(dSE) && cursor->IsLeaf(dE)) in GenerateDualCornerFromLeaf2D()
1059 cursor->IsLeaf(dNE) && cursor->IsLeaf(dN)) in GenerateDualCornerFromLeaf2D()
[all …]
|
| /dports/devel/lazygit/lazygit-0.31.4/pkg/gui/filetree/ |
| H A D | inode.go | 10 IsLeaf() bool methodSpec
27 if node.IsLeaf() {
36 if !sortedChildren[i].IsLeaf() && sortedChildren[j].IsLeaf() {
39 if sortedChildren[i].IsLeaf() && !sortedChildren[j].IsLeaf() {
51 if node.IsLeaf() {
166 if node.IsLeaf() {
173 for len(grandchildren) == 1 && !grandchildren[0].IsLeaf() {
204 if node.IsLeaf() {
223 if s.IsLeaf() {
|
| /dports/archivers/ppmd-7z/p7zip_9.04/CPP/Common/ |
| H A D | MyMap.cpp | 45 if (n.IsLeaf[bit]) in Find()
61 n.IsLeaf[0] = n.IsLeaf[1] = 1; in Set()
103 n.IsLeaf[newBit] = 1; in Set()
104 n.IsLeaf[1 - newBit] = 0; in Set()
112 if (n.IsLeaf[bit]) in Set()
127 e2.IsLeaf[newBit] = e2.IsLeaf[1 - newBit] = 1; in Set()
132 n.IsLeaf[bit] = 0; in Set()
|
| /dports/archivers/7-zip/7-zip-21.07/CPP/Common/ |
| H A D | MyMap.cpp | 45 if (n.IsLeaf[bit]) in Find()
61 n.IsLeaf[0] = n.IsLeaf[1] = 1; in Set()
103 n.IsLeaf[newBit] = 1; in Set()
104 n.IsLeaf[1 - newBit] = 0; in Set()
112 if (n.IsLeaf[bit]) in Set()
127 e2.IsLeaf[newBit] = e2.IsLeaf[1 - newBit] = 1; in Set()
132 n.IsLeaf[bit] = 0; in Set()
|
| /dports/archivers/maxcso/maxcso-1.10.0/7zip/CPP/Common/ |
| H A D | MyMap.cpp | 45 if (n.IsLeaf[bit]) in Find()
61 n.IsLeaf[0] = n.IsLeaf[1] = 1; in Set()
103 n.IsLeaf[newBit] = 1; in Set()
104 n.IsLeaf[1 - newBit] = 0; in Set()
112 if (n.IsLeaf[bit]) in Set()
127 e2.IsLeaf[newBit] = e2.IsLeaf[1 - newBit] = 1; in Set()
132 n.IsLeaf[bit] = 0; in Set()
|
| /dports/math/openturns/openturns-1.18/lib/src/Base/Diff/Ev3/ |
| H A D | expression.cxx | 407 if (IsLeaf() && t.IsLeaf()) in operator ==()
425 else if ((!IsLeaf()) && (!t.IsLeaf())) in operator ==()
499 if (IsLeaf() && t->IsLeaf()) in IsEqualToNoCoeff()
519 else if ((!IsLeaf()) && (!t->IsLeaf())) in IsEqualToNoCoeff()
550 if (IsLeaf() && t->IsLeaf()) in IsEqualBySchema()
562 else if ((!IsLeaf()) && (!t->IsLeaf())) in IsEqualBySchema()
609 if (IsLeaf()) in DependsOnVariable()
778 if (IsLeaf()) in EnforceDependency()
798 if (IsLeaf()) in VariableToConstant()
6297 else if (a->IsLeaf() && !b->IsLeaf()) in operator ()()
[all …]
|
| /dports/math/vtk9/VTK-9.1.0/Common/DataModel/ |
| H A D | vtkHyperTreeGridEntry.cxx | 88 bool vtkHyperTreeGridEntry::IsLeaf( in IsLeaf() function in vtkHyperTreeGridEntry
96 return tree->IsLeaf(this->Index); in IsLeaf()
107 if (this->IsLeaf(grid, tree, level)) in SubdivideLeaf()
119 bool result = !this->IsLeaf(grid, tree, level); in IsTerminalNode()
124 assert("post: compatible" && (!result || !this->IsLeaf(grid, tree, level))); in IsTerminalNode()
135 assert("pre: not_leaf" && !this->IsLeaf(grid, tree, level)); in ToChild()
|
| H A D | vtkHyperTreeGridLevelEntry.cxx | 120 bool vtkHyperTreeGridLevelEntry::IsLeaf(const vtkHyperTreeGrid* grid) const in IsLeaf() function in vtkHyperTreeGridLevelEntry
128 return this->Tree->IsLeaf(this->Index); in IsLeaf()
139 if (this->IsLeaf(grid)) in SubdivideLeaf()
149 bool result = !this->IsLeaf(grid); in IsTerminalNode()
154 assert("post: compatible" && (!result || !this->IsLeaf(grid))); in IsTerminalNode()
163 assert("pre: not_leaf" && !this->IsLeaf(grid)); in ToChild()
|
| H A D | vtkHyperTreeGridNonOrientedSuperCursorLight.cxx | 150 leaf = this->CentralCursor->IsLeaf(); in GetInformation()
159 leaf = entry.IsLeaf(this->Grid); in GetInformation()
253 bool vtkHyperTreeGridNonOrientedSuperCursorLight::IsLeaf() in IsLeaf() function in vtkHyperTreeGridNonOrientedSuperCursorLight
255 return this->CentralCursor->IsLeaf(); in IsLeaf()
259 bool vtkHyperTreeGridNonOrientedSuperCursorLight::IsLeaf(unsigned int icursor) in IsLeaf() function in vtkHyperTreeGridNonOrientedSuperCursorLight
263 return this->CentralCursor->IsLeaf(); in IsLeaf()
265 return this->Entries[this->GetIndiceEntry(icursor)].IsLeaf(this->Grid); in IsLeaf()
299 assert("pre: Non_leaf" && !this->IsLeaf()); in ToChild()
356 if (current.GetTree() && !current.IsLeaf(this->Grid)) in ToChild()
368 if (this->Entries[previous].GetTree() && !this->Entries[previous].IsLeaf(this->Grid) && in ToChild()
|
| /dports/biology/ugene/ugene-40.1/src/plugins_3rdparty/umuscle/src/muscle/ |
| H A D | phytofile.cpp | 8 if (!IsLeaf(uNodeIndex)) in GetAnyNonLeafNode()
38 bool bGroup = !IsLeaf(uNodeIndex); in ToFileNodeUnrooted()
42 if (IsLeaf(uNodeIndex)) in ToFileNodeUnrooted()
63 bool bGroup = !IsLeaf(uNodeIndex) || IsRoot(uNodeIndex); in ToFileNodeRooted()
67 if (IsLeaf(uNodeIndex)) in ToFileNodeRooted()
|
| H A D | difftrees.cpp | 108 uTreeNodeIndex, bIsDiff[uTreeNodeIndex], tree.IsLeaf(uTreeNodeIndex)); in BuildDiffs()
130 if (tree.IsLeaf(uTreeNodeIndex)) in BuildDiffs()
188 if (Tree1.IsLeaf(uNodeIndex)) in DiffTrees()
196 if (Tree2.IsLeaf(uNodeIndex)) in DiffTrees()
231 Tree1.IsLeaf(uNodeIndex1), in DiffTrees()
236 if (Tree1.IsLeaf(uNodeIndex1) || bIsBachelor1[uNodeIndex1]) in DiffTrees()
328 if (Tree1.IsLeaf(n)) in DiffTrees()
339 if (Tree2.IsLeaf(n)) in DiffTrees()
|
| /dports/biology/muscle/muscle-3.8.1551/ |
| H A D | phytofile.cpp | 8 if (!IsLeaf(uNodeIndex)) in GetAnyNonLeafNode()
38 bool bGroup = !IsLeaf(uNodeIndex); in ToFileNodeUnrooted()
42 if (IsLeaf(uNodeIndex)) in ToFileNodeUnrooted()
63 bool bGroup = !IsLeaf(uNodeIndex) || IsRoot(uNodeIndex); in ToFileNodeRooted()
67 if (IsLeaf(uNodeIndex)) in ToFileNodeRooted()
|
| H A D | difftrees.cpp | 108 uTreeNodeIndex, bIsDiff[uTreeNodeIndex], tree.IsLeaf(uTreeNodeIndex)); in BuildDiffs()
130 if (tree.IsLeaf(uTreeNodeIndex)) in BuildDiffs()
188 if (Tree1.IsLeaf(uNodeIndex)) in DiffTrees()
196 if (Tree2.IsLeaf(uNodeIndex)) in DiffTrees()
231 Tree1.IsLeaf(uNodeIndex1), in DiffTrees()
236 if (Tree1.IsLeaf(uNodeIndex1) || bIsBachelor1[uNodeIndex1]) in DiffTrees()
328 if (Tree1.IsLeaf(n)) in DiffTrees()
339 if (Tree2.IsLeaf(n)) in DiffTrees()
|
| /dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/include/objmgr/impl/ |
| H A D | priority.hpp | 71 bool IsLeaf(void) const;
187 bool CPriorityNode::IsLeaf(void) const in IsLeaf() function in CPriorityNode
195 _ASSERT(IsLeaf()); in GetLeaf()
202 _ASSERT(IsLeaf()); in GetLeaf()
223 return !IsLeaf() && (!IsTree() || m_SubTree->IsEmpty()); in IsEmpty()
232 _ASSERT(m_Node && (m_Node->IsTree() || m_Node->IsLeaf())); in operator *()
|
| /dports/biology/ncbi-blast+/ncbi-blast-2.12.0+-src/c++/include/objmgr/impl/ |
| H A D | priority.hpp | 71 bool IsLeaf(void) const;
187 bool CPriorityNode::IsLeaf(void) const in IsLeaf() function in CPriorityNode
195 _ASSERT(IsLeaf()); in GetLeaf()
202 _ASSERT(IsLeaf()); in GetLeaf()
223 return !IsLeaf() && (!IsTree() || m_SubTree->IsEmpty()); in IsEmpty()
232 _ASSERT(m_Node && (m_Node->IsTree() || m_Node->IsLeaf())); in operator *()
|
| /dports/math/vtk8/VTK-8.2.0/Common/DataModel/ |
| H A D | vtkHyperTreeGrid.cxx | 2355 if( ! ic->IsLeaf() ) in DeepCopyCursors()
2738 if( ! mask && ! cursor->IsLeaf() ) in RecursivelyInitializePureMaterialMask()
2872 if ( cursor->IsLeaf() ) in RecursivelyFindPoint()
3275 if ( cursor->IsLeaf() ) in TraverseDualRecursively()
3316 if ( cursor->IsLeaf() ) in TraverseDualRecursively()
3505 if ( cursorS->GetTree() && cursorS->IsLeaf() in GenerateDualCornerFromLeaf2D()
3518 if ( cursorE->GetTree() && cursorE->IsLeaf() in GenerateDualCornerFromLeaf2D()
3533 if ( cursorW->GetTree() && cursorW->IsLeaf() in GenerateDualCornerFromLeaf2D()
3693 if ( cursorS->GetTree() && cursorS->IsLeaf() in GenerateDualCornerFromLeaf2D()
3707 if ( cursorE->GetTree() && cursorE->IsLeaf() in GenerateDualCornerFromLeaf2D()
[all …]
|
| /dports/net-p2p/amule/aMule-2.3.3/src/kademlia/routing/ |
| H A D | RoutingZone.cpp | 126 if (IsLeaf()) {
520 if (IsLeaf()) {
531 if (IsLeaf()) {
541 if (IsLeaf()) {
553 if (IsLeaf()) {
570 if (IsLeaf()) {
580 if (IsLeaf()) {
592 if (IsLeaf()) {
601 if (IsLeaf()) {
631 if (IsLeaf()) {
[all …]
|
| /dports/net-p2p/amule-devel/aMule-SVN-r11065/src/kademlia/routing/ |
| H A D | RoutingZone.cpp | 126 if (IsLeaf()) {
520 if (IsLeaf()) {
531 if (IsLeaf()) {
541 if (IsLeaf()) {
553 if (IsLeaf()) {
570 if (IsLeaf()) {
580 if (IsLeaf()) {
592 if (IsLeaf()) {
601 if (IsLeaf()) {
631 if (IsLeaf()) {
[all …]
|
| /dports/www/carbonapi/carbonapi-0.14.1/cmd/carbonapi/http/ |
| H A D | find_handlers.go | 77 if g.IsLeaf {
105 IsLeaf string `json:"is_leaf"` member
119 if !g.IsLeaf && path[len(path)-1:] != "." {
126 if g.IsLeaf {
127 c.IsLeaf = "1"
129 c.IsLeaf = "0"
163 if !g.IsLeaf && !strings.HasSuffix(g.Path, ".") {
319 r.Matches = append(r.Matches, pbv2.GlobMatch{IsLeaf: m.IsLeaf, Path: m.Path})
342 "isLeaf": metric.IsLeaf,
348 "is_leaf": metric.IsLeaf,
|
| /dports/math/mlpack/mlpack-3.4.2/src/mlpack/core/tree/octree/ |
| H A D | dual_tree_traverser_impl.hpp | 57 if (queryNode.IsLeaf() && referenceNode.IsLeaf()) in Traverse()
80 else if (!queryNode.IsLeaf() && referenceNode.IsLeaf()) in Traverse()
96 else if (queryNode.IsLeaf() && !referenceNode.IsLeaf()) in Traverse()
|
| /dports/misc/py-xgboost/xgboost-1.5.1/src/tree/ |
| H A D | updater_prune.cc | 71 CHECK(tree[nid].IsLeaf()); in TryPruneLeaf()
76 CHECK(!tree[pid].IsLeaf()); in TryPruneLeaf()
81 bool balanced = tree[left].IsLeaf() && in TryPruneLeaf()
82 right != RegTree::kInvalidNodeId && tree[right].IsLeaf(); in TryPruneLeaf()
97 if (tree[nid].IsLeaf() && !tree[nid].IsDeleted()) { in DoPrune()
|
| /dports/misc/xgboost/xgboost-1.5.1/src/tree/ |
| H A D | updater_prune.cc | 71 CHECK(tree[nid].IsLeaf()); in TryPruneLeaf()
76 CHECK(!tree[pid].IsLeaf()); in TryPruneLeaf()
81 bool balanced = tree[left].IsLeaf() && in TryPruneLeaf()
82 right != RegTree::kInvalidNodeId && tree[right].IsLeaf(); in TryPruneLeaf()
97 if (tree[nid].IsLeaf() && !tree[nid].IsDeleted()) { in DoPrune()
|
| /dports/deskutils/treesheets/treesheets-1.0.2/lobster/src/lobster/ |
| H A D | octree.h | 44 if (oval.IsLeaf()) { // Values are not equal, so we must subdivide. in Set()
64 assert(val.IsLeaf()); in Set()
97 if (oval.IsLeaf()) { in Get()
110 if (!n.IsLeaf()) n = Merge(n.NodeIdx());
114 if (!nodes[cur].IsLeaf()) return ov;
129 bool IsLeaf() const { return node < 0; } in IsLeaf() function
|
| /dports/math/mlpack/mlpack-3.4.2/src/mlpack/core/tree/rectangle_tree/ |
| H A D | dual_tree_traverser_impl.hpp | 67 if (queryNode.IsLeaf() && referenceNode.IsLeaf()) in Traverse()
87 else if (!queryNode.IsLeaf() && referenceNode.IsLeaf()) in Traverse()
101 else if (queryNode.IsLeaf() && !referenceNode.IsLeaf()) in Traverse()
|