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()
796 ArrayList<Node> roots = new ArrayList<Node>(); in sortNodes() local801 roots.add(node); in sortNodes()805 while (roots.size() > 0) { in sortNodes()806 int numRoots = roots.size(); in sortNodes()808 Node root = roots.get(i); in sortNodes()821 roots.clear(); in sortNodes()822 roots.addAll(tmpRoots); in sortNodes()
1509 final ArrayDeque<Node> roots = findRoots(rules); in getSortedViews() local1513 while ((node = roots.pollLast()) != null) { in getSortedViews()1525 roots.add(dependent); in getSortedViews()1585 final ArrayDeque<Node> roots = mRoots; in findRoots() local1586 roots.clear(); in findRoots()1591 if (node.dependencies.size() == 0) roots.addLast(node); in findRoots()1594 return roots; in findRoots()1604 final ArrayDeque<Node> roots = findRoots(rules); in log() local1605 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.)