Lines Matching refs:Node
1012 DependencyGraph.Node node = mGraph.mKeyNodes.get(id);
1620 private ArrayList<Node> mNodes = new ArrayList<Node>();
1626 private SparseArray<Node> mKeyNodes = new SparseArray<Node>();
1632 private ArrayDeque<Node> mRoots = new ArrayDeque<Node>();
1638 final ArrayList<Node> nodes = mNodes;
1657 final Node node = Node.acquire(view);
1677 final ArrayDeque<Node> roots = findRoots(rules);
1680 Node node;
1687 final ArrayMap<Node, DependencyGraph> dependents = node.dependents;
1690 final Node dependent = dependents.keyAt(i);
1691 final SparseArray<Node> dependencies = dependent.dependencies;
1715 private ArrayDeque<Node> findRoots(int[] rulesFilter) {
1716 final SparseArray<Node> keyNodes = mKeyNodes;
1717 final ArrayList<Node> nodes = mNodes;
1723 final Node node = nodes.get(i);
1730 final Node node = nodes.get(i);
1742 final Node dependency = keyNodes.get(rule);
1755 final ArrayDeque<Node> roots = mRoots;
1760 final Node node = nodes.get(i);
1773 static class Node {
1783 final ArrayMap<Node, DependencyGraph> dependents =
1784 new ArrayMap<Node, DependencyGraph>();
1789 final SparseArray<Node> dependencies = new SparseArray<Node>();
1797 private static final SynchronizedPool<Node> sPool =
1798 new SynchronizedPool<Node>(POOL_LIMIT);
1800 static Node acquire(View view) {
1801 Node node = sPool.acquire();
1803 node = new Node();