| /libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
| NodeListImpl.java | 36 private List<NodeImpl> children; field in class:NodeListImpl
39 children = new ArrayList<NodeImpl>();
43 children = list;
47 children.add(node);
51 return children.size();
55 if (index >= children.size()) {
58 return children.get(index);
|
| /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/address/parser/ |
| SimpleNode.java | 7 protected Node[] children; field in class:SimpleNode
30 if (children == null) {
31 children = new Node[i + 1];
32 } else if (i >= children.length) {
34 System.arraycopy(children, 0, c, 0, children.length);
35 children = c;
37 children[i] = n;
41 return children[i];
45 return (children == null) ? 0 : children.length
[all...] |
| /external/guice/extensions/persist/test/com/google/inject/persist/jpa/ |
| JpaParentTestEntity.java | 37 private List<JpaTestEntity> children = new ArrayList<JpaTestEntity>(); field in class:JpaParentTestEntity
51 return children;
54 public void setChildren(List<JpaTestEntity> children) {
55 this.children = children;
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/fixes/ |
| fix_metaclass.py | 32 for node in parent.children:
35 elif node.type == syms.simple_stmt and node.children:
36 expr_node = node.children[0]
37 if expr_node.type == syms.expr_stmt and expr_node.children:
38 left_side = expr_node.children[0]
49 for node in cls_node.children:
55 for i, node in enumerate(cls_node.children):
63 while cls_node.children[i+1:]:
64 move_node = cls_node.children[i+1]
76 for semi_ind, node in enumerate(stmt_node.children):
[all...] |
| fix_itertools_imports.py | 16 if imports.type == syms.import_as_name or not imports.children:
17 children = [imports]
19 children = imports.children
20 for child in children[::2]:
29 name_node = child.children[0]
40 children = imports.children[:] or [imports]
42 for child in children:
48 while children and children[-1].type == token.COMMA:
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| BaseTree.java | 34 * actually have any user data. ANTLR v3 uses a list of children approach
36 * an empty node whose children represent the list. An empty, but
40 protected List children; field in class:BaseTree
46 * as there are no fields other than the children list, which cannot
47 * be copied as the children are not considered part of this node.
53 if ( children==null || i>=children.size() ) {
56 return (Tree)children.get(i);
59 /** Get the children internal List; note that if you directly mess with
63 return children;
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/fixes/ |
| fix_metaclass.py | 32 for node in parent.children:
35 elif node.type == syms.simple_stmt and node.children:
36 expr_node = node.children[0]
37 if expr_node.type == syms.expr_stmt and expr_node.children:
38 left_side = expr_node.children[0]
49 for node in cls_node.children:
55 for i, node in enumerate(cls_node.children):
63 while cls_node.children[i+1:]:
64 move_node = cls_node.children[i+1]
76 for semi_ind, node in enumerate(stmt_node.children)
[all...] |
| fix_itertools_imports.py | 16 if imports.type == syms.import_as_name or not imports.children:
17 children = [imports]
19 children = imports.children
20 for child in children[::2]:
29 name_node = child.children[0]
40 children = imports.children[:] or [imports]
42 for child in children:
48 while children and children[-1].type == token.COMMA
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/fixes/ |
| fix_metaclass.py | 32 for node in parent.children:
35 elif node.type == syms.simple_stmt and node.children:
36 expr_node = node.children[0]
37 if expr_node.type == syms.expr_stmt and expr_node.children:
38 left_side = expr_node.children[0]
49 for node in cls_node.children:
55 for i, node in enumerate(cls_node.children):
63 while cls_node.children[i+1:]:
64 move_node = cls_node.children[i+1]
76 for semi_ind, node in enumerate(stmt_node.children)
[all...] |
| fix_itertools_imports.py | 16 if imports.type == syms.import_as_name or not imports.children:
17 children = [imports]
19 children = imports.children
20 for child in children[::2]:
29 name_node = child.children[0]
40 children = imports.children[:] or [imports]
42 for child in children:
48 while children and children[-1].type == token.COMMA
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_metaclass.py | 32 for node in parent.children:
35 elif node.type == syms.simple_stmt and node.children:
36 expr_node = node.children[0]
37 if expr_node.type == syms.expr_stmt and expr_node.children:
38 left_side = expr_node.children[0]
49 for node in cls_node.children:
55 for i, node in enumerate(cls_node.children):
63 while cls_node.children[i+1:]:
64 move_node = cls_node.children[i+1]
76 for semi_ind, node in enumerate(stmt_node.children)
[all...] |
| fix_itertools_imports.py | 16 if imports.type == syms.import_as_name or not imports.children:
17 children = [imports]
19 children = imports.children
20 for child in children[::2]:
29 name_node = child.children[0]
40 children = imports.children[:] or [imports]
42 for child in children:
48 while children and children[-1].type == token.COMMA
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_metaclass.py | 32 for node in parent.children:
35 elif node.type == syms.simple_stmt and node.children:
36 expr_node = node.children[0]
37 if expr_node.type == syms.expr_stmt and expr_node.children:
38 left_side = expr_node.children[0]
49 for node in cls_node.children:
55 for i, node in enumerate(cls_node.children):
63 while cls_node.children[i+1:]:
64 move_node = cls_node.children[i+1]
76 for semi_ind, node in enumerate(stmt_node.children)
[all...] |
| fix_itertools_imports.py | 16 if imports.type == syms.import_as_name or not imports.children:
17 children = [imports]
19 children = imports.children
20 for child in children[::2]:
29 name_node = child.children[0]
40 children = imports.children[:] or [imports]
42 for child in children:
48 while children and children[-1].type == token.COMMA
[all...] |
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| BaseTree.js | 2 * actually have any user data. ANTLR v3 uses a list of children approach
4 * an empty node whose children represent the list. An empty, but
13 if ( !this.children || i>=this.children.length ) {
16 return this.children[i];
19 /** Get the children internal List; note that if you directly mess with
23 return this.children;
28 for (i = 0; this.children && i < this.children.length; i++) {
29 t = this.children[i]
[all...] |
| /external/universal-tween-engine/java/api/src/aurelienribon/tweenengine/ |
| Timeline.java | 80 * Creates a new timeline with a 'sequence' behavior. Its children will
90 * Creates a new timeline with a 'parallel' behavior. Its children will be
105 private final List<BaseTween<?>> children = new ArrayList<BaseTween<?>>(10); field in class:Timeline
123 children.clear();
145 current.children.add(tween);
158 current.children.add(timeline);
164 * overlap the preceding and following children.
171 current.children.add(Tween.mark().delay(time));
186 current.children.add(tl);
202 current.children.add(tl)
[all...] |
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/recursive/ |
| Human.java | 27 protected Set<Human> children; field in class:Human
30 children = new HashSet<Human>();
66 return children;
69 public void setChildren(Set<Human> children) {
70 this.children = children;
|
| Human2.java | 27 protected Map<Human2, String> children; field in class:Human2
30 children = new HashMap<Human2, String>();
66 return children;
69 public void setChildren(Map<Human2, String> children) {
70 this.children = children;
|
| Human3.java | 27 protected List<Human3> children; field in class:Human3
30 children = new ArrayList<Human3>();
66 return children;
69 public void setChildren(List<Human3> children) {
70 this.children = children;
|
| /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;
|
| /frameworks/base/tools/aapt2/link/ |
| XmlNamespaceRemover.cpp | 36 for (auto& child : el->children) {
38 if (child->children.empty()) {
41 child = std::move(child->children.front());
46 el->children.erase(
47 std::remove_if(el->children.begin(), el->children.end(),
51 el->children.end());
77 if (resource->root->children.empty()) {
80 resource->root = std::move(resource->root->children.front());
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| CompositeGrammarTree.java | 35 protected List<CompositeGrammarTree> children; field in class:CompositeGrammarTree
50 if ( children==null ) {
51 children = new ArrayList<CompositeGrammarTree>();
53 children.add(t);
62 for (int i = 0; r==null && children!=null && i < children.size(); i++) {
63 CompositeGrammarTree child = children.get(i);
93 for (int i = 0; n==null && children!=null && i < children.size(); i++) {
94 CompositeGrammarTree child = children.get(i)
[all...] |
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3basetree.c | 75 tree->children = NULL;
101 if (tree->children != NULL)
103 cs = tree->children->size(tree->children);
106 t = (pANTLR3_BASE_TREE) (tree->children->get(tree->children, i));
121 if ( tree->children == NULL
122 || i >= tree->children->size(tree->children))
126 return tree->children->get(tree->children, i)
[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/chromium-trace/catapult/common/py_utils/py_utils/refactor/annotated_symbol/ |
| reference.py | 25 if not nodes[0].children or nodes[0].children[0].type != token.NAME:
33 if len(nodes[i].children) != 2:
35 if (nodes[i].children[0].type != token.DOT or
36 nodes[i].children[1].type != token.NAME):
43 def __init__(self, children):
44 super(Reference, self).__init__(-1, children)
53 for child in self.children
54 for token_snippet in child.children)
60 # If we have too many children, cut the list down to size
[all...] |
