Lines Matching defs:node
921 DependencyGraph.Node node = mGraph.mKeyNodes.get(id);
922 if (node == null) return null;
923 View v = node.view;
928 node = mGraph.mKeyNodes.get((rules[relation]));
929 if (node == null) return null;
930 v = node.view;
1419 * List of nodes in the graph. Each node is identified by its
1449 * @param view The view to be added as a node to the graph.
1453 final Node node = Node.acquire(view);
1456 mKeyNodes.put(id, node);
1459 mNodes.add(node);
1476 Node node;
1477 while ((node = roots.pollLast()) != null) {
1478 final View view = node.view;
1483 final HashMap<Node, DependencyGraph> dependents = node.dependents;
1501 * Finds the roots of the graph. A root is a node with no dependency and
1507 * @return A list of node, each being a root of the graph
1517 final Node node = nodes.get(i);
1518 node.dependents.clear();
1519 node.dependencies.clear();
1522 // Builds up the dependents and dependencies for each node of the graph
1524 final Node node = nodes.get(i);
1526 final LayoutParams layoutParams = (LayoutParams) node.view.getLayoutParams();
1535 // The node this node depends on
1538 if (dependency == null || dependency == node) {
1541 // Add the current node as a dependent
1542 dependency.dependents.put(node, this);
1543 // Add a dependency to the current node
1544 node.dependencies.put(rule, dependency);
1554 final Node node = nodes.get(i);
1555 if (node.dependencies.size() == 0) roots.addLast(node);
1569 for (Node node : roots) {
1570 printNode(resources, node);
1582 private static void appendViewId(Resources resources, Node node, StringBuilder buffer) {
1583 if (node.view.getId() != View.NO_ID) {
1584 buffer.append(resources.getResourceEntryName(node.view.getId()));
1590 private static void printNode(Resources resources, Node node) {
1591 if (node.dependents.size() == 0) {
1592 printViewId(resources, node.view);
1594 for (Node dependent : node.dependents.keySet()) {
1596 appendViewId(resources, node, buffer);
1602 private static void printdependents(Resources resources, Node node, StringBuilder buffer) {
1604 appendViewId(resources, node, buffer);
1606 if (node.dependents.size() == 0) {
1609 for (Node dependent : node.dependents.keySet()) {
1617 * A node in the dependency graph. A node is a view, its list of dependencies
1620 * A node with no dependent is considered a root of the graph.
1624 * The view representing this node in the layout.
1629 * The list of dependents for this node; a dependent is a node
1630 * that needs this node to be processed first.
1635 * The list of dependencies for this node.
1679 final Node node = sPool.acquire();
1680 node.view = view;
1682 return node;