Home
last modified time | relevance | path

Searched refs:TreeNode (Results 1 – 25 of 2304) sorted by relevance

12345678910>>...93

/dports/lang/kturtle/kturtle-21.12.3/src/interpreter/
H A Dparser.h96 TreeNode *rootNode;
121 TreeNode* parseIf();
125 TreeNode* parseFor();
134 TreeNode* parseGo();
135 TreeNode* parseGoX();
136 TreeNode* parseGoY();
156 TreeNode* parseAsk();
157 TreeNode* parsePi();
158 TreeNode* parseTan();
159 TreeNode* parseSin();
[all …]
H A Dexecuter.h130 TreeNode* rootNode;
133 TreeNode* newScope;
136 TreeNode* currentNode;
176 void executeIf(TreeNode* node);
180 void executeFor(TreeNode* node);
186 void executeAnd(TreeNode* node);
187 void executeOr(TreeNode* node);
188 void executeNot(TreeNode* node);
206 void executeGo(TreeNode* node);
229 void executePi(TreeNode* node);
[all …]
H A Dparser.cpp500 TreeNode* node = new TreeNode(currentToken); in parseFunctionCall()
518 TreeNode* node = new TreeNode(currentToken); in parseScopeClose()
545 TreeNode* node = new TreeNode(currentToken); in parseExit()
552 TreeNode* node = new TreeNode(currentToken); in parseIf()
570 TreeNode* node = new TreeNode(currentToken); in parseRepeat()
582 TreeNode* node = new TreeNode(currentToken); in parseWhile()
594 TreeNode* node = new TreeNode(currentToken); in parseFor()
631 TreeNode* node = new TreeNode(currentToken); in parseBreak()
638 TreeNode* node = new TreeNode(currentToken); in parseReturn()
646 TreeNode* node = new TreeNode(currentToken); in parseWait()
[all …]
/dports/graphics/dcmtk/dcmtk-DCMTK-3.6.6/dcmsr/libsrc/
H A Ddsrcitem.cc57 : TreeNode(NULL), in DSRContentItem()
65 : TreeNode(NULL), in DSRContentItem()
70 TreeNode = item.TreeNode->clone(); in DSRContentItem()
77 delete TreeNode; in ~DSRContentItem()
83 OFBool result = (TreeNode == item.TreeNode); in operator ==()
85 if (!result && (TreeNode != NULL) && (item.TreeNode != NULL)) in operator ==()
86 result = TreeNode->operator==(*item.TreeNode); in operator ==()
93 OFBool result = (TreeNode != item.TreeNode); in operator !=()
95 if (result && (TreeNode != NULL) && (item.TreeNode != NULL)) in operator !=()
96 result = TreeNode->operator!=(*item.TreeNode); in operator !=()
[all …]
/dports/deskutils/akregator/akregator-21.12.3/src/
H A Dtreenode.cpp21 TreeNode::TreeNode() in TreeNode() function in TreeNode
37 TreeNode::~TreeNode() in ~TreeNode()
55 TreeNode *TreeNode::nextSibling() in nextSibling()
66 const TreeNode *TreeNode::nextSibling() const in nextSibling()
77 TreeNode *TreeNode::prevSibling() in prevSibling()
88 const TreeNode *TreeNode::prevSibling() const in prevSibling()
108 QList<const TreeNode *> TreeNode::children() const in children()
113 QList<TreeNode *> TreeNode::children() in children()
118 const TreeNode *TreeNode::childAt(int pos) const in childAt()
124 TreeNode *TreeNode::childAt(int pos) in childAt()
[all …]
H A Dfolder.h91 TreeNode *childAt(int pos) override;
99 void insertChild(TreeNode *node, TreeNode *after);
103 void prependChild(TreeNode *node);
107 void appendChild(TreeNode *node);
111 void removeChild(TreeNode *node);
114 TreeNode *firstChild();
115 const TreeNode *firstChild() const;
118 TreeNode *lastChild();
119 const TreeNode *lastChild() const;
131 TreeNode *next() override;
[all …]
/dports/biology/mrbayes/MrBayes-3.2.7/src/
H A Dlikelihood.h42 int CondLikeDown_Bin (TreeNode *p, int division, int chain);
46 int CondLikeDown_Gen (TreeNode *p, int division, int chain);
66 int CondLikeDown_Std (TreeNode *p, int division, int chain);
110 int CondLikeUp_Bin (TreeNode *p, int division, int chain);
111 int CondLikeUp_Gen (TreeNode *p, int division, int chain);
113 int CondLikeUp_Std (TreeNode *p, int division, int chain);
146 int TiProbs_Fels (TreeNode *p, int division, int chain);
147 int TiProbs_Gen (TreeNode *p, int division, int chain);
149 int TiProbs_Hky (TreeNode *p, int division, int chain);
151 int TiProbs_Std (TreeNode *p, int division, int chain);
[all …]
/dports/lang/mono/mono-5.10.1.57/mcs/class/referencesource/System.Data.Entity/System/Data/Common/CommandTrees/Internal/
H A DExpressionPrinter.cs82 TreeNode typeNode = new TreeNode("ResultType"); in Print()
189 TreeNode queryNode = new TreeNode("Query"); in Print()
259 TreeNode funcInfo = new TreeNode(); in VisitFunction()
418 TreeNode retInfo = new TreeNode(); in VisitGroupBinding()
484 TreeNode retInfo = new TreeNode(); in Visit()
517 TreeNode retInfo = new TreeNode(); in Visit()
524 TreeNode retInfo = new TreeNode(); in Visit()
537 TreeNode lambdaInfo = new TreeNode(); in Visit()
581 TreeNode retInfo = new TreeNode("."); in Visit()
712 TreeNode retInfo = new TreeNode(); in Visit()
[all …]
/dports/databases/arrow/apache-arrow-6.0.1/java/gandiva/src/main/java/org/apache/arrow/gandiva/expression/
H A DTreeBuilder.java109 public static TreeNode makeIf(TreeNode condition, in makeIf()
122 public static TreeNode makeAnd(List<TreeNode> nodes) { in makeAnd()
132 public static TreeNode makeOr(List<TreeNode> nodes) { in makeOr()
159 List<TreeNode> children = new ArrayList<TreeNode>(inFields.size()); in makeExpression()
196 public static TreeNode makeInExpressionInt32(TreeNode resultNode, in makeInExpressionInt32()
201 public static TreeNode makeInExpressionBigInt(TreeNode resultNode, in makeInExpressionBigInt()
206 public static TreeNode makeInExpressionDecimal(TreeNode resultNode, in makeInExpressionDecimal()
211 public static TreeNode makeInExpressionFloat(TreeNode resultNode, in makeInExpressionFloat()
216 public static TreeNode makeInExpressionDouble(TreeNode resultNode, in makeInExpressionDouble()
221 public static TreeNode makeInExpressionString(TreeNode resultNode, in makeInExpressionString()
[all …]
/dports/graphics/dilay/dilay-1.9.0/lib/src/
H A Dtree.hpp12 template <typename T> class TreeNode class
15 TreeNode (const T& d, TreeNode* p = nullptr) in TreeNode() function in TreeNode
21 TreeNode (T&& d, TreeNode* p = nullptr) in TreeNode() function in TreeNode
27 TreeNode (const TreeNode& o) in TreeNode() function in TreeNode
56 TreeNode& addChild (const TreeNode& node) in addChild()
107 TreeNode& lastChild () in lastChild()
145 TreeNode* _parent;
146 std::list<TreeNode> _children;
154 TreeNode<T>& root () in root()
176 const std::function<void(const TreeNode<T>&, TreeNode<T>&)> go = [&go](const auto& child, in rebalance()
[all …]
/dports/www/grafana8/grafana-8.3.6/vendor/github.com/apache/arrow/java/gandiva/src/main/java/org/apache/arrow/gandiva/expression/
H A DTreeBuilder.java71 public static TreeNode makeNull(ArrowType type) { in makeNull()
81 public static TreeNode makeField(Field field) { in makeField()
108 public static TreeNode makeIf(TreeNode condition, in makeIf()
109 TreeNode thenNode, in makeIf()
121 public static TreeNode makeAnd(List<TreeNode> nodes) { in makeAnd()
131 public static TreeNode makeOr(List<TreeNode> nodes) { in makeOr()
158 List<TreeNode> children = new ArrayList<TreeNode>(inFields.size()); in makeExpression()
195 public static TreeNode makeInExpressionInt32(TreeNode resultNode, in makeInExpressionInt32()
200 public static TreeNode makeInExpressionBigInt(TreeNode resultNode, in makeInExpressionBigInt()
205 public static TreeNode makeInExpressionString(TreeNode resultNode, in makeInExpressionString()
[all …]
/dports/lang/gcc6-aux/gcc-6-20180516/libjava/classpath/javax/swing/tree/
H A DDefaultMutableTreeNode.java484 ArrayList<TreeNode> list = new ArrayList<TreeNode>(); in getSharedAncestor()
603 protected TreeNode[] getPathToRoot(TreeNode node, int depth) in getPathToRoot()
774 Vector<TreeNode> nodes = new Vector<TreeNode>(); in pathFromAncestorEnumeration()
842 public TreeNode getChildAfter(TreeNode node) in getChildAfter()
867 public TreeNode getChildBefore(TreeNode node) in getChildBefore()
1049 TreeNode current = (TreeNode) e.nextElement(); in getLeafCount()
1064 LinkedList<TreeNode> queue = new LinkedList<TreeNode>();
1098 TreeNode next;
1132 private TreeNode traverse(Enumeration<TreeNode> children) in traverse()
1166 Stack<TreeNode> nodes = new Stack<TreeNode>();
[all …]
/dports/lang/gnat_util/gcc-6-20180516/libjava/classpath/javax/swing/tree/
H A DDefaultMutableTreeNode.java484 ArrayList<TreeNode> list = new ArrayList<TreeNode>(); in getSharedAncestor()
603 protected TreeNode[] getPathToRoot(TreeNode node, int depth) in getPathToRoot()
774 Vector<TreeNode> nodes = new Vector<TreeNode>(); in pathFromAncestorEnumeration()
842 public TreeNode getChildAfter(TreeNode node) in getChildAfter()
867 public TreeNode getChildBefore(TreeNode node) in getChildBefore()
1049 TreeNode current = (TreeNode) e.nextElement(); in getLeafCount()
1064 LinkedList<TreeNode> queue = new LinkedList<TreeNode>();
1098 TreeNode next;
1132 private TreeNode traverse(Enumeration<TreeNode> children) in traverse()
1166 Stack<TreeNode> nodes = new Stack<TreeNode>();
[all …]
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libjava/classpath/javax/swing/tree/
H A DDefaultMutableTreeNode.java484 ArrayList<TreeNode> list = new ArrayList<TreeNode>(); in getSharedAncestor()
603 protected TreeNode[] getPathToRoot(TreeNode node, int depth) in getPathToRoot()
774 Vector<TreeNode> nodes = new Vector<TreeNode>(); in pathFromAncestorEnumeration()
842 public TreeNode getChildAfter(TreeNode node) in getChildAfter()
867 public TreeNode getChildBefore(TreeNode node) in getChildBefore()
1049 TreeNode current = (TreeNode) e.nextElement(); in getLeafCount()
1064 LinkedList<TreeNode> queue = new LinkedList<TreeNode>();
1098 TreeNode next;
1132 private TreeNode traverse(Enumeration<TreeNode> children) in traverse()
1166 Stack<TreeNode> nodes = new Stack<TreeNode>();
[all …]
/dports/devel/mingw32-gcc/gcc-4.8.1/libjava/classpath/javax/swing/tree/
H A DDefaultMutableTreeNode.java484 ArrayList<TreeNode> list = new ArrayList<TreeNode>(); in getSharedAncestor()
603 protected TreeNode[] getPathToRoot(TreeNode node, int depth) in getPathToRoot()
774 Vector<TreeNode> nodes = new Vector<TreeNode>(); in pathFromAncestorEnumeration()
842 public TreeNode getChildAfter(TreeNode node) in getChildAfter()
867 public TreeNode getChildBefore(TreeNode node) in getChildBefore()
1049 TreeNode current = (TreeNode) e.nextElement(); in getLeafCount()
1064 LinkedList<TreeNode> queue = new LinkedList<TreeNode>();
1098 TreeNode next;
1132 private TreeNode traverse(Enumeration<TreeNode> children) in traverse()
1166 Stack<TreeNode> nodes = new Stack<TreeNode>();
[all …]
/dports/lang/gcc48/gcc-4.8.5/libjava/classpath/javax/swing/tree/
H A DDefaultMutableTreeNode.java484 ArrayList<TreeNode> list = new ArrayList<TreeNode>(); in getSharedAncestor()
603 protected TreeNode[] getPathToRoot(TreeNode node, int depth) in getPathToRoot()
774 Vector<TreeNode> nodes = new Vector<TreeNode>(); in pathFromAncestorEnumeration()
842 public TreeNode getChildAfter(TreeNode node) in getChildAfter()
867 public TreeNode getChildBefore(TreeNode node) in getChildBefore()
1049 TreeNode current = (TreeNode) e.nextElement(); in getLeafCount()
1064 LinkedList<TreeNode> queue = new LinkedList<TreeNode>();
1098 TreeNode next;
1132 private TreeNode traverse(Enumeration<TreeNode> children) in traverse()
1166 Stack<TreeNode> nodes = new Stack<TreeNode>();
[all …]
/dports/biology/clustalw/clustalw-2.1/src/tree/
H A DTree.h33 void createTree(TreeNode* ptree, TreeNode* parent, ifstream* file);
34 void createNode(TreeNode* pptr, TreeNode* parent);
35 TreeNode* insertNode(TreeNode* pptr);
37 TreeNode* reRoot(TreeNode* ptree, int nseqs);
38 TreeNode* insertRoot(TreeNode* p, float diff);
47 TreeNode* avail();
56 TreeNode** lptr;
57 TreeNode** olptr;
58 TreeNode** nptr;
59 TreeNode** ptrs;
[all …]
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.ui/tests/org.eclipse.jface.tests/src/org/eclipse/jface/tests/viewers/
H A DBug205700TreeViewerTest.java36 private TreeNode rootNode;
38 private final TreeNode child1 = new TreeNode("Child1");
40 private final TreeNode child5 = new TreeNode("Child5");
42 private final TreeNode child10 = new TreeNode("Child10");
66 rootNode.add(new TreeNode("Child2")); in testAddWithoutSorter()
130 rootNode = new TreeNode("Root"); in createInput()
139 private class TreeNode { class in Bug205700TreeViewerTest
143 private TreeNode parent = null;
147 public TreeNode(String name) { in TreeNode() method in Bug205700TreeViewerTest.TreeNode
161 public TreeNode getParent() { in getParent()
[all …]
/dports/lang/mono/mono-5.10.1.57/mcs/class/System.Windows.Forms/System.Windows.Forms/
H A DTreeNodeCollection.cs117 TreeNode res = new TreeNode (text); in Add()
153 TreeNode node = new TreeNode (text); in Add()
260 TreeNode node = new TreeNode (text); in Insert()
283 TreeNode node = new TreeNode (text); in Insert()
291 TreeNode node = new TreeNode (text); in Insert()
300 TreeNode node = new TreeNode (text); in Insert()
317 TreeNode node = new TreeNode (text); in Insert()
404 private TreeNode GetPrevNode (TreeNode node) in GetPrevNode()
525 TreeNode [] nn = new TreeNode [len]; in Shrink()
602 TreeNode l = (TreeNode) x; in Compare()
[all …]
/dports/devel/php-ice37/ice-3.7.2/java/src/IceGridGUI/src/main/java/com/zeroc/IceGridGUI/
H A DLiveActions.java40 public boolean[] setTarget(TreeNode target) in setTarget()
47 availableActions = new boolean[TreeNode.ACTION_COUNT]; in setTarget()
103 _array[TreeNode.SIGHUP] = new SendSignal("SIGHUP"); in LiveActions()
104 _array[TreeNode.SIGINT] = new SendSignal("SIGINT"); in LiveActions()
105 _array[TreeNode.SIGQUIT] = new SendSignal("SIGQUIT"); in LiveActions()
106 _array[TreeNode.SIGKILL] = new SendSignal("SIGKILL"); in LiveActions()
107 _array[TreeNode.SIGUSR1] = new SendSignal("SIGUSR1"); in LiveActions()
108 _array[TreeNode.SIGUSR2] = new SendSignal("SIGUSR2"); in LiveActions()
109 _array[TreeNode.SIGTERM] = new SendSignal("SIGTERM"); in LiveActions()
243 private TreeNode _target;
[all …]
/dports/devel/ice37/ice-3.7.2/java/src/IceGridGUI/src/main/java/com/zeroc/IceGridGUI/
H A DLiveActions.java40 public boolean[] setTarget(TreeNode target) in setTarget()
47 availableActions = new boolean[TreeNode.ACTION_COUNT]; in setTarget()
103 _array[TreeNode.SIGHUP] = new SendSignal("SIGHUP"); in LiveActions()
104 _array[TreeNode.SIGINT] = new SendSignal("SIGINT"); in LiveActions()
105 _array[TreeNode.SIGQUIT] = new SendSignal("SIGQUIT"); in LiveActions()
106 _array[TreeNode.SIGKILL] = new SendSignal("SIGKILL"); in LiveActions()
107 _array[TreeNode.SIGUSR1] = new SendSignal("SIGUSR1"); in LiveActions()
108 _array[TreeNode.SIGUSR2] = new SendSignal("SIGUSR2"); in LiveActions()
109 _array[TreeNode.SIGTERM] = new SendSignal("SIGTERM"); in LiveActions()
243 private TreeNode _target;
[all …]
/dports/devel/py-ice37/ice-3.7.2/java/src/IceGridGUI/src/main/java/com/zeroc/IceGridGUI/
H A DLiveActions.java40 public boolean[] setTarget(TreeNode target) in setTarget()
47 availableActions = new boolean[TreeNode.ACTION_COUNT]; in setTarget()
103 _array[TreeNode.SIGHUP] = new SendSignal("SIGHUP"); in LiveActions()
104 _array[TreeNode.SIGINT] = new SendSignal("SIGINT"); in LiveActions()
105 _array[TreeNode.SIGQUIT] = new SendSignal("SIGQUIT"); in LiveActions()
106 _array[TreeNode.SIGKILL] = new SendSignal("SIGKILL"); in LiveActions()
107 _array[TreeNode.SIGUSR1] = new SendSignal("SIGUSR1"); in LiveActions()
108 _array[TreeNode.SIGUSR2] = new SendSignal("SIGUSR2"); in LiveActions()
109 _array[TreeNode.SIGTERM] = new SendSignal("SIGTERM"); in LiveActions()
243 private TreeNode _target;
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/apache/arrow/java/gandiva/src/main/java/org/apache/arrow/gandiva/expression/
H A DTreeBuilder.java40 public static TreeNode makeLiteral(Float floatConstant) { in makeLiteral()
52 public static TreeNode makeLiteral(Long longConstant) { in makeLiteral()
71 public static TreeNode makeNull(ArrowType type) { in makeNull()
81 public static TreeNode makeField(Field field) { in makeField()
93 public static TreeNode makeFunction(String function, in makeFunction()
108 public static TreeNode makeIf(TreeNode condition, in makeIf()
109 TreeNode thenNode, in makeIf()
110 TreeNode elseNode, in makeIf()
121 public static TreeNode makeAnd(List<TreeNode> nodes) { in makeAnd()
131 public static TreeNode makeOr(List<TreeNode> nodes) { in makeOr()
[all …]
/dports/java/netbeans/netbeans/webcommon/typescript-lsp/node_modules/vscode-textbuffer/lib/
H A DpieceTreeBase.d.ts3 import { TreeNode } from './rbTreeBase';
23 node: TreeNode;
57 root: TreeNode;
95 deleteNodes(nodes: TreeNode[]): void;
112 offsetOfNode(node: TreeNode): number;
115 endWithCR(val: string | TreeNode): boolean;
118 fixCRLF(prev: TreeNode, next: TreeNode): void;
120 iterate(node: TreeNode, callback: (node: TreeNode) => boolean): boolean;
121 getNodeContent(node: TreeNode): any;
130 rbInsertRight(node: TreeNode | null, p: Piece): TreeNode;
[all …]
/dports/lang/mono/mono-5.10.1.57/mcs/class/System.Windows.Forms/Test/System.Windows.Forms/
H A DTreeNodeTest.cs17 TreeNode tn = new TreeNode (); in EmptyCtorTest()
34 TreeNode tn = new TreeNode ("label1"); in CtorTest()
49 … TreeNode tn = new TreeNode ("a1", new TreeNode[] { new TreeNode ("aa1"), new TreeNode ("aa2") } ); in CtorTest2()
87 TreeNode tn_1 = new TreeNode ("1"); in Traverse()
88 TreeNode tn_2 = new TreeNode ("2"); in Traverse()
89 TreeNode tn_3 = new TreeNode ("3"); in Traverse()
109 TreeNode tn_1 = new TreeNode (); in ExpandCollapseLeafTest()
154 TreeNode orig = new TreeNode ("text", 2, 3, new TreeNode [] { new TreeNode ("child", 22, 33) }); in CloneTest()
176 TreeNode orig = new TreeNode (); in TestTreeNodeClone()
283 TreeNode tn = new TreeNode (); in PropertyName()
[all …]

12345678910>>...93