| /external/webkit/Tools/MiniBrowser/MiniBrowser.xcodeproj/ |
| project.pbxproj | 109 children = (
126 children = (
136 children = (
145 children = (
154 children = (
169 children = (
179 children = (
188 children = (
196 children = (
207 children =
[all...] |
| /external/libxml2/ |
| catalog.c | 133 struct _xmlCatalogEntry *children; member in struct:_xmlCatalogEntry
283 ret->children = NULL;
380 xmlCatalogEntryPtr children, next; local
385 children = catal->children;
386 while (children != NULL) {
387 next = children->next;
388 children->dealloc = 0;
389 children->children = NULL
[all...] |
| tree.c | 122 xmlNodePtr ulccur = (n)->children; \
912 cur = doc->children;
991 if (doc->children == NULL) {
992 doc->children = (xmlNodePtr) cur;
998 prev = doc->children;
1001 doc->children = (xmlNodePtr) cur;
1005 next = doc->children;
1017 doc->children = (xmlNodePtr) cur;
1097 if (cur->children != NULL) {
1098 xmlNodePtr next, c = cur->children;
[all...] |
| /development/ide/xcode/gif.xcodeproj/ |
| project.pbxproj | 45 children = (
57 children = (
69 children = (
77 children = (
84 children = (
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| ANTLRTreeAdaptor.h | 46 * a list of element as the children. If you want a flat tree (a list)
76 /** If oldRoot is a nil root, just copy or move the children to newRoot.
98 * children; i.e., you don't have to copy the list. We are
137 /** Remove ith child and shift children down from right. */
140 /** How many children? If 0, then this is a leaf node */
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| ANTLRTreeAdaptor.h | 46 * a list of element as the children. If you want a flat tree (a list)
76 /** If oldRoot is a nil root, just copy or move the children to newRoot.
98 * children; i.e., you don't have to copy the list. We are
137 /** Remove ith child and shift children down from right. */
140 /** How many children? If 0, then this is a leaf node */
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| ANTLRTreeAdaptor.h | 46 * a list of element as the children. If you want a flat tree (a list)
76 /** If oldRoot is a nil root, just copy or move the children to newRoot.
98 * children; i.e., you don't have to copy the list. We are
137 /** Remove ith child and shift children down from right. */
140 /** How many children? If 0, then this is a leaf node */
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRTreeAdaptor.h | 42 * a list of element as the children. If you want a flat tree (a list)
72 /** If oldRoot is a nil root, just copy or move the children to newRoot.
94 * children; i.e., you don't have to copy the list. We are
134 /** Remove ith child and shift children down from right. */
137 /** How many children? If 0, then this is a leaf node */
|
| /external/bluetooth/glib/glib/ |
| gnode.h | 88 GNode *children; member in struct:_GNode
111 * (i.e. it has no children)
113 #define G_NODE_IS_LEAF(node) (((GNode*) (node))->children == NULL)
276 * or has no children
279 ((GNode*) (node))->children : NULL)
|
| /external/chromium/chrome/browser/safe_browsing/ |
| malware_details.cc | 123 const std::vector<GURL>* children) {
140 if (children) {
141 for (std::vector<GURL>::const_iterator it = children->begin();
142 it != children->end(); it++) {
236 AddUrl(node.url, node.parent, node.tag_name, &(node.children));
|
| /external/chromium/chrome/browser/sync/engine/ |
| change_reorder_buffer.cc | 106 // (parent, child) ordering of values enables efficient lookup of children
159 // Step 2: Breadth-first expansion of the traversal, enumerating children in
183 // Now add the children of |next| to |to_visit|.
195 // There were ordering changes on the children of this parent, so
196 // enumerate all the children in the sibling order.
|
| /external/junit/src/org/junit/runner/ |
| Description.java | 13 * can be atomic (a single test) or compound (containing children tests). <code>Descriptions</code> are used
33 * Generally, you will add children to this <code>Description</code>.
115 * @return the receiver's children, if any
173 * @return a copy of this description, with no children (on the assumption that some of the
174 * children will be added back)
|
| /external/llvm/utils/TableGen/ |
| DAGISelMatcher.h | 121 /// operates on the node or its children without potential side effects or a
185 /// ScopeMatcher - This attempts to match each of its children to find the first
187 /// If none of the children match then this check fails. It never has a 'next'.
189 SmallVector<Matcher*, 4> Children;
191 ScopeMatcher(Matcher *const *children, unsigned numchildren)
192 : Matcher(Scope), Children(children, children+numchildren) {
196 unsigned getNumChildren() const { return Children.size(); }
198 Matcher *getChild(unsigned i) { return Children[i];
[all...] |
| /external/qemu/elff/ |
| dwarf_die.cc | 24 /* Delete all children of this object. */
106 * contain the given address, we still want to go and check the children.
168 /* First we will iterate through the list of children, since chances to
178 /* DIE has not been found among the children. Lets go deeper now. */
238 /* Dump this DIE's children. */
|
| /external/regex-re2/re2/ |
| tostring.cc | 59 // Visits re before children are processed.
60 // Appends ( if needed and passes new precedence to children.
136 // Visits re after children are processed.
138 // For regexps with children, append any unary suffixes or ).
173 // Clumsy but workable: the children all appended |
|
| /external/v8/src/ |
| global-handles.h | 79 // a list of children objects. If the parent is alive, all the children
84 Object*** children,
91 CopyWords(group->children_, children, static_cast<int>(length));
213 Object*** children,
|
| /external/webkit/Source/WebCore/inspector/front-end/ |
| WatchExpressionsSidebarPane.js | 171 var children = this.propertiesTreeOutline.children;
172 for (var i = 0; i < children.length; ++i)
173 if (children[i].property.name === WebInspector.WatchExpressionsSection.NewWatchExpression)
174 return children[i];
|
| /external/webkit/Source/WebCore/xml/ |
| XSLStyleSheetLibxslt.cpp | 161 // and any of its children. XML document disposal can corrupt memory
186 xmlNodePtr stylesheetRoot = document()->children;
188 // Top level children may include other things such as DTD nodes, we ignore those.
205 // Walk the children of the root element and look for import/include elements.
207 xmlNodePtr curr = stylesheetRoot->children;
|
| /external/wpa_supplicant_8/wpa_supplicant/dbus/ |
| dbus_new_introspect.c | 185 char **children; local
189 dbus_connection_list_registered(con, path, &children);
190 for (i = 0; children[i]; i++)
191 wpabuf_printf(xml, "<node name=\"%s\"/>", children[i]);
192 dbus_free_string_array(children);
|
| /ndk/sources/host-tools/ndk-stack/elff/ |
| dwarf_die.cc | 24 /* Delete all children of this object. */
106 * contain the given address, we still want to go and check the children.
168 /* First we will iterate through the list of children, since chances to
178 /* DIE has not been found among the children. Lets go deeper now. */
238 /* Dump this DIE's children. */
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/mock/ |
| MockXmlNode.java | 49 * Constructs a node from a given children list.
54 * @param children The children list. Can be null.
57 MockXmlNode[] children) {
61 mNodeList = new MockNodeList(children);
|
| /sdk/lint/libs/lint_checks/src/com/android/tools/lint/checks/ |
| InefficientWeightDetector.java | 114 List<Element> children = LintUtils.getChildren(element); local
120 for (Element child : children) {
150 // See if all the children are layouts
151 boolean allChildrenAreLayouts = children.size() > 0;
152 for (Element child : children) {
|
| /external/dbus/dbus/ |
| dbus-marshal-recursive-util.c | 355 DBusList *children; member in struct:TestTypeNodeContainer
789 1, /* number of times children appear as fields */
803 2, /* number of times children appear as fields */
[all...] |
| /frameworks/base/core/java/android/widget/ |
| LinearLayout.java | 36 * A Layout that arranges its children in a single column or a single row. The direction of
39 * calling {@link #setGravity(int) setGravity()} or specify that specific children
81 * Whether the children of this layout are baseline aligned. Only applicable
92 * with whether the children of this layout are baseline aligned.
410 * When true, all children with a weight will be considered having
411 * the minimum size of the largest child. If false, all children are
414 * @return True to measure children with a weight using the minimum
424 * When set to true, all children with a weight will be considered having
425 * the minimum size of the largest child. If false, all children are
430 * @param enabled True to measure children with a weight using th
[all...] |
| /external/clang/lib/Rewrite/ |
| 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.
395 /// NumChildren - This holds the number of children currently active in the
396 /// Children array.
398 RopePieceBTreeNode *Children[2*WidthFactor];
404 Children[0] = LHS;
405 Children[1] = RHS
[all...] |
