Lines Matching refs:dependencies
1667 * Builds a sorted list of views. The sorting order depends on the dependencies
1691 final SparseArray<Node> dependencies = dependent.dependencies;
1693 dependencies.remove(key);
1694 if (dependencies.size() == 0) {
1701 throw new IllegalStateException("Circular dependencies cannot exist"
1711 * dependencies
1721 // all dependents and dependencies before running the algorithm
1725 node.dependencies.clear();
1728 // Builds up the dependents and dependencies for each node of the graph
1737 // dependencies for a specific set of rules
1743 // Skip unknowns and self dependencies
1750 node.dependencies.put(rule, dependency);
1758 // Finds all the roots in the graph: all nodes with no dependencies
1761 if (node.dependencies.size() == 0) roots.addLast(node);
1768 * A node in the dependency graph. A node is a view, its list of dependencies
1787 * The list of dependencies for this node.
1789 final SparseArray<Node> dependencies = new SparseArray<Node>();
1812 dependencies.clear();