| /external/clang/bindings/python/tests/cindex/ |
| util.py | 42 children = []
44 children = source.get_children()
47 children = source.cursor.get_children()
49 for cursor in children:
53 # Recurse into children.
70 children = []
72 children = source.get_children()
75 children = source.cursor.get_children()
77 for cursor in children:
81 # Recurse into children
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/manifest/descriptors/ |
| ManifestElementDescriptor.java | 41 * @param children The list of allowed children. Can be null or empty.
49 ElementDescriptor[] children,
51 super(xml_name, ui_name, tooltip, sdk_url, attributes, children, mandatory);
62 * @param children The list of allowed children. Can be null or empty.
70 ElementDescriptor[] children,
72 super(xml_name, ui_name, tooltip, sdk_url, attributes, children, mandatory);
83 * @param children The list of allowed children. Can be null or empty
[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...] |
| /cts/tests/tests/view/src/android/view/animation/cts/ |
| AnimationSetTest.java | 78 List<Animation> children = animationSet.getAnimations(); local
79 assertEquals(SHORT_CHILD_DURATION, children.get(0).getDuration());
80 assertEquals(MEDIUM_CHILD_DURATION, children.get(1).getDuration());
81 assertEquals(LONG_CHILD_DURATION, children.get(2).getDuration());
87 children = animationSet.getAnimations();
88 assertEquals(ANIMATIONSET_DURATION, children.get(0).getDuration());
89 assertEquals(ANIMATIONSET_DURATION, children.get(1).getDuration());
90 assertEquals(ANIMATIONSET_DURATION, children.get(2).getDuration());
115 List<Animation> children = animationSet.getAnimations(); local
116 children.get(0).setFillAfter(true)
132 List<Animation> children = animationSet.getAnimations(); local
153 final List<Animation> children = animationSet.getAnimations(); local
176 final List<Animation> children = animationSet.getAnimations(); local
193 final List<Animation> children = animationSet.getAnimations(); local
203 List<Animation> children = animationSet.getAnimations(); local
222 List<Animation> children = animationSet.getAnimations(); local
239 List<Animation> children = animationSet.getAnimations(); local
266 List<Animation> children = animationSet.getAnimations(); local
307 final List<Animation> children = animationSet.getAnimations(); local
337 final List<Animation> children = animationSet.getAnimations(); local
377 final List<Animation> children = animationSet.getAnimations(); local
[all...] |
| /external/chromium_org/tools/telemetry/telemetry/core/platform/ |
| ps_util.py | 13 pid: The pid for which to get children.
28 children = child_dict[parent]
29 queue.extend(children)
30 child_ids.extend(children)
|
| /external/chromium_org/ui/events/ |
| event_target_iterator.h | 27 explicit EventTargetIteratorImpl(const std::vector<T*>& children)
28 : begin_(children.rbegin()),
29 end_(children.rend()) {
|
| /libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
| LeafNodeImpl.java | 31 * This class represents a Node that has a parent Node, but no children.
46 if (parent == null || index + 1 >= parent.children.size()) {
50 return parent.children.get(index + 1);
62 return parent.children.get(index - 1);
|
| /external/chromium_org/third_party/WebKit/Source/core/editing/ |
| RemoveNodePreservingChildrenCommand.cpp | 44 Vector<RefPtr<Node> > children; local
46 children.append(child);
48 size_t size = children.size();
50 RefPtr<Node> child = children[i].release();
|
| ReplaceNodeWithSpanCommand.cpp | 57 NodeVector children; local
58 getChildNodes(nodeToReplace, children);
59 for (size_t i = 0; i < children.size(); ++i)
60 newNode->appendChild(children[i]);
|
| MergeIdenticalElementsCommand.cpp | 52 Vector<RefPtr<Node> > children; local
54 children.append(child);
56 size_t size = children.size();
58 m_element2->insertBefore(children[i].release(), m_atChild.get(), IGNORE_EXCEPTION);
80 Vector<RefPtr<Node> > children;
82 children.append(child);
84 size_t size = children.size();
86 m_element1->appendChild(children[i].release(), exceptionState);
|
| SplitElementCommand.cpp | 52 Vector<RefPtr<Node> > children;
54 children.append(node);
68 size_t size = children.size();
70 m_element1->appendChild(children[i], exceptionState);
85 Vector<RefPtr<Node> > children;
87 children.append(node);
91 size_t size = children.size();
93 m_element2->insertBefore(children[i].get(), refChild.get(), IGNORE_EXCEPTION);
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderTableRow.h | 39 RenderObject* firstChild() const { ASSERT(children() == virtualChildren()); return children()->firstChild(); }
40 RenderObject* lastChild() const { ASSERT(children() == virtualChildren()); return children()->lastChild(); }
42 const RenderObjectChildList* children() const { return &m_children; } function in class:WebCore::FINAL
43 RenderObjectChildList* children() { return &m_children; } function in class:WebCore::FINAL
92 virtual RenderObjectChildList* virtualChildren() { return children(); }
93 virtual const RenderObjectChildList* virtualChildren() const { return children(); }
|
| /external/chromium_org/tools/telemetry/telemetry/core/timeline/ |
| inspector_importer.py | 40 if x in ('startTime', 'endTime', 'children'):
53 for child in raw_inspector_event.get('children', []):
|
| /external/chromium_org/ui/accessibility/ |
| ax_node.cc | 26 void AXNode::SwapChildren(std::vector<AXNode*>& children) {
27 children.swap(children_);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/ |
| btm_utils.py | 24 self.children = []
42 if len(node.alternatives) == len(node.children):
56 if len(node.group) == len(node.children):
98 for child in self.children:
101 if not self.children:
116 node = node.children[0]
120 if len(node.children) <= 2:
122 new_node = reduce_tree(node.children[0], parent)
126 #skip odd children('|' tokens)
127 for child in node.children
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/ |
| btm_utils.py | 24 self.children = []
42 if len(node.alternatives) == len(node.children):
56 if len(node.group) == len(node.children):
98 for child in self.children:
101 if not self.children:
116 node = node.children[0]
120 if len(node.children) <= 2:
122 new_node = reduce_tree(node.children[0], parent)
126 #skip odd children('|' tokens)
127 for child in node.children
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/descriptors/ |
| DocumentDescriptor.java | 28 * It has a children list which represent all the possible roots of the document.
36 * Constructs a new {@link DocumentDescriptor} based on its XML name and children list.
44 * @param children The list of allowed children. Can be null or empty.
46 public DocumentDescriptor(String xml_name, ElementDescriptor[] children) {
47 super(xml_name, children, Mandatory.MANDATORY);
|
| /external/junit/src/org/junit/runners/model/ |
| RunnerBuilder.java | 75 * {@code children}. Care is taken to avoid infinite recursion:
79 public List<Runner> runners(Class<?> parent, Class<?>[] children)
84 return runners(children);
90 public List<Runner> runners(Class<?> parent, List<Class<?>> children)
92 return runners(parent, children.toArray(new Class<?>[0]));
95 private List<Runner> runners(Class<?>[] children) {
97 for (Class<?> each : children) {
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| ProfileDataGridTree.js | 151 // If the grid node is collapsed, then don't sort children (save operation for later).
154 if (gridNode.children.length)
161 var children = gridNode.children;
162 var childCount = children.length;
165 children.sort(comparator);
168 children[childIndex]._recalculateSiblings(childIndex);
170 gridNodeGroups.push(children);
253 this._savedChildren = this.children.slice();
268 var children = this._savedChildren
[all...] |
| /external/chromium_org/media/mp4/ |
| box_reader.h | 108 // Read exactly one child box from the set of children. The type of the child
118 std::vector<T>* children) WARN_UNUSED_RESULT;
120 // Read any number of children. False means error.
122 std::vector<T>* children) WARN_UNUSED_RESULT;
124 // Read all children, regardless of FourCC. This is used from exactly one box,
128 std::vector<T>* children) WARN_UNUSED_RESULT;
165 template<typename T> bool BoxReader::ReadChildren(std::vector<T>* children) {
166 RCHECK(MaybeReadChildren(children) && !children->empty());
171 bool BoxReader::MaybeReadChildren(std::vector<T>* children) {
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/src/org/eclipse/test/internal/performance/results/db/ |
| AbstractResults.java | 24 * Each results gives access to specific children depending on model.
41 List children; field in class:AbstractResults
47 this.children = new ArrayList();
53 this.children = new ArrayList();
63 int size = this.children.size();
65 Object results = this.children.get(i);
67 this.children.add(i, child);
72 this.children.add(child);
105 * Return an array built on the current results children list.
107 * @return An array of the children lis
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/util/ |
| ProfileData.java | 41 public ArrayList<Node> children; field in class:ProfileData.Node
82 if (node.children == null) {
83 node.children = new ArrayList<Node>();
87 ArrayList<Node> children = node.children; local
89 for (j = 0; j < children.size(); j++) {
90 if (children.get(j).id == id) break;
92 if (j == children.size()) {
93 children.add(new Node(node, id));
96 node = children.get(j)
145 ArrayList<Node> children = node.children; local
[all...] |
| /external/chromium_org/ui/aura/test/ |
| test_windows.cc | 65 const std::vector<T*>& children = upper->parent()->children(); local
67 std::find(children.begin(), children.end(), upper) - children.begin();
69 std::find(children.begin(), children.end(), lower) - children.begin();
83 for (Window::Windows::const_iterator i = parent->children().begin();
84 i != parent->children().end(); ++i)
[all...] |
| /external/droiddriver/src/com/google/android/droiddriver/scroll/ |
| AbstractSentinelStrategy.java | 48 protected abstract UiElement getSentinel(List<UiElement> children);
71 protected UiElement getSentinel(List<UiElement> children) {
72 return original.getSentinel(children);
82 protected UiElement getSentinel(List<UiElement> children) {
83 return children.get(0);
93 protected UiElement getSentinel(List<UiElement> children) {
94 return children.get(children.size() - 1);
105 protected UiElement getSentinel(List<UiElement> children) {
106 return children.get(1)
[all...] |
| /external/chromium_org/ui/views/corewm/ |
| transient_window_stacking_client_unittest.cc | 37 // Tests that transient children are stacked as a unit when using stack above.
48 ASSERT_EQ(8u, parent->children().size());
60 EXPECT_EQ(w11, parent->children().back());
64 // transient_children_ array is used when reinserting transient children.
67 EXPECT_EQ(w22, parent->children().back());
71 EXPECT_EQ(w11, parent->children().back());
75 EXPECT_EQ(w22, parent->children().back());
79 EXPECT_EQ(w213, parent->children().back());
83 EXPECT_EQ(w11, parent->children().back());
87 EXPECT_EQ(w11, parent->children().back())
[all...] |
