Lines Matching defs:dependencies
1755 * Builds a sorted list of views. The sorting order depends on the dependencies
1779 final SparseArray<Node> dependencies = dependent.dependencies;
1781 dependencies.remove(key);
1782 if (dependencies.size() == 0) {
1789 throw new IllegalStateException("Circular dependencies cannot exist"
1799 * dependencies
1809 // all dependents and dependencies before running the algorithm
1813 node.dependencies.clear();
1816 // Builds up the dependents and dependencies for each node of the graph
1825 // dependencies for a specific set of rules
1831 // Skip unknowns and self dependencies
1838 node.dependencies.put(rule, dependency);
1846 // Finds all the roots in the graph: all nodes with no dependencies
1849 if (node.dependencies.size() == 0) roots.addLast(node);
1856 * A node in the dependency graph. A node is a view, its list of dependencies
1875 * The list of dependencies for this node.
1877 final SparseArray<Node> dependencies = new SparseArray<Node>();
1900 dependencies.clear();