/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/ |
H A D | DebugEventRepeater.cs | 152 public virtual void AddChild(object root, object child) { argument 153 _listener.AddChild(root, child);
|
H A D | DebugTreeAdaptor.cs | 82 // walk the tree and emit create and add child events 89 /** <summary>^(A B C): emit create A, create B, add child, ...</summary> */ 94 object child = adaptor.GetChild(t, i); 95 SimulateTreeConstruction(child); 96 dbg.AddChild(t, child); 116 public virtual void AddChild(object t, object child) { argument 117 if (t == null || child == null) { 120 adaptor.AddChild(t, child); 121 dbg.AddChild(t, child); 134 public virtual void AddChild(object t, IToken child) { argument 205 SetChild(object t, int i, object child) argument [all...] |
H A D | IDebugEventListener.cs | 363 /** <summary>Make childID a child of rootID.</summary> 372 void AddChild(object root, object child); argument
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | BaseTreeAdaptor.cs | 96 // ensure new subtree root has parent/child index set 101 object child = GetChild(t, i); 102 object newSubTree = DupTree(child, t); 109 * Add a child to the tree t. If child is a flat tree (a list), make all 110 * in list children of t. Warning: if t has no children, but child does 111 * and child isNil then you can decide it is ok to move children to t via 112 * t.children = child.children; i.e., without copying the array. Just 117 public virtual void AddChild(object t, object child) { argument 118 if (t != null && child ! 243 SetChild(object t, int i, object child) argument [all...] |
H A D | ITreeAdaptor.cs | 99 /** <summary>Is tree considered a nil node used to make lists of child nodes?</summary> */ 103 * Add a child to the tree t. If child is a flat tree (a list), make all 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 108 * ASTs. Do nothing if t or child is null. 111 void AddChild(object t, object child); argument 115 * If not a nil root, make oldRoot a child of newRoot. 122 * If newRoot is a nil-rooted single child tre 286 SetChild(object t, int i, object child) argument [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/SlimParsing/Tree/ |
H A D | ITreeAdaptor`1.cs | 87 /** <summary>Is tree considered a nil node used to make lists of child nodes?</summary> */ 91 * Add a child to the tree t. If child is a flat tree (a list), make all 92 * in list children of t. Warning: if t has no children, but child does 93 * and child isNil then you can decide it is ok to move children to t via 94 * t.children = child.children; i.e., without copying the array. Just 96 * ASTs. Do nothing if t or child is null. 99 void AddChild(T t, T child); argument 103 * If not a nil root, make oldRoot a child of newRoot. 110 * If newRoot is a nil-rooted single child tre 274 SetChild(T t, int i, T child) argument [all...] |
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/debug/ |
H A D | BlankDebugEventListener.java | 73 public void addChild(Object root, Object child) {} argument
|
H A D | DebugEventHub.java | 279 public void addChild(Object root, Object child) { argument 282 listener.addChild(root, child);
|
H A D | DebugEventListener.java | 308 /** Make childID a child of rootID. 315 public void addChild(Object root, Object child); argument
|
H A D | DebugEventRepeater.java | 84 public void addChild(Object root, Object child) { listener.addChild(root, child); } argument
|
H A D | DebugTreeAdaptor.java | 78 // walk the tree and emit create and add child events 85 /** ^(A B C): emit create A, create B, add child, ...*/ 90 Object child = adaptor.getChild(t, i); 91 simulateTreeConstruction(child); 92 dbg.addChild(t, child); 112 public void addChild(Object t, Object child) { argument 113 if ( t==null || child==null ) { 116 adaptor.addChild(t,child); 117 dbg.addChild(t, child); 130 public void addChild(Object t, Token child) { argument 201 setChild(Object t, int i, Object child) argument [all...] |
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
H A D | BaseTreeAdaptor.java | 86 // ensure new subtree root has parent/child index set 91 Object child = getChild(t, i); 92 Object newSubTree = dupTree(child, t); 98 /** Add a child to the tree t. If child is a flat tree (a list), make all 99 * in list children of t. Warning: if t has no children, but child does 100 * and child isNil then you can decide it is ok to move children to t via 101 * t.children = child.children; i.e., without copying the array. Just 105 public void addChild(Object t, Object child) { argument 106 if ( t!=null && child! 225 setChild(Object t, int i, Object child) argument [all...] |
H A D | TreeAdaptor.java | 84 /** Is tree considered a nil node used to make lists of child nodes? */ 87 /** Add a child to the tree t. If child is a flat tree (a list), make all 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 92 * ASTs. Do nothing if t or child is null. 94 public void addChild(Object t, Object child); argument 97 * If not a nil root, make oldRoot a child of newRoot. 102 * If newRoot is a nil-rooted single child tre 233 setChild(Object t, int i, Object child) argument [all...] |
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
H A D | NamespaceSupport2.java | 123 // a child pointer. 470 private Context2 child = null; field in class:Context2 490 * @returns The child Namespace context object, or null if this 495 return child; 517 parent.child = this; // JJK: Doubly-linked
|
/external/chromium/base/files/ |
H A D | file_path_watcher_linux.cc | 92 // watch that fired, |child| indicates what has changed, and is relative to 97 const FilePath::StringType& child, 291 FilePath::StringType child(event->len ? event->name : FILE_PATH_LITERAL("")); 298 child, 310 const FilePath::StringType& child, 320 child, 341 bool change_on_target_path = child.empty() || child == watch_entry->subdir_; 343 // Check whether the change references |target_| or a direct child. 346 (watch_entry->subdir_ == child 308 OnFilePathChanged( InotifyReader::Watch fired_watch, const FilePath::StringType& child, bool created, bool is_directory) argument [all...] |
/external/chromium/chrome/browser/accessibility/ |
H A D | browser_accessibility.cc | 71 void BrowserAccessibility::AddChild(BrowserAccessibility* child) { argument 72 children_.push_back(child); 149 BrowserAccessibility* child = children_[i]; local 150 if (child->GetBoundsRect().Contains(point)) 151 return child->BrowserAccessibilityForPoint(point);
|
H A D | browser_accessibility_manager.cc | 17 // Start child IDs at -1 and decrement each time, because clients use 18 // child IDs of 1, 2, 3, ... to access the children of an object by 54 // Get the next child ID, and wrap around when we get near the end 330 // like the same child is reachable from two places in the same tree. 350 BrowserAccessibility* child = CreateAccessibilityTree( local 352 instance->AddChild(child);
|
/external/chromium/chrome/browser/autocomplete/ |
H A D | autocomplete_accessibility.cc | 198 VARIANT* child) { 199 if (!child) { 204 return default_accessibility_server_->accHitTest(x_left, y_top, child); 197 accHitTest(LONG x_left, LONG y_top, VARIANT* child) argument
|
/external/chromium/chrome/browser/chromeos/ |
H A D | native_dialog_window.cc | 79 views::View* child); 185 views::View* child) { 186 if (is_add && child == this) 183 ViewHierarchyChanged(bool is_add, views::View* parent, views::View* child) argument
|
/external/chromium/chrome/browser/importer/ |
H A D | profile_writer.cc | 102 const BookmarkNode* child = NULL; local 111 child = node; 115 if (child == NULL) 116 child = model->AddFolder(parent, parent->child_count(), folder_name); 117 parent = child;
|
/external/chromium/chrome/browser/sync/glue/ |
H A D | bookmark_change_processor.cc | 102 // a depth-first-search here. At each step, we consider the |index|-th child 120 // If |node| has an unprocessed child, process it next after pushing the 159 const BookmarkNode* child = parent->GetChild(index); local 160 DCHECK(child); 172 UpdateSyncNodeProperties(child, model, &sync_child); 176 associator->Associate(child, sync_child.GetId()); 226 const BookmarkNode* child = new_parent->GetChild(new_index); local 228 if (child == model->GetBookmarkBarNode() || child == model->other_node()) { 236 // Lookup the sync node that's associated with |child| [all...] |
/external/chromium/chrome/browser/ui/gtk/ |
H A D | custom_button.cc | 120 GtkWidget* child = gtk_bin_get_child(GTK_BIN(widget)); local 121 if (child) 122 gtk_container_propagate_expose(GTK_CONTAINER(widget), child, e); local
|
H A D | gtk_chrome_shrinkable_hbox.cc | 25 // Maximum child width when |homogeneous| is TRUE. 29 void CountVisibleChildren(GtkWidget* child, gpointer userdata) { argument 30 if (GTK_WIDGET_VISIBLE(child)) 34 void SumChildrenWidthRequisition(GtkWidget* child, gpointer userdata) { argument 35 if (GTK_WIDGET_VISIBLE(child)) { 37 gtk_widget_get_child_requisition(child, &req); 42 void ShowInvisibleChildren(GtkWidget* child, gpointer userdata) { argument 43 if (!GTK_WIDGET_VISIBLE(child)) { 44 gtk_widget_show(child); 49 void ChildSizeAllocate(GtkWidget* child, gpointe argument 257 gtk_chrome_shrinkable_hbox_pack_start(GtkChromeShrinkableHBox* box, GtkWidget* child, guint padding) argument 263 gtk_box_pack_start(GTK_BOX(box), child, FALSE, FALSE, 0); local 266 gtk_chrome_shrinkable_hbox_pack_end(GtkChromeShrinkableHBox* box, GtkWidget* child, guint padding) argument 272 gtk_box_pack_end(GTK_BOX(box), child, FALSE, FALSE, 0); local [all...] |
H A D | gtk_expanded_container.cc | 26 void GetChildPosition(GtkWidget* container, GtkWidget* child, int* x, int* y) { argument 29 gtk_container_child_get_property(GTK_CONTAINER(container), child, "x", &v); local 31 gtk_container_child_get_property(GTK_CONTAINER(container), child, "y", &v); local 36 void ChildSizeAllocate(GtkWidget* child, gpointer userdata) { argument 37 if (!GTK_WIDGET_VISIBLE(child)) 50 child, &child_requisition); 56 gtk_widget_get_child_requisition(child, &child_requisition); 64 GetChildPosition(data->container, child, &x, &y); 73 gtk_widget_size_allocate(child, &child_allocation); 128 g_signal_new("child [all...] |
H A D | gtk_floating_container.cc | 32 GtkFloatingContainerChild* child = local 35 if (child->widget == widget) 36 return child; 57 GtkWidget* child, 62 GtkWidget* child, 96 "X position of child widget", 107 "Y position of child widget", 136 if (bin->child == widget) { 145 GtkFloatingContainerChild* child = local 148 if (child 185 GtkFloatingContainerChild* child = local 235 GtkFloatingContainerChild* child = local 252 gtk_floating_container_set_child_property(GtkContainer* container, GtkWidget* child, guint property_id, const GValue* value, GParamSpec* pspec) argument 277 gtk_floating_container_get_child_property(GtkContainer* container, GtkWidget* child, guint property_id, GValue* value, GParamSpec* pspec) argument [all...] |