Returns a <code>List</code> of the nodes children.

@return the nodes children
19795
public List children() {
        if (value == null) {
            return new NodeList();
        }
        if (value instanceof List) {
            return (List) value;
        }
        // we're probably just a String
        List result = new NodeList();
        result.add(value);
        return result;
    }
1332223
public Collection<CallTreeNode> getChildren() {
		return children == null ? Collections.<CallTreeNode>emptyList() : children.values();
	}
1236830
public ModuleItem[] children() {
        if (children == null)
            return null;

        ModuleItem[] members = new ModuleItem[children.size()];
        children.values().toArray(members);
        return members;
    }
213095
@NonNull
    public final List<Router> getChildRouters() {
        List<Router> routers = new ArrayList<>(childRouters.size());
        routers.addAll(childRouters);
        return routers;
    }
624817
public List<Entity> getAllChildrenRecursive() {
        List<Entity> result = newArrayList();
        if (isRoot()) {
            allChildrenRecursive(this, result);
        }
        return result;
    }
1222217
public List<TupleTwo<TreeNode, TreeNode>> flattenNodes()
   {
      List<TupleTwo<TreeNode, TreeNode>> list = new ArrayList<>();
      collectNodes(root, null, list);
      return list;
   }
113844
public String[] getChildNames() {
	if (children == null || children.size() == 0) return EMPTY_NAMES;
	String[] arr = new String[children.size()];
	for (int i = 0; i < arr.length; i++) {
	    arr[i] = ((RamResourceCore) children.get(i)).getName();
	}
	return arr;
    }
210255
private List<NodeData> childNodesData() throws RepositoryException, AccessDeniedException
   {
      List<NodeData> storedNodes = new ArrayList<NodeData>(dataManager.getChildNodesData(nodeData()));
      Collections.sort(storedNodes, new NodeDataOrderComparator());
      return storedNodes;
   }
1208336
public List<N> getConnectedComponents() {
        setMarkedAllNodes(false);
        ArrayList<N> roots = new ArrayList<N>();
        //for (int i=0; i<nodes.size(); i++) {
        for (N n : nodes) {
            if (!n.isMarked()) {
                roots.add(n);
                dfs(n);
            }
        }
        return roots;
    }
515079
public Set<String> getAllNodeIDs() {
		HashSet<String> ids = new HashSet<>(nodes.keySet());
		ids.add(nodeID);
		return ids;
	}
749742
def children(self):
        
        impl_nodelist = self.adapter.get_node_children(self.impl_node)
        return self._convert_nodelist(impl_nodelist)
1112144
def get_all_children(self):
        
        my_children = self.get_children_list()
        children = []
        children.extend(my_children)
        for child in my_children:
            children.extend(child.get_all_children())
        return children
259387
public Collection<String> getChildElementNames() {
        if (childElementNames == null) {
            childElementNames = Collections.unmodifiableList(Arrays.asList(parseChildElementNameList()));
        }
        return childElementNames;
    }
481174
public TreeElement[] getChildren()
    {
        if (_children == null)
            return EMPTY_TREE;
        TreeElement results[] = new TreeElement[_children.size()];
        return (TreeElement[]) _children.toArray(results);
    }
369078
public static <T> List<T> toList(final NodeList nodes) {
        final List<T> res = new ArrayList<>(nodes.getLength());
        for (int i = 0; i < nodes.getLength(); i++) {
            res.add((T) nodes.item(i));
        }
        return res;
    }
869571
public List<Node<Scope>> toList() {
        List<Node<Scope>> list = new ArrayList<Node<Scope>>();
        walk(rootElement, list);
        return list;
    }
1313682
public List<ITopicNode> getAllTopicNodes() {
        final ArrayList<ITopicNode> topicNodes = new ArrayList<ITopicNode>();
        for (final Entry<Integer, List<ITopicNode>> topicEntry : topics.entrySet()) {
            topicNodes.addAll(topicEntry.getValue());
        }

        return topicNodes;
    }