Lines Matching defs:children
39 * Number of children a node can have before we bother allocating a HashMap. We currently allocate
49 private Map<String, NestedMapData> children = null;
50 // Number of children
52 // First child (first sibling of children)
54 // Last child (last sibling of children)
98 // children Hashmap, initialize it now.
99 if (sym.children == null && sym.childCount >= CHILD_MAP_THRESHOLD) {
100 sym.children = new HashMap<String, NestedMapData>();
101 // Copy in existing children.
104 sym.children.put(curr.getName(), curr);
108 // If the parent node has a children map, add the new child node to it.
109 if (sym.children != null) {
110 sym.children.put(chunk, data);
118 // There were no previous children so this is the first.
132 if (parent.children != null) {
133 parent.children.remove(name);
288 * Returns children of this node.
340 // No children. Just return null.
343 if (sym.children != null) {
344 // children map exists. Look it up there.
345 return sym.children.get(name);
347 // Iterate through linked list of children and look for a name match.
593 * iterator over the children of this node.
597 * unexpected behavior if the children list is modified between when getChildren() is called and
609 * Iterator implementation for children. We do not check for concurrent modification like in other