| /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...] |
| /external/chromium_org/mojo/services/public/cpp/view_manager/ |
| view.h | 36 typedef std::vector<View*> Children;
40 // Destroys this view and all its children.
63 const Children& children() const { return children_; } function in class:mojo::View
113 Children children_;
|
| /frameworks/base/sax/java/android/sax/ |
| 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/chromium_org/ui/v2/public/ |
| view.h | 31 typedef std::vector<View*> Children;
46 // View's children.
67 const Children& children() const { return children_; } function in class:v2::View
101 Children children_;
|
| /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/chromium_org/third_party/webrtc/modules/rtp_rtcp/source/ |
| vp8_partition_aggregator.h | 43 // Create the two children for this node.
64 enum Children {
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfFile.cpp | 113 // Get the children.
114 const auto &Children = Die.getChildren();
116 // Size the DIE children if any.
117 if (!Children.empty()) {
118 assert(Abbrev.hasChildren() && "Children flag not set");
120 for (auto &Child : Children)
123 // End of children marker.
|
| DIE.h | 65 /// Children - Whether or not this node has children.
68 // are 0 and 1 for no children and children respectively.
69 bool Children;
76 DIEAbbrev(dwarf::Tag T, bool C) : Tag(T), Children(C), Data() {}
81 bool hasChildren() const { return Children; }
83 void setChildrenFlag(bool hasChild) { Children = hasChild; }
117 /// Size - Size of instance + children.
125 /// Children DIEs
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| BaseTree.cs | 41 * actually have any user data. ANTLR v3 uses a list of children approach
43 * an empty node whose children represent the list. An empty, but
49 List<ITree> children; field in class:Antlr.Runtime.Tree.BaseTree
56 * as there are no fields other than the children list, which cannot
57 * be copied as the children are not considered part of this node.
64 * Get the children internal List; note that if you directly mess with
68 public virtual IList<ITree> Children {
70 return children;
78 if (Children == null)
81 return Children.Count
[all...] |
| /external/clang/lib/Format/ |
| TokenAnnotator.h | 60 Current->Children.clear();
62 I = Node.Children.begin(),
63 E = Node.Children.end();
65 Children.push_back(new AnnotatedLine(*I));
66 Current->Children.push_back(Children.back());
74 for (unsigned i = 0, e = Children.size(); i != e; ++i) {
75 delete Children[i];
82 SmallVector<AnnotatedLine *, 0> Children;
98 /// \c True if a one of this line's children intersects with an input range
[all...] |
| UnwrappedLineParser.h | 208 SmallVector<UnwrappedLine, 0> Children;
|
| FormatToken.h | 395 SmallVector<AnnotatedLine *, 1> Children;
|
| /external/llvm/include/llvm/CodeGen/ |
| LexicalScopes.h | 61 SmallVectorImpl<LexicalScope *> &getChildren() { return Children; }
65 void addChild(LexicalScope *S) { Children.push_back(S); }
123 SmallVector<LexicalScope *, 4> Children; // Scopes defined in scope.
|
| /external/llvm/lib/CodeGen/ |
| LexicalScopes.cpp | 240 const SmallVectorImpl<LexicalScope *> &Children = WS->getChildren();
242 for (SmallVectorImpl<LexicalScope *>::const_iterator SI = Children.begin(),
243 SE = Children.end();
345 if (!Children.empty())
346 err << std::string(Indent + 2, ' ') << "Children ...\n";
347 for (unsigned i = 0, e = Children.size(); i != e; ++i)
348 if (Children[i] != this)
349 Children[i]->dump(Indent + 2);
|
| MachineCSE.cpp | 606 /// dominator tree node if its a leaf or all of its children are done. Walk
639 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren();
640 unsigned NumChildren = Children.size();
643 MachineDomTreeNode *Child = Children[i];
|
| LiveDebugVariables.cpp | 552 const std::vector<MachineDomTreeNode*> &Children =
554 for (unsigned i = 0, e = Children.size(); i != e; ++i) {
555 MachineBasicBlock *MBB = Children[i]->getBlock();
[all...] |
| /external/llvm/lib/Target/Mips/ |
| MipsOptimizePICCall.cpp | 197 // Visit the MBB and add its children to the work list.
201 const std::vector<MachineDomTreeNode *> &Children = Node->getChildren();
202 WorkList.append(Children.begin(), Children.end());
|
| /external/llvm/lib/Transforms/Scalar/ |
| LICM.cpp | 352 // We are processing blocks in reverse dfo, so process children first.
353 const std::vector<DomTreeNode*> &Children = N->getChildren();
354 for (unsigned i = 0, e = Children.size(); i != e; ++i)
355 SinkRegion(Children[i]);
426 const std::vector<DomTreeNode*> &Children = N->getChildren();
427 for (unsigned i = 0, e = Children.size(); i != e; ++i)
428 HoistRegion(Children[i]);
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 175 SmallVector<DomTreeNode*, 8> Children(DTN->begin(), DTN->end());
176 for (SmallVectorImpl<DomTreeNode *>::iterator DI = Children.begin(),
177 DE = Children.end(); DI != DE; ++DI)
290 std::vector<DomTreeNode *> Children;
293 Children.push_back(*I);
296 for (std::vector<DomTreeNode *>::iterator I = Children.begin(),
297 E = Children.end(); I != E; ++I)
[all...] |
| CodeExtractor.cpp | 274 SmallVector<DomTreeNode*, 8> Children;
277 Children.push_back(*DI);
281 for (SmallVectorImpl<DomTreeNode *>::iterator I = Children.begin(),
282 E = Children.end(); I != E; ++I)
|
| LoopSimplify.cpp | 325 // Scan all of the loop children of L, moving them to OuterLoop if they are
696 const std::vector<DomTreeNodeBase<BasicBlock> *> &Children =
698 while (!Children.empty()) {
699 DomTreeNode *Child = Children.front();
[all...] |
| /external/llvm/include/llvm/Support/ |
| GenericDomTree.h | 66 std::vector<DomTreeNodeBase<NodeT> *> Children;
76 iterator begin() { return Children.begin(); }
77 iterator end() { return Children.end(); }
78 const_iterator begin() const { return Children.begin(); }
79 const_iterator end() const { return Children.end(); }
84 return Children;
91 Children.push_back(C);
96 return Children.size();
100 Children.clear();
125 std::find(IDom->Children.begin(), IDom->Children.end(), this)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ddk/ |
| acpiioct.h | 140 ACPI_ENUM_CHILD Children[ANYSIZE_ARRAY];
|
| /external/chromium_org/tools/gyp/pylib/gyp/ |
| xcodeproj_file.py | 34 children of this property. The objects dictionary is keyed by unique 96-bit
445 for child in self.Children():
475 def Children(self):
476 """Returns a list of all of this object's owned (strong) children."""
478 children = []
483 children.append(self._properties[property])
485 children.extend(self._properties[property])
486 return children
493 children = self.Children()
[all...] |
