| /external/webkit/Examples/NetscapeInputMethodPlugin/NetscapeInputMethodPlugin.xcodeproj/ |
| project.pbxproj | 37 children = (
48 children = (
56 children = (
65 children = (
73 children = (
149 children = (
|
| /external/webkit/Source/WebCore/manual-tests/NPN_Invoke/NPN_Invoke.xcodeproj/ |
| project.pbxproj | 43 children = (
54 children = (
64 children = (
73 children = (
81 children = (
168 children = (
|
| /external/webkit/Tools/Scripts/ |
| sort-Xcode-project-file | 29 # Script to sort "children" and "files" sections in Xcode project.pbxproj files
119 } elsif ($line =~ /^(\s*)children = \(\s*$/) {
122 my @children;
128 push @children, $childLine;
132 print $OUT @children;
134 print $OUT sort sortChildrenByFileName @children;
|
| /frameworks/base/docs/html/guide/topics/ui/layout/ |
| linear.jd | 22 <p>{@link android.widget.LinearLayout} is a view group that aligns all children in a single
29 <p>All children of a {@link android.widget.LinearLayout} are
33 android.widget.LinearLayout LinearLayout} respects <em>margin</em>s between children
41 <h3>Equally weighted children</h3>
58 <em>weight</em> to individual children with the <a
65 assigned to children in the proportion of their declared weight. Default
|
| /packages/apps/Mms/src/com/android/mms/dom/smil/ |
| ElementParallelTimeContainerImpl.java | 88 NodeList children = getTimeChildren(); local
89 for (int i = 0; i < children.getLength(); ++i) {
90 ElementTime child = (ElementTime) children.item(i);
116 NodeList children = getTimeChildren(); local
117 int childrenLen = children.getLength();
121 ElementTime child = (ElementTime) children.item(i);
|
| /packages/experimental/LoaderApp/src/com/android/loaderapp/model/ |
| EntityDiff.java | 92 // Build lookup maps for children on both sides
96 // Walk through "before" children looking for deletes and updates
119 // Walk through remaining "after" children, which are inserts
139 final ArrayList<NamedContentValues> children = entity.getSubValues(); local
141 children.size());
142 for (NamedContentValues child : children) {
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/ |
| FrameLayoutRule.java | 163 final List<? extends INode> children) {
164 super.addLayoutActions(actions, parentNode, children);
166 actions.add(createMarginAction(parentNode, children));
167 if (children != null && children.size() > 0) {
168 actions.add(createGravityAction(children, ATTR_LAYOUT_GRAVITY));
|
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 97 /// NodeType - Node index and set of children of the node.
147 // Add in all nodes which are children of a reachable node.
160 /// ChildIterator - Visit all children of a node.
166 /// Children - Set of nodes which are children of this one and that haven't
168 NodeSubset Children;
172 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {}
177 Children(other.Children) {}
182 other.Children == this->Children
[all...] |
| /external/quake/quake/src/QW/client/ |
| pmovetst.c | 53 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
55 box_clipnodes[i].children[side^1] = i + 1;
57 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
112 num = node->children[1];
114 num = node->children[0];
151 num = node->children[1];
153 num = node->children[0];
225 return PM_RecursiveHullCheck (hull, node->children[0], p1f, p2f, p1, p2, trace);
227 return PM_RecursiveHullCheck (hull, node->children[1], p1f, p2f, p1, p2, trace);
230 return PM_RecursiveHullCheck (hull, node->children[0], p1f, p2f, p1, p2, trace);
[all...] |
| /frameworks/base/core/java/android/widget/ |
| CursorTreeAdapter.java | 34 * returned from {@link #getChildrenCursor(Cursor)} expose children within a
48 * The map of a group position to the group's children cursor helper (the
49 * cursor helper that is used to get the children for that group)
90 * Gets the cursor helper for the children in the given group.
92 * @param groupPosition The group whose children will be returned
97 * @return The cursor helper for the children of the given group
114 * Gets the Cursor for the children at the given group. Subclasses must
115 * implement this method to return the children data for a particular group.
127 * @param groupCursor The cursor pointing to the group whose children cursor
129 * @return The cursor for the children of a particular group, or null
[all...] |
| /external/v8/src/ |
| liveedit-debugger.js | 93 for (var i = 0; i < node.children.length; i++) {
94 CollectDamaged(node.children[i]);
103 CollectNew(node_list[i].children);
119 for (var i = 0; i < old_node.children.length; i++) {
120 HarvestTodo(old_node.children[i]);
240 // nested functions serialized as parent followed by serialized children.
278 // The recursive function, that goes over all children of a particular
319 for (var i = 0; i < old_node.children.length; i++) {
320 if (old_node.children[i].corresponding_node) {
322 old_node.children[i].corresponding_node.info
[all...] |
| /external/chromium/chrome/browser/resources/ |
| imageburner.html | 258 for (var i = 0; i < element.children.length; i++ ) {
259 switch(element.children[i].className) {
261 statusTextDiv = element.children[i];
264 progressBarDiv = element.children[i];
267 progressTextDiv = element.children[i];
289 for (var i = 0; i < element.children.length; i++ ) {
290 switch(element.children[i].className) {
292 statusTextDiv = element.children[i];
295 progressBarDiv = element.children[i];
298 progressTextDiv = element.children[i]
[all...] |
| /sdk/traceview/src/com/android/traceview/ |
| MethodData.java | 56 // The children of this method when this method was in a recursive call
172 // Sort the parents and children into decreasing inclusive time
183 // Add "self" time to the top of the sorted children
195 profileNode = new ProfileNode("Children", this, sortedChildren,
205 profileNode = new ProfileNode("Children while recursive", this,
237 private ProfileData[] addSelf(ProfileData[] children) {
239 if (children == null) {
242 pdata = new ProfileData[children.length + 1];
243 System.arraycopy(children, 0, pdata, 1, children.length)
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/refactoring/ |
| ChangeLayoutRefactoring.java | 188 // overlay children are replaced by their first element children
198 NodeList children = e.getChildNodes(); local
200 for (int i = 0, n = children.getLength(); i < n; i++) {
201 Node node = children.item(i);
288 // Layout attributes on children have already been removed as part of conversion
358 // conversion) and then convert all the children into <TableRow> elements.
363 NodeList children = layout.getChildNodes(); local
364 for (int i = 0, n = children.getLength(); i < n; i++) {
365 Node node = children.item(i)
410 NodeList children = layout.getChildNodes(); local
426 NodeList children = layout.getChildNodes(); local
528 NodeList children = layout.getChildNodes(); local
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| ITreeAdaptor.cs | 73 * a list of element as the children. If you want a flat tree (a list)
104 * in list children of t. Warning: if t has no children, but child does
105 * and child isNil then you can decide it is ok to move children to t via
106 * t.children = child.children; i.e., without copying the array. Just
114 * If oldRoot is a nil root, just copy or move the children to newRoot.
138 * children; i.e., you don't have to copy the list. We are
179 * If oldRoot is a nil root, just copy or move the children to newRoot.
263 * all children? Each rule that creates AST nodes will call thi
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| ITreeAdaptor.cs | 129 * a list of element as the children. If you want a flat tree (a list)
160 * in list children of t. Warning: if t has no children, but child does
161 * and child isNil then you can decide it is ok to move children to t via
162 * t.children = child.children; i.e., without copying the array. Just
170 * If oldRoot is a nil root, just copy or move the children to newRoot.
194 * children; i.e., you don't have to copy the list. We are
235 * If oldRoot is a nil root, just copy or move the children to newRoot.
283 * all children? Each rule that creates AST nodes will call thi
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreeAdaptor.java | 63 * a list of element as the children. If you want a flat tree (a list)
88 * in list children of t. Warning: if t has no children, but child does
89 * and child isNil then you can decide it is ok to move children to t via
90 * t.children = child.children; i.e., without copying the array. Just
96 /** If oldRoot is a nil root, just copy or move the children to newRoot.
118 * children; i.e., you don't have to copy the list. We are
151 * If oldRoot is a nil root, just copy or move the children to newRoot.
213 * all children? Each rule that creates AST nodes will call thi
[all...] |
| /frameworks/base/test-runner/src/android/test/ |
| TestRunner.java | 286 String[] children = getChildren(method); local
287 run(children);
376 + " children method: " + className);
541 return clazz.getMethod("children", (Class[]) null);
560 throw new RuntimeException("couldn't get children method for "
564 String[] children = getChildren(m); local
566 String[] allChildren = new String[testChildren.length + children.length];
567 System.arraycopy(children, 0, allChildren, 0, children.length);
568 System.arraycopy(testChildren, 0, allChildren, children.length, testChildren.length)
692 String[] children = getChildren(method); local
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/drawable/ |
| DrawableDescriptors.java | 162 // Level list children
168 null, /* no further children */
207 // Selector children
231 // Shape children
233 // Selector children
237 null /* children */, false /* mandatory */);
241 null /* children */, false /* mandatory */);
245 null /* children */, false /* mandatory */);
249 null /* children */, false /* mandatory */);
253 null /* children */, false /* mandatory */)
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| ANTLRBaseTreeAdaptor.h | 80 * in list children of t. Warning: if t has no children, but child does
81 * and child isNil then you can decide it is ok to move children to t via
82 * t.children = child.children; i.e., without copying the array. Just
88 /** If oldRoot is a nil root, just copy or move the children to newRoot.
110 * children; i.e., you don't have to copy the list. We are
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| ANTLRBaseTreeAdaptor.h | 80 * in list children of t. Warning: if t has no children, but child does
81 * and child isNil then you can decide it is ok to move children to t via
82 * t.children = child.children; i.e., without copying the array. Just
88 /** If oldRoot is a nil root, just copy or move the children to newRoot.
110 * children; i.e., you don't have to copy the list. We are
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| ANTLRBaseTreeAdaptor.h | 80 * in list children of t. Warning: if t has no children, but child does
81 * and child isNil then you can decide it is ok to move children to t via
82 * t.children = child.children; i.e., without copying the array. Just
88 /** If oldRoot is a nil root, just copy or move the children to newRoot.
110 * children; i.e., you don't have to copy the list. We are
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRBaseTreeAdaptor.h | 72 * in list children of t. Warning: if t has no children, but child does
73 * and child isNil then you can decide it is ok to move children to t via
74 * t.children = child.children; i.e., without copying the array. Just
80 /** If oldRoot is a nil root, just copy or move the children to newRoot.
102 * children; i.e., you don't have to copy the list. We are
|
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_node_data_unittest.cc | 69 EXPECT_EQ(0, drag_data.elements[0].children.size());
154 // Tests reading/writing a folder with children.
179 ASSERT_EQ(1, read_data.elements[0].children.size());
181 read_data.elements[0].children[0];
222 ASSERT_EQ(1, read_data.elements[0].children.size());
227 EXPECT_EQ(1, read_folder.children.size());
232 EXPECT_EQ(0, read_url.children.size());
|
| /external/chromium/chrome/browser/history/ |
| starred_url_database.h | 58 // has as its parent one of its children.
79 // Adjusts the visual order of all children of parent_folder_id with a
81 // AdjustStarredVisualOrder(10, 0, 1) increments the visual order all children
144 // Sets the visual order of all of node's children match the order in |node|.
159 // moved to be children of the bookmark bar node. Similarly all nodes
160 // in unparented_urls are moved to be children of the bookmark bar.
171 // and adds it to the end of new_parent's children.
|
