Lines Matching refs:node
1008 DependencyGraph.Node node = mGraph.mKeyNodes.get(id);
1009 if (node == null) return null;
1010 View v = node.view;
1015 node = mGraph.mKeyNodes.get((rules[relation]));
1016 if (node == null) return null;
1017 v = node.view;
1694 * List of nodes in the graph. Each node is identified by its
1724 * @param view The view to be added as a node to the graph.
1728 final Node node = Node.acquire(view);
1731 mKeyNodes.put(id, node);
1734 mNodes.add(node);
1751 Node node;
1752 while ((node = roots.pollLast()) != null) {
1753 final View view = node.view;
1758 final ArrayMap<Node, DependencyGraph> dependents = node.dependents;
1778 * Finds the roots of the graph. A root is a node with no dependency and
1784 * @return A list of node, each being a root of the graph
1794 final Node node = nodes.get(i);
1795 node.dependents.clear();
1796 node.dependencies.clear();
1799 // Builds up the dependents and dependencies for each node of the graph
1801 final Node node = nodes.get(i);
1803 final LayoutParams layoutParams = (LayoutParams) node.view.getLayoutParams();
1812 // The node this node depends on
1815 if (dependency == null || dependency == node) {
1818 // Add the current node as a dependent
1819 dependency.dependents.put(node, this);
1820 // Add a dependency to the current node
1821 node.dependencies.put(rule, dependency);
1831 final Node node = nodes.get(i);
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
1842 * A node with no dependent is considered a root of the graph.
1846 * The view representing this node in the layout.
1851 * The list of dependents for this node; a dependent is a node
1852 * that needs this node to be processed first.
1858 * The list of dependencies for this node.
1872 Node node = sPool.acquire();
1873 if (node == null) {
1874 node = new Node();
1876 node.view = view;
1877 return node;