| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| AntlrRuntime_BaseTreeDebugView.cs | 47 public ITree[] Children
51 if (_tree == null || _tree.Children == null)
54 ITree[] children = new ITree[_tree.Children.Count];
55 _tree.Children.CopyTo(children, 0);
56 return children;
|
| BaseTree.cs | 42 * actually have any user data. ANTLR v3 uses a list of children approach
44 * an empty node whose children represent the list. An empty, but
60 * as there are no fields other than the children list, which cannot
61 * be copied as the children are not considered part of this node.
69 * Get the children internal List; note that if you directly mess with
73 public virtual IList<ITree> Children
92 if ( Children == null )
95 return Children.Count;
174 if ( Children == null || i >= Children.Count
[all...] |
| CommonTree.cs | 94 return Children[0].CharPositionInLine;
135 return Children[0].Line;
253 if ( Children == null )
261 foreach (ITree childTree in Children)
273 if ( Children.Count > 0 )
275 ITree firstChild = Children[0];
276 ITree lastChild = Children[Children.Count - 1];
|
| ParseTree.cs | 160 for ( int i = 0; Children != null && i < Children.Count; i++ )
162 ParseTree t = (ParseTree)Children[i];
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| CommonTree.cs | 87 return Children[0].CharPositionInLine;
114 return Children[0].Line;
195 if (Children == null) {
201 for (int i = 0; i < Children.Count; i++) {
202 ((CommonTree)Children[i]).SetUnknownTokenBoundaries();
206 if (Children.Count > 0) {
207 CommonTree firstChild = (CommonTree)Children[0];
208 CommonTree lastChild = (CommonTree)Children[Children.Count - 1];
|
| ParseTree.cs | 135 for (int i = 0; Children != null && i < Children.Count; i++) {
136 ParseTree t = (ParseTree)Children[i];
|
| /external/clang/lib/Tooling/ |
| FileMatchTrie.cpp | 45 /// - If the node has a path 'p2' but no children, take the last path segment
62 if (Children.empty()) {
69 Children[Element].Path = Path;
73 Children[Element].insert(NewPath, ConsumedLength + Element.size() + 1);
87 /// - .. have children. In this case it is checked
91 /// - .. a child matching the next path segment. In this case, all children of
92 /// 'n' are an equally good match for 'p'. All children are of 'n' are found
101 if (Children.empty()) {
109 Children.find(Element);
110 if (MatchingChild != Children.end())
[all...] |
| /external/clang/lib/Rewrite/Core/ |
| DeltaTree.cpp | 31 /// former and adds children pointers. Each node knows the full delta of all
82 /// all children nodes.
123 DeltaTreeNode *Children[2*WidthFactor];
126 Children[i]->Destroy();
134 Children[0] = IR.LHS;
135 Children[1] = IR.RHS;
143 return Children[i];
147 return Children[i];
214 // the value into one of the children, and return the result.
227 if (!IN->Children[i]->DoInsertion(FileIndex, Delta, InsertRes)
[all...] |
| RewriteRope.cpp | 36 /// contains a reasonable number of pointers to children/values) allows us to
50 /// 'WidthFactor' children/values. For our use cases, this doesn't seem to
72 /// children that it has. This allows efficient skipping over entire subtrees
78 /// 'WidthFactor' elements in it (either ropepieces or children), (except
84 /// potential children) covers.
392 /// NumChildren - This holds the number of children currently active in the
393 /// Children array.
395 RopePieceBTreeNode *Children[2*WidthFactor];
401 Children[0] = LHS;
402 Children[1] = RHS
[all...] |
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 97 /// NodeType - Node index and set of children of the node.
147 // Add in all nodes which are children of a reachable node.
160 /// ChildIterator - Visit all children of a node.
166 /// Children - Set of nodes which are children of this one and that haven't
168 NodeSubset Children;
172 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {}
177 Children(other.Children) {}
182 other.Children == this->Children
[all...] |
| /external/clang/lib/Format/ |
| TokenAnnotator.h | 144 std::vector<AnnotatedToken> Children;
175 Current->Children.push_back(AnnotatedToken(*I));
176 Current->Children[0].Parent = Current;
177 Current = &Current->Children[0];
187 while (!Last->Children.empty()) {
188 Last->Children[0].Parent = Last;
189 Last = &Last->Children[0];
|
| TokenAnnotator.cpp | 57 (Tok->Children.empty() ||
58 Tok->Children[0].FormatTok.NewlinesBefore > 0);
63 if (Tok.Children.empty())
65 const AnnotatedToken *NextToken = &Tok.Children[0];
67 if (NextToken->Children.empty())
69 NextToken = &NextToken->Children[0];
156 if (LookForDecls && !CurrentToken->Children.empty()) {
158 AnnotatedToken &Next = CurrentToken->Children[0];
221 if (!CurrentToken->Children.empty() &&
222 CurrentToken->Children[0].is(tok::l_paren))
[all...] |
| Format.cpp | 85 (Tok.Children.empty() || Tok.Children[0].MustBreakBefore);
94 while (!End->Children.empty() && !End->Children[0].CanBreakBefore) {
95 End = &End->Children[0];
145 if (Tok.Children.empty() && !isTrailingComment(Tok))
514 if (State.NextToken->Children.empty())
517 State.NextToken = &State.NextToken->Children[0];
744 if (State.NextToken->Children.empty())
747 State.NextToken = &State.NextToken->Children[0]
[all...] |
| /external/llvm/lib/CodeGen/ |
| LexicalScopes.cpp | 221 const SmallVector<LexicalScope *, 4> &Children = WS->getChildren();
223 for (SmallVector<LexicalScope *, 4>::const_iterator SI = Children.begin(),
224 SE = Children.end(); SI != SE; ++SI) {
328 if (!Children.empty())
329 err << std::string(Indent + 2, ' ') << "Children ...\n";
330 for (unsigned i = 0, e = Children.size(); i != e; ++i)
331 if (Children[i] != this)
332 Children[i]->dump(Indent + 2);
|
| /external/llvm/include/llvm/CodeGen/ |
| LexicalScopes.h | 174 SmallVector<LexicalScope *, 4> &getChildren() { return Children; }
178 void addChild(LexicalScope *S) { Children.push_back(S); }
236 SmallVector<LexicalScope *, 4> Children; // Scopes defined in scope.
|
| /external/llvm/include/llvm/Analysis/ |
| Dominators.h | 67 std::vector<DomTreeNodeBase<NodeT> *> Children;
77 iterator begin() { return Children.begin(); }
78 iterator end() { return Children.end(); }
79 const_iterator begin() const { return Children.begin(); }
80 const_iterator end() const { return Children.end(); }
85 return Children;
92 Children.push_back(C);
97 return Children.size();
101 Children.clear();
126 std::find(IDom->Children.begin(), IDom->Children.end(), this)
[all...] |
| /frameworks/base/sax/java/android/sax/ |
| Element.java | 39 Children children; field in class:Element
69 + " text element listener. It cannot have children.");
72 if (children == null) {
73 children = new Children();
76 return children.getOrCreate(this, uri, localName);
158 if (children != null) {
159 throw new IllegalStateException("This element already has children."
176 * Clears flags on required children
[all...] |
| Children.java | 20 * Contains element children. Using this class instead of HashMap results in
23 class Children {
25 Child[] children = new Child[16]; field in class:Children
34 Child current = children[index];
36 // We have no children in this bucket yet.
38 children[index] = current;
69 Child current = children[index];
|
| /external/llvm/utils/TableGen/ |
| DAGISelMatcher.h | 119 /// operates on the node or its children without potential side effects or a
183 /// ScopeMatcher - This attempts to match each of its children to find the first
185 /// If none of the children match then this check fails. It never has a 'next'.
187 SmallVector<Matcher*, 4> Children;
189 ScopeMatcher(Matcher *const *children, unsigned numchildren)
190 : Matcher(Scope), Children(children, children+numchildren) {
194 unsigned getNumChildren() const { return Children.size(); }
196 Matcher *getChild(unsigned i) { return Children[i];
[all...] |
| CodeGenDAGPatterns.h | 324 std::vector<TreePatternNode*> Children;
328 : Operator(Op), Val(0), TransformFn(0), Children(Ch) {
365 unsigned getNumChildren() const { return Children.size(); }
366 TreePatternNode *getChild(unsigned N) const { return Children[N]; }
368 Children[i] = N;
371 /// hasChild - Return true if N is any of our children.
373 for (unsigned i = 0, e = Children.size(); i != e; ++i)
374 if (Children[i] == N) return true;
448 /// this node and its children in the tree. This returns true if it makes a
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.jdt.debug_3.6.1.v20100715_r361/ |
| plugin.properties | 19 descriptionSWTComposite=Children
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DIE.cpp | 61 // Emit whether it has children DIEs.
111 for (unsigned i = 0, N = Children.size(); i < N; ++i)
112 delete Children[i];
166 for (unsigned j = 0, M = Children.size(); j < M; ++j) {
167 Children[j]->print(O, 4);
|
| DIE.h | 59 /// ChildrenFlag - Dwarf children flag.
120 /// Size - Size of instance + children.
128 /// Children DIEs.
130 std::vector<DIE *> Children;
152 const std::vector<DIE *> &getChildren() const { return Children; }
177 Children.push_back(Child);
|
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 172 SmallVector<DomTreeNode*, 8> Children(DTN->begin(), DTN->end());
173 for (SmallVector<DomTreeNode*, 8>::iterator DI = Children.begin(),
174 DE = Children.end(); DI != DE; ++DI)
302 std::vector<DomTreeNode *> Children;
305 Children.push_back(*I);
308 for (std::vector<DomTreeNode *>::iterator I = Children.begin(),
309 E = Children.end(); I != E; ++I)
|
| /external/llvm/lib/Transforms/Scalar/ |
| LICM.cpp | 311 // We are processing blocks in reverse dfo, so process children first.
312 const std::vector<DomTreeNode*> &Children = N->getChildren();
313 for (unsigned i = 0, e = Children.size(); i != e; ++i)
314 SinkRegion(Children[i]);
385 const std::vector<DomTreeNode*> &Children = N->getChildren();
386 for (unsigned i = 0, e = Children.size(); i != e; ++i)
387 HoistRegion(Children[i]);
[all...] |
