Lines Matching refs:children
84 /// a list of element as the children. If you want a flat tree (a list)
115 /// in list children of t.
119 /// Warning: if t has no children, but child does and child isNil then you
120 /// can decide it is ok to move children to t via t.children = child.children;
128 /// if it's not ok to move children to t with a simple assignment.
134 /// If oldRoot is a nil root, just copy or move the children to newRoot.
158 /// children; i.e., you don't have to copy the list. We are
204 /// If oldRoot is a nil root, just copy or move the children to newRoot.
264 /// all children?
269 /// still usually have a nil root node just to hold the children list.
293 /// <summary>Remove ith child and shift children down from right.</summary>
296 /// <summary>How many children? If 0, then this is a leaf node </summary>
321 /// be a list. Number of children may be different after this call.
376 /// be a list. Number of children may be different after this call.
458 /// <summary>Set (or reset) the parent and child index values for all children</summary>
465 /// is nil, add all children of t to this' children.
476 /// Delete children from start to stop and replace with t even if t is
477 /// a list (nil-root tree). num of children can increase or decrease.
478 /// For huge child lists, inserting children can force walking rest of
479 /// children to set their childindex; could be slow.
501 /// Indicates the node is a nil node but may still have children, meaning
517 /// and its children?
523 /// and its children?
530 /// actually have any user data. ANTLR v3 uses a list of children approach
532 /// an empty node whose children represent the list. An empty, but
553 /// Add all elements of kids list as children of this node
575 /// Get the children internal list of children. Manipulating the list
578 property Children: IList<IBaseTree> read GetChildren;
591 /// and its children?
597 /// and its children?
856 /// children; e.g., ^(type ID)+ adds ID to type and then 2nd iteration
1070 /// to replace a set of children without "losing its place".
1172 /// <summary>Override in a subclass to change the impl of children list </summary>
1179 /// as there are no fields other than the children list, which cannot
1180 /// be copied as the children are not considered part of this node.
1203 /// children. This circular reference would cause a memory leak because
2092 /// Walk upwards looking for a node with more children to walk.
2141 if ChildTree.IsNil then // t is an empty node possibly with children
2143 if Assigned(FChildren) and SameObj(FChildren, ChildTree.Children) then
2146 // just add all of childTree's children to this
2147 if Assigned(ChildTree.Children) then
2149 if Assigned(FChildren) then // must copy, this has children already
2151 for C in ChildTree.Children do
2160 // no children for this but t has children; just set pointer
2162 FChildren := ChildTree.Children;
2169 // child is not nil (don't care about children)
2172 FChildren := CreateChildrenList; // create children list on demand
2289 raise EArgumentException.Create('indexes invalid; no children in list');
2293 // normalize to a list of children to add: newChildren
2295 NewChildren := NewTree.Children
2309 J := 0; // index into new children
2323 // set children and then delete extra
2338 // fill in as many children as we can (replacingHowMany) w/o moving data
2346 // replacedSoFar has correct index for children to add
2707 // is a flat list (i.e., nil-rooted tree). All children of oldRoot
3094 // add DOWN node if t has children
3099 // and now add all its children
3103 // add UP node if t has children
4149 // check children
4211 // check children
