Searched refs:roots (Results 1 – 4 of 4) sorted by relevance
33 Hashtable collectFilesInRoots(Vector roots) { in collectFilesInRoots() argument35 Enumeration e= roots.elements(); in collectFilesInRoots()
785 ArrayList<Node> roots = new ArrayList<Node>(); in sortNodes() local790 roots.add(node); in sortNodes()794 while (roots.size() > 0) { in sortNodes()795 int numRoots = roots.size(); in sortNodes()797 Node root = roots.get(i); in sortNodes()810 roots.clear(); in sortNodes()811 roots.addAll(tmpRoots); in sortNodes()
1264 final LinkedList<Node> roots = findRoots(rules); in getSortedViews() local1267 while (roots.size() > 0) { in getSortedViews()1268 final Node node = roots.removeFirst(); in getSortedViews()1280 roots.add(dependent); in getSortedViews()1340 final LinkedList<Node> roots = mRoots; in findRoots() local1341 roots.clear(); in findRoots()1346 if (node.dependencies.size() == 0) roots.add(node); in findRoots()1349 return roots; in findRoots()1359 final LinkedList<Node> roots = findRoots(rules); in log() local1360 for (Node node : roots) { in log()
183 (For example, a function in a library to compute square roots has188 root function must still compute square roots.)