| /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 | 47 /// - If the node has a path 'p2' but no children, take the last path segment
64 if (Children.empty()) {
71 Children[Element].Path = Path;
75 Children[Element].insert(NewPath, ConsumedLength + Element.size() + 1);
89 /// - .. have children. In this case it is checked
93 /// - .. a child matching the next path segment. In this case, all children of
94 /// 'n' are an equally good match for 'p'. All children are of 'n' are found
103 if (Children.empty()) {
111 Children.find(Element);
112 if (MatchingChild != Children.end())
[all...] |
| /external/clang/lib/Rewrite/ |
| 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/clang/lib/Format/ |
| TokenAnnotator.h | 61 Current->Children.clear();
62 for (const auto &Child : Node.Children) {
63 Children.push_back(new AnnotatedLine(Child));
64 Current->Children.push_back(Children.back());
72 for (unsigned i = 0, e = Children.size(); i != e; ++i) {
73 delete Children[i];
77 Current->Children.clear();
101 SmallVector<AnnotatedLine *, 0> Children;
118 /// \c True if a one of this line's children intersects with an input range
[all...] |
| UnwrappedLineParser.h | 211 SmallVector<UnwrappedLine, 0> Children;
|
| /external/llvm/tools/llvm-pdbdump/ |
| CompilandDumper.h | 23 void start(const PDBSymbolCompiland &Symbol, bool Children);
|
| CompilandDumper.cpp | 45 void CompilandDumper::start(const PDBSymbolCompiland &Symbol, bool Children) {
52 if (!Children)
|
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 95 /// NodeType - Node index and set of children of the node.
145 // Add in all nodes which are children of a reachable node.
158 /// ChildIterator - Visit all children of a node.
164 /// Children - Set of nodes which are children of this one and that haven't
166 NodeSubset Children;
170 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {}
175 Children(other.Children) {}
180 other.Children == this->Children
[all...] |
| /external/guice/lib/build/ |
| safesax.jar | |
| /external/llvm/lib/CodeGen/ |
| LexicalScopes.cpp | 224 const SmallVectorImpl<LexicalScope *> &Children = WS->getChildren();
226 for (SmallVectorImpl<LexicalScope *>::const_iterator SI = Children.begin(),
227 SE = Children.end();
327 if (!Children.empty())
328 err << std::string(Indent + 2, ' ') << "Children ...\n";
329 for (unsigned i = 0, e = Children.size(); i != e; ++i)
330 if (Children[i] != this)
331 Children[i]->dump(Indent + 2);
|
| /external/llvm/include/llvm/CodeGen/ |
| DIE.h | 68 /// Children - Whether or not this node has children.
71 // are 0 and 1 for no children and children respectively.
72 bool Children;
79 DIEAbbrev(dwarf::Tag T, bool C) : Tag(T), Children(C), Data() {}
84 bool hasChildren() const { return Children; }
86 void setChildrenFlag(bool hasChild) { Children = hasChild; }
617 /// Size - Size of instance + children.
627 /// Children DIEs
652 child_range children() { function in class:llvm::DIE
655 const_child_range children() const { function in class:llvm::DIE
[all...] |
| LexicalScopes.h | 64 SmallVectorImpl<LexicalScope *> &getChildren() { return Children; }
68 void addChild(LexicalScope *S) { Children.push_back(S); }
126 SmallVector<LexicalScope *, 4> Children; // Scopes defined in scope.
|
| /external/llvm/include/llvm/Support/ |
| GenericDomTree.h | 72 std::vector<DomTreeNodeBase<NodeT> *> Children;
83 iterator begin() { return Children.begin(); }
84 iterator end() { return Children.end(); }
85 const_iterator begin() const { return Children.begin(); }
86 const_iterator end() const { return Children.end(); }
91 return Children;
99 Children.push_back(C.get());
103 size_t getNumChildren() const { return Children.size(); }
105 void clearAllChildren() { Children.clear(); }
129 std::find(IDom->Children.begin(), IDom->Children.end(), this)
[all...] |
| /frameworks/base/sax/java/android/sax/ |
| Element.java | 37 Children children; field in class:Element
67 + " text element listener. It cannot have children.");
70 if (children == null) {
71 children = new Children();
74 return children.getOrCreate(this, uri, localName);
156 if (children != null) {
157 throw new IllegalStateException("This element already has children."
174 * Clears flags on required children
[all...] |
| /art/compiler/debug/dwarf/ |
| debug_abbrev_writer.h | 66 uint32_t EndAbbrev(Children has_children) {
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfCompileUnit.cpp | 320 SmallVector<DIE *, 8> Children;
322 // We try to create the scope DIE first, then the children DIEs. This will
323 // avoid creating un-used children then removing them later when we find out
330 // We create children when the scope DIE is not null.
331 createScopeChildrenDIE(Scope, Children);
339 // We create children here when we know the scope DIE is not going to be
340 // null and the children will be added to the scope DIE.
341 createScopeChildrenDIE(Scope, Children, &ChildScopeCount);
347 Children.push_back(
351 // If there are only other scopes as children, put them directly in th
[all...] |
| /external/llvm/utils/TableGen/ |
| DAGISelMatcher.h | 122 /// operates on the node or its children without potential side effects or a
188 /// ScopeMatcher - This attempts to match each of its children to find the first
190 /// If none of the children match then this check fails. It never has a 'next'.
192 SmallVector<Matcher*, 4> Children;
194 ScopeMatcher(ArrayRef<Matcher *> children)
195 : Matcher(Scope), Children(children.begin(), children.end()) {
199 unsigned getNumChildren() const { return Children.size(); }
201 Matcher *getChild(unsigned i) { return Children[i];
[all...] |
| /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/webrtc/webrtc/modules/rtp_rtcp/source/ |
| vp8_partition_aggregator.h | 43 // Create the two children for this node.
64 enum Children {
|
