Lines Matching defs:dependencies
1738 * Builds a sorted list of views. The sorting order depends on the dependencies
1762 final SparseArray<Node> dependencies = dependent.dependencies;
1764 dependencies.remove(key);
1765 if (dependencies.size() == 0) {
1772 throw new IllegalStateException("Circular dependencies cannot exist"
1782 * dependencies
1792 // all dependents and dependencies before running the algorithm
1796 node.dependencies.clear();
1799 // Builds up the dependents and dependencies for each node of the graph
1808 // dependencies for a specific set of rules
1814 // Skip unknowns and self dependencies
1821 node.dependencies.put(rule, dependency);
1829 // Finds all the roots in the graph: all nodes with no dependencies
1832 if (node.dependencies.size() == 0) roots.addLast(node);
1839 * A node in the dependency graph. A node is a view, its list of dependencies
1858 * The list of dependencies for this node.
1860 final SparseArray<Node> dependencies = new SparseArray<Node>();
1883 dependencies.clear();