Lines Matching defs:dependencies
1463 * Builds a sorted list of views. The sorting order depends on the dependencies
1485 final SparseArray<Node> dependencies = dependent.dependencies;
1487 dependencies.remove(key);
1488 if (dependencies.size() == 0) {
1495 throw new IllegalStateException("Circular dependencies cannot exist"
1505 * dependencies
1515 // all dependents and dependencies before running the algorithm
1519 node.dependencies.clear();
1522 // Builds up the dependents and dependencies for each node of the graph
1531 // dependencies for a specific set of rules
1537 // Skip unknowns and self dependencies
1544 node.dependencies.put(rule, dependency);
1552 // Finds all the roots in the graph: all nodes with no dependencies
1555 if (node.dependencies.size() == 0) roots.addLast(node);
1617 * A node in the dependency graph. A node is a view, its list of dependencies
1635 * The list of dependencies for this node.
1637 final SparseArray<Node> dependencies = new SparseArray<Node>();
1688 dependencies.clear();