Java Code Examples for java.util.Stack#removeAllElements()

The following examples show how to use java.util.Stack#removeAllElements() . You can vote up the ones you like or vote down the ones you don't like, and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example 1
Source File: VariableHeightLayoutCache.java    From openjdk-jdk8u with GNU General Public License v2.0 4 votes vote down vote up 
/**
  * Returns the TreeStateNode identified by path.  This mirrors
  * the behavior of getNodeForPath, but tries to take advantage of
  * path if it is an instance of AbstractTreePath.
  */
private TreeStateNode getNodeForPath(TreePath path,
                                       boolean onlyIfVisible,
                                       boolean shouldCreate) {
    if(path != null) {
        TreeStateNode      node;

        node = getMapping(path);
        if(node != null) {
            if(onlyIfVisible && !node.isVisible())
                return null;
            return node;
        }

        // Check all the parent paths, until a match is found.
        Stack<TreePath> paths;

        if(tempStacks.size() == 0) {
            paths = new Stack<TreePath>();
        }
        else {
            paths = tempStacks.pop();
        }

        try {
            paths.push(path);
            path = path.getParentPath();
            node = null;
            while(path != null) {
                node = getMapping(path);
                if(node != null) {
                    // Found a match, create entries for all paths in
                    // paths.
                    while(node != null && paths.size() > 0) {
                        path = paths.pop();
                        node.getLoadedChildren(shouldCreate);

                        int            childIndex = treeModel.
                                  getIndexOfChild(node.getUserObject(),
                                              path.getLastPathComponent());

                        if(childIndex == -1 ||
                           childIndex >= node.getChildCount() ||
                           (onlyIfVisible && !node.isVisible())) {
                            node = null;
                        }
                        else
                            node = (TreeStateNode)node.getChildAt
                                           (childIndex);
                    }
                    return node;
                }
                paths.push(path);
                path = path.getParentPath();
            }
        }
        finally {
            paths.removeAllElements();
            tempStacks.push(paths);
        }
        // If we get here it means they share a different root!
        // We could throw an exception...
    }
    return null;
}
Example 2
Source File: FixedHeightLayoutCache.java    From jdk8u-jdk with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * Messages getTreeNodeForPage(path, onlyIfVisible, shouldCreate,
 * path.length) as long as path is non-null and the length is {@literal >} 0.
 * Otherwise returns null.
 */
private FHTreeStateNode getNodeForPath(TreePath path,
                                         boolean onlyIfVisible,
                                         boolean shouldCreate) {
    if(path != null) {
        FHTreeStateNode      node;

        node = getMapping(path);
        if(node != null) {
            if(onlyIfVisible && !node.isVisible())
                return null;
            return node;
        }
        if(onlyIfVisible)
            return null;

        // Check all the parent paths, until a match is found.
        Stack<TreePath> paths;

        if(tempStacks.size() == 0) {
            paths = new Stack<TreePath>();
        }
        else {
            paths = tempStacks.pop();
        }

        try {
            paths.push(path);
            path = path.getParentPath();
            node = null;
            while(path != null) {
                node = getMapping(path);
                if(node != null) {
                    // Found a match, create entries for all paths in
                    // paths.
                    while(node != null && paths.size() > 0) {
                        path = paths.pop();
                        node = node.createChildFor(path.
                                                   getLastPathComponent());
                    }
                    return node;
                }
                paths.push(path);
                path = path.getParentPath();
            }
        }
        finally {
            paths.removeAllElements();
            tempStacks.push(paths);
        }
        // If we get here it means they share a different root!
        return null;
    }
    return null;
}
Example 3
Source File: VariableHeightLayoutCache.java    From jdk8u-jdk with GNU General Public License v2.0 4 votes vote down vote up 
/**
  * Returns the TreeStateNode identified by path.  This mirrors
  * the behavior of getNodeForPath, but tries to take advantage of
  * path if it is an instance of AbstractTreePath.
  */
private TreeStateNode getNodeForPath(TreePath path,
                                       boolean onlyIfVisible,
                                       boolean shouldCreate) {
    if(path != null) {
        TreeStateNode      node;

        node = getMapping(path);
        if(node != null) {
            if(onlyIfVisible && !node.isVisible())
                return null;
            return node;
        }

        // Check all the parent paths, until a match is found.
        Stack<TreePath> paths;

        if(tempStacks.size() == 0) {
            paths = new Stack<TreePath>();
        }
        else {
            paths = tempStacks.pop();
        }

        try {
            paths.push(path);
            path = path.getParentPath();
            node = null;
            while(path != null) {
                node = getMapping(path);
                if(node != null) {
                    // Found a match, create entries for all paths in
                    // paths.
                    while(node != null && paths.size() > 0) {
                        path = paths.pop();
                        node.getLoadedChildren(shouldCreate);

                        int            childIndex = treeModel.
                                  getIndexOfChild(node.getUserObject(),
                                              path.getLastPathComponent());

                        if(childIndex == -1 ||
                           childIndex >= node.getChildCount() ||
                           (onlyIfVisible && !node.isVisible())) {
                            node = null;
                        }
                        else
                            node = (TreeStateNode)node.getChildAt
                                           (childIndex);
                    }
                    return node;
                }
                paths.push(path);
                path = path.getParentPath();
            }
        }
        finally {
            paths.removeAllElements();
            tempStacks.push(paths);
        }
        // If we get here it means they share a different root!
        // We could throw an exception...
    }
    return null;
}
Example 4
Source File: VariableHeightLayoutCache.java    From openjdk-8 with GNU General Public License v2.0 4 votes vote down vote up 
/**
  * Returns the TreeStateNode identified by path.  This mirrors
  * the behavior of getNodeForPath, but tries to take advantage of
  * path if it is an instance of AbstractTreePath.
  */
private TreeStateNode getNodeForPath(TreePath path,
                                       boolean onlyIfVisible,
                                       boolean shouldCreate) {
    if(path != null) {
        TreeStateNode      node;

        node = getMapping(path);
        if(node != null) {
            if(onlyIfVisible && !node.isVisible())
                return null;
            return node;
        }

        // Check all the parent paths, until a match is found.
        Stack<TreePath> paths;

        if(tempStacks.size() == 0) {
            paths = new Stack<TreePath>();
        }
        else {
            paths = tempStacks.pop();
        }

        try {
            paths.push(path);
            path = path.getParentPath();
            node = null;
            while(path != null) {
                node = getMapping(path);
                if(node != null) {
                    // Found a match, create entries for all paths in
                    // paths.
                    while(node != null && paths.size() > 0) {
                        path = paths.pop();
                        node.getLoadedChildren(shouldCreate);

                        int            childIndex = treeModel.
                                  getIndexOfChild(node.getUserObject(),
                                              path.getLastPathComponent());

                        if(childIndex == -1 ||
                           childIndex >= node.getChildCount() ||
                           (onlyIfVisible && !node.isVisible())) {
                            node = null;
                        }
                        else
                            node = (TreeStateNode)node.getChildAt
                                           (childIndex);
                    }
                    return node;
                }
                paths.push(path);
                path = path.getParentPath();
            }
        }
        finally {
            paths.removeAllElements();
            tempStacks.push(paths);
        }
        // If we get here it means they share a different root!
        // We could throw an exception...
    }
    return null;
}
Example 5
Source File: VariableHeightLayoutCache.java    From openjdk-jdk9 with GNU General Public License v2.0 4 votes vote down vote up 
/**
  * Returns the TreeStateNode identified by path.  This mirrors
  * the behavior of getNodeForPath, but tries to take advantage of
  * path if it is an instance of AbstractTreePath.
  */
private TreeStateNode getNodeForPath(TreePath path,
                                       boolean onlyIfVisible,
                                       boolean shouldCreate) {
    if(path != null) {
        TreeStateNode      node;

        node = getMapping(path);
        if(node != null) {
            if(onlyIfVisible && !node.isVisible())
                return null;
            return node;
        }

        // Check all the parent paths, until a match is found.
        Stack<TreePath> paths;

        if(tempStacks.size() == 0) {
            paths = new Stack<TreePath>();
        }
        else {
            paths = tempStacks.pop();
        }

        try {
            paths.push(path);
            path = path.getParentPath();
            node = null;
            while(path != null) {
                node = getMapping(path);
                if(node != null) {
                    // Found a match, create entries for all paths in
                    // paths.
                    while(node != null && paths.size() > 0) {
                        path = paths.pop();
                        node.getLoadedChildren(shouldCreate);

                        int            childIndex = treeModel.
                                  getIndexOfChild(node.getUserObject(),
                                              path.getLastPathComponent());

                        if(childIndex == -1 ||
                           childIndex >= node.getChildCount() ||
                           (onlyIfVisible && !node.isVisible())) {
                            node = null;
                        }
                        else
                            node = (TreeStateNode)node.getChildAt
                                           (childIndex);
                    }
                    return node;
                }
                paths.push(path);
                path = path.getParentPath();
            }
        }
        finally {
            paths.removeAllElements();
            tempStacks.push(paths);
        }
        // If we get here it means they share a different root!
        // We could throw an exception...
    }
    return null;
}
Example 6
Source File: FixedHeightLayoutCache.java    From openjdk-8 with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * Messages getTreeNodeForPage(path, onlyIfVisible, shouldCreate,
 * path.length) as long as path is non-null and the length is {@literal >} 0.
 * Otherwise returns null.
 */
private FHTreeStateNode getNodeForPath(TreePath path,
                                         boolean onlyIfVisible,
                                         boolean shouldCreate) {
    if(path != null) {
        FHTreeStateNode      node;

        node = getMapping(path);
        if(node != null) {
            if(onlyIfVisible && !node.isVisible())
                return null;
            return node;
        }
        if(onlyIfVisible)
            return null;

        // Check all the parent paths, until a match is found.
        Stack<TreePath> paths;

        if(tempStacks.size() == 0) {
            paths = new Stack<TreePath>();
        }
        else {
            paths = tempStacks.pop();
        }

        try {
            paths.push(path);
            path = path.getParentPath();
            node = null;
            while(path != null) {
                node = getMapping(path);
                if(node != null) {
                    // Found a match, create entries for all paths in
                    // paths.
                    while(node != null && paths.size() > 0) {
                        path = paths.pop();
                        node = node.createChildFor(path.
                                                   getLastPathComponent());
                    }
                    return node;
                }
                paths.push(path);
                path = path.getParentPath();
            }
        }
        finally {
            paths.removeAllElements();
            tempStacks.push(paths);
        }
        // If we get here it means they share a different root!
        return null;
    }
    return null;
}
Example 7
Source File: VariableHeightLayoutCache.java    From Java8CN with Apache License 2.0 4 votes vote down vote up 
/**
  * Returns the TreeStateNode identified by path.  This mirrors
  * the behavior of getNodeForPath, but tries to take advantage of
  * path if it is an instance of AbstractTreePath.
  */
private TreeStateNode getNodeForPath(TreePath path,
                                       boolean onlyIfVisible,
                                       boolean shouldCreate) {
    if(path != null) {
        TreeStateNode      node;

        node = getMapping(path);
        if(node != null) {
            if(onlyIfVisible && !node.isVisible())
                return null;
            return node;
        }

        // Check all the parent paths, until a match is found.
        Stack<TreePath> paths;

        if(tempStacks.size() == 0) {
            paths = new Stack<TreePath>();
        }
        else {
            paths = tempStacks.pop();
        }

        try {
            paths.push(path);
            path = path.getParentPath();
            node = null;
            while(path != null) {
                node = getMapping(path);
                if(node != null) {
                    // Found a match, create entries for all paths in
                    // paths.
                    while(node != null && paths.size() > 0) {
                        path = paths.pop();
                        node.getLoadedChildren(shouldCreate);

                        int            childIndex = treeModel.
                                  getIndexOfChild(node.getUserObject(),
                                              path.getLastPathComponent());

                        if(childIndex == -1 ||
                           childIndex >= node.getChildCount() ||
                           (onlyIfVisible && !node.isVisible())) {
                            node = null;
                        }
                        else
                            node = (TreeStateNode)node.getChildAt
                                           (childIndex);
                    }
                    return node;
                }
                paths.push(path);
                path = path.getParentPath();
            }
        }
        finally {
            paths.removeAllElements();
            tempStacks.push(paths);
        }
        // If we get here it means they share a different root!
        // We could throw an exception...
    }
    return null;
}
Example 8
Source File: FixedHeightLayoutCache.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * Messages getTreeNodeForPage(path, onlyIfVisible, shouldCreate,
 * path.length) as long as path is non-null and the length is {@literal >} 0.
 * Otherwise returns null.
 */
private FHTreeStateNode getNodeForPath(TreePath path,
                                         boolean onlyIfVisible,
                                         boolean shouldCreate) {
    if(path != null) {
        FHTreeStateNode      node;

        node = getMapping(path);
        if(node != null) {
            if(onlyIfVisible && !node.isVisible())
                return null;
            return node;
        }
        if(onlyIfVisible)
            return null;

        // Check all the parent paths, until a match is found.
        Stack<TreePath> paths;

        if(tempStacks.size() == 0) {
            paths = new Stack<TreePath>();
        }
        else {
            paths = tempStacks.pop();
        }

        try {
            paths.push(path);
            path = path.getParentPath();
            node = null;
            while(path != null) {
                node = getMapping(path);
                if(node != null) {
                    // Found a match, create entries for all paths in
                    // paths.
                    while(node != null && paths.size() > 0) {
                        path = paths.pop();
                        node = node.createChildFor(path.
                                                   getLastPathComponent());
                    }
                    return node;
                }
                paths.push(path);
                path = path.getParentPath();
            }
        }
        finally {
            paths.removeAllElements();
            tempStacks.push(paths);
        }
        // If we get here it means they share a different root!
        return null;
    }
    return null;
}
Example 9
Source File: VariableHeightLayoutCache.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 4 votes vote down vote up 
/**
  * Returns the TreeStateNode identified by path.  This mirrors
  * the behavior of getNodeForPath, but tries to take advantage of
  * path if it is an instance of AbstractTreePath.
  */
private TreeStateNode getNodeForPath(TreePath path,
                                       boolean onlyIfVisible,
                                       boolean shouldCreate) {
    if(path != null) {
        TreeStateNode      node;

        node = getMapping(path);
        if(node != null) {
            if(onlyIfVisible && !node.isVisible())
                return null;
            return node;
        }

        // Check all the parent paths, until a match is found.
        Stack<TreePath> paths;

        if(tempStacks.size() == 0) {
            paths = new Stack<TreePath>();
        }
        else {
            paths = tempStacks.pop();
        }

        try {
            paths.push(path);
            path = path.getParentPath();
            node = null;
            while(path != null) {
                node = getMapping(path);
                if(node != null) {
                    // Found a match, create entries for all paths in
                    // paths.
                    while(node != null && paths.size() > 0) {
                        path = paths.pop();
                        node.getLoadedChildren(shouldCreate);

                        int            childIndex = treeModel.
                                  getIndexOfChild(node.getUserObject(),
                                              path.getLastPathComponent());

                        if(childIndex == -1 ||
                           childIndex >= node.getChildCount() ||
                           (onlyIfVisible && !node.isVisible())) {
                            node = null;
                        }
                        else
                            node = (TreeStateNode)node.getChildAt
                                           (childIndex);
                    }
                    return node;
                }
                paths.push(path);
                path = path.getParentPath();
            }
        }
        finally {
            paths.removeAllElements();
            tempStacks.push(paths);
        }
        // If we get here it means they share a different root!
        // We could throw an exception...
    }
    return null;
}
Example 10
Source File: FixedHeightLayoutCache.java    From openjdk-jdk8u with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * Messages getTreeNodeForPage(path, onlyIfVisible, shouldCreate,
 * path.length) as long as path is non-null and the length is {@literal >} 0.
 * Otherwise returns null.
 */
private FHTreeStateNode getNodeForPath(TreePath path,
                                         boolean onlyIfVisible,
                                         boolean shouldCreate) {
    if(path != null) {
        FHTreeStateNode      node;

        node = getMapping(path);
        if(node != null) {
            if(onlyIfVisible && !node.isVisible())
                return null;
            return node;
        }
        if(onlyIfVisible)
            return null;

        // Check all the parent paths, until a match is found.
        Stack<TreePath> paths;

        if(tempStacks.size() == 0) {
            paths = new Stack<TreePath>();
        }
        else {
            paths = tempStacks.pop();
        }

        try {
            paths.push(path);
            path = path.getParentPath();
            node = null;
            while(path != null) {
                node = getMapping(path);
                if(node != null) {
                    // Found a match, create entries for all paths in
                    // paths.
                    while(node != null && paths.size() > 0) {
                        path = paths.pop();
                        node = node.createChildFor(path.
                                                   getLastPathComponent());
                    }
                    return node;
                }
                paths.push(path);
                path = path.getParentPath();
            }
        }
        finally {
            paths.removeAllElements();
            tempStacks.push(paths);
        }
        // If we get here it means they share a different root!
        return null;
    }
    return null;
}
Example 11
Source File: FixedHeightLayoutCache.java    From openjdk-8-source with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * Messages getTreeNodeForPage(path, onlyIfVisible, shouldCreate,
 * path.length) as long as path is non-null and the length is {@literal >} 0.
 * Otherwise returns null.
 */
private FHTreeStateNode getNodeForPath(TreePath path,
                                         boolean onlyIfVisible,
                                         boolean shouldCreate) {
    if(path != null) {
        FHTreeStateNode      node;

        node = getMapping(path);
        if(node != null) {
            if(onlyIfVisible && !node.isVisible())
                return null;
            return node;
        }
        if(onlyIfVisible)
            return null;

        // Check all the parent paths, until a match is found.
        Stack<TreePath> paths;

        if(tempStacks.size() == 0) {
            paths = new Stack<TreePath>();
        }
        else {
            paths = tempStacks.pop();
        }

        try {
            paths.push(path);
            path = path.getParentPath();
            node = null;
            while(path != null) {
                node = getMapping(path);
                if(node != null) {
                    // Found a match, create entries for all paths in
                    // paths.
                    while(node != null && paths.size() > 0) {
                        path = paths.pop();
                        node = node.createChildFor(path.
                                                   getLastPathComponent());
                    }
                    return node;
                }
                paths.push(path);
                path = path.getParentPath();
            }
        }
        finally {
            paths.removeAllElements();
            tempStacks.push(paths);
        }
        // If we get here it means they share a different root!
        return null;
    }
    return null;
}
Example 12
Source File: FixedHeightLayoutCache.java    From hottub with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * Messages getTreeNodeForPage(path, onlyIfVisible, shouldCreate,
 * path.length) as long as path is non-null and the length is {@literal >} 0.
 * Otherwise returns null.
 */
private FHTreeStateNode getNodeForPath(TreePath path,
                                         boolean onlyIfVisible,
                                         boolean shouldCreate) {
    if(path != null) {
        FHTreeStateNode      node;

        node = getMapping(path);
        if(node != null) {
            if(onlyIfVisible && !node.isVisible())
                return null;
            return node;
        }
        if(onlyIfVisible)
            return null;

        // Check all the parent paths, until a match is found.
        Stack<TreePath> paths;

        if(tempStacks.size() == 0) {
            paths = new Stack<TreePath>();
        }
        else {
            paths = tempStacks.pop();
        }

        try {
            paths.push(path);
            path = path.getParentPath();
            node = null;
            while(path != null) {
                node = getMapping(path);
                if(node != null) {
                    // Found a match, create entries for all paths in
                    // paths.
                    while(node != null && paths.size() > 0) {
                        path = paths.pop();
                        node = node.createChildFor(path.
                                                   getLastPathComponent());
                    }
                    return node;
                }
                paths.push(path);
                path = path.getParentPath();
            }
        }
        finally {
            paths.removeAllElements();
            tempStacks.push(paths);
        }
        // If we get here it means they share a different root!
        return null;
    }
    return null;
}
Example 13
Source File: VariableHeightLayoutCache.java    From JDKSourceCode1.8 with MIT License 4 votes vote down vote up 
/**
  * Returns the TreeStateNode identified by path.  This mirrors
  * the behavior of getNodeForPath, but tries to take advantage of
  * path if it is an instance of AbstractTreePath.
  */
private TreeStateNode getNodeForPath(TreePath path,
                                       boolean onlyIfVisible,
                                       boolean shouldCreate) {
    if(path != null) {
        TreeStateNode      node;

        node = getMapping(path);
        if(node != null) {
            if(onlyIfVisible && !node.isVisible())
                return null;
            return node;
        }

        // Check all the parent paths, until a match is found.
        Stack<TreePath> paths;

        if(tempStacks.size() == 0) {
            paths = new Stack<TreePath>();
        }
        else {
            paths = tempStacks.pop();
        }

        try {
            paths.push(path);
            path = path.getParentPath();
            node = null;
            while(path != null) {
                node = getMapping(path);
                if(node != null) {
                    // Found a match, create entries for all paths in
                    // paths.
                    while(node != null && paths.size() > 0) {
                        path = paths.pop();
                        node.getLoadedChildren(shouldCreate);

                        int            childIndex = treeModel.
                                  getIndexOfChild(node.getUserObject(),
                                              path.getLastPathComponent());

                        if(childIndex == -1 ||
                           childIndex >= node.getChildCount() ||
                           (onlyIfVisible && !node.isVisible())) {
                            node = null;
                        }
                        else
                            node = (TreeStateNode)node.getChildAt
                                           (childIndex);
                    }
                    return node;
                }
                paths.push(path);
                path = path.getParentPath();
            }
        }
        finally {
            paths.removeAllElements();
            tempStacks.push(paths);
        }
        // If we get here it means they share a different root!
        // We could throw an exception...
    }
    return null;
}
Example 14
Source File: FixedHeightLayoutCache.java    From jdk8u60 with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * Messages getTreeNodeForPage(path, onlyIfVisible, shouldCreate,
 * path.length) as long as path is non-null and the length is {@literal >} 0.
 * Otherwise returns null.
 */
private FHTreeStateNode getNodeForPath(TreePath path,
                                         boolean onlyIfVisible,
                                         boolean shouldCreate) {
    if(path != null) {
        FHTreeStateNode      node;

        node = getMapping(path);
        if(node != null) {
            if(onlyIfVisible && !node.isVisible())
                return null;
            return node;
        }
        if(onlyIfVisible)
            return null;

        // Check all the parent paths, until a match is found.
        Stack<TreePath> paths;

        if(tempStacks.size() == 0) {
            paths = new Stack<TreePath>();
        }
        else {
            paths = tempStacks.pop();
        }

        try {
            paths.push(path);
            path = path.getParentPath();
            node = null;
            while(path != null) {
                node = getMapping(path);
                if(node != null) {
                    // Found a match, create entries for all paths in
                    // paths.
                    while(node != null && paths.size() > 0) {
                        path = paths.pop();
                        node = node.createChildFor(path.
                                                   getLastPathComponent());
                    }
                    return node;
                }
                paths.push(path);
                path = path.getParentPath();
            }
        }
        finally {
            paths.removeAllElements();
            tempStacks.push(paths);
        }
        // If we get here it means they share a different root!
        return null;
    }
    return null;
}
Example 15
Source File: FixedHeightLayoutCache.java    From Java8CN with Apache License 2.0 4 votes vote down vote up 
/**
 * Messages getTreeNodeForPage(path, onlyIfVisible, shouldCreate,
 * path.length) as long as path is non-null and the length is {@literal >} 0.
 * Otherwise returns null.
 */
private FHTreeStateNode getNodeForPath(TreePath path,
                                         boolean onlyIfVisible,
                                         boolean shouldCreate) {
    if(path != null) {
        FHTreeStateNode      node;

        node = getMapping(path);
        if(node != null) {
            if(onlyIfVisible && !node.isVisible())
                return null;
            return node;
        }
        if(onlyIfVisible)
            return null;

        // Check all the parent paths, until a match is found.
        Stack<TreePath> paths;

        if(tempStacks.size() == 0) {
            paths = new Stack<TreePath>();
        }
        else {
            paths = tempStacks.pop();
        }

        try {
            paths.push(path);
            path = path.getParentPath();
            node = null;
            while(path != null) {
                node = getMapping(path);
                if(node != null) {
                    // Found a match, create entries for all paths in
                    // paths.
                    while(node != null && paths.size() > 0) {
                        path = paths.pop();
                        node = node.createChildFor(path.
                                                   getLastPathComponent());
                    }
                    return node;
                }
                paths.push(path);
                path = path.getParentPath();
            }
        }
        finally {
            paths.removeAllElements();
            tempStacks.push(paths);
        }
        // If we get here it means they share a different root!
        return null;
    }
    return null;
}
Example 16
Source File: FixedHeightLayoutCache.java    From TencentKona-8 with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * Messages getTreeNodeForPage(path, onlyIfVisible, shouldCreate,
 * path.length) as long as path is non-null and the length is {@literal >} 0.
 * Otherwise returns null.
 */
private FHTreeStateNode getNodeForPath(TreePath path,
                                         boolean onlyIfVisible,
                                         boolean shouldCreate) {
    if(path != null) {
        FHTreeStateNode      node;

        node = getMapping(path);
        if(node != null) {
            if(onlyIfVisible && !node.isVisible())
                return null;
            return node;
        }
        if(onlyIfVisible)
            return null;

        // Check all the parent paths, until a match is found.
        Stack<TreePath> paths;

        if(tempStacks.size() == 0) {
            paths = new Stack<TreePath>();
        }
        else {
            paths = tempStacks.pop();
        }

        try {
            paths.push(path);
            path = path.getParentPath();
            node = null;
            while(path != null) {
                node = getMapping(path);
                if(node != null) {
                    // Found a match, create entries for all paths in
                    // paths.
                    while(node != null && paths.size() > 0) {
                        path = paths.pop();
                        node = node.createChildFor(path.
                                                   getLastPathComponent());
                    }
                    return node;
                }
                paths.push(path);
                path = path.getParentPath();
            }
        }
        finally {
            paths.removeAllElements();
            tempStacks.push(paths);
        }
        // If we get here it means they share a different root!
        return null;
    }
    return null;
}
Example 17
Source File: VariableHeightLayoutCache.java    From TencentKona-8 with GNU General Public License v2.0 4 votes vote down vote up 
/**
  * Returns the TreeStateNode identified by path.  This mirrors
  * the behavior of getNodeForPath, but tries to take advantage of
  * path if it is an instance of AbstractTreePath.
  */
private TreeStateNode getNodeForPath(TreePath path,
                                       boolean onlyIfVisible,
                                       boolean shouldCreate) {
    if(path != null) {
        TreeStateNode      node;

        node = getMapping(path);
        if(node != null) {
            if(onlyIfVisible && !node.isVisible())
                return null;
            return node;
        }

        // Check all the parent paths, until a match is found.
        Stack<TreePath> paths;

        if(tempStacks.size() == 0) {
            paths = new Stack<TreePath>();
        }
        else {
            paths = tempStacks.pop();
        }

        try {
            paths.push(path);
            path = path.getParentPath();
            node = null;
            while(path != null) {
                node = getMapping(path);
                if(node != null) {
                    // Found a match, create entries for all paths in
                    // paths.
                    while(node != null && paths.size() > 0) {
                        path = paths.pop();
                        node.getLoadedChildren(shouldCreate);

                        int            childIndex = treeModel.
                                  getIndexOfChild(node.getUserObject(),
                                              path.getLastPathComponent());

                        if(childIndex == -1 ||
                           childIndex >= node.getChildCount() ||
                           (onlyIfVisible && !node.isVisible())) {
                            node = null;
                        }
                        else
                            node = (TreeStateNode)node.getChildAt
                                           (childIndex);
                    }
                    return node;
                }
                paths.push(path);
                path = path.getParentPath();
            }
        }
        finally {
            paths.removeAllElements();
            tempStacks.push(paths);
        }
        // If we get here it means they share a different root!
        // We could throw an exception...
    }
    return null;
}
Example 18
Source File: cfSession.java    From openbd-core with GNU General Public License v3.0 4 votes vote down vote up 
public void setCallStackStack( Stack<CFCallStack> _callStackStack ) {
	Stack<CFCallStack> callStackStack = cfContext.getCallStackStack();
	callStackStack.removeAllElements();
	callStackStack.addAll( _callStackStack );
}
Example 19
Source File: VariableHeightLayoutCache.java    From dragonwell8_jdk with GNU General Public License v2.0 4 votes vote down vote up 
/**
  * Returns the TreeStateNode identified by path.  This mirrors
  * the behavior of getNodeForPath, but tries to take advantage of
  * path if it is an instance of AbstractTreePath.
  */
private TreeStateNode getNodeForPath(TreePath path,
                                       boolean onlyIfVisible,
                                       boolean shouldCreate) {
    if(path != null) {
        TreeStateNode      node;

        node = getMapping(path);
        if(node != null) {
            if(onlyIfVisible && !node.isVisible())
                return null;
            return node;
        }

        // Check all the parent paths, until a match is found.
        Stack<TreePath> paths;

        if(tempStacks.size() == 0) {
            paths = new Stack<TreePath>();
        }
        else {
            paths = tempStacks.pop();
        }

        try {
            paths.push(path);
            path = path.getParentPath();
            node = null;
            while(path != null) {
                node = getMapping(path);
                if(node != null) {
                    // Found a match, create entries for all paths in
                    // paths.
                    while(node != null && paths.size() > 0) {
                        path = paths.pop();
                        node.getLoadedChildren(shouldCreate);

                        int            childIndex = treeModel.
                                  getIndexOfChild(node.getUserObject(),
                                              path.getLastPathComponent());

                        if(childIndex == -1 ||
                           childIndex >= node.getChildCount() ||
                           (onlyIfVisible && !node.isVisible())) {
                            node = null;
                        }
                        else
                            node = (TreeStateNode)node.getChildAt
                                           (childIndex);
                    }
                    return node;
                }
                paths.push(path);
                path = path.getParentPath();
            }
        }
        finally {
            paths.removeAllElements();
            tempStacks.push(paths);
        }
        // If we get here it means they share a different root!
        // We could throw an exception...
    }
    return null;
}
Example 20
Source File: FixedHeightLayoutCache.java    From jdk1.8-source-analysis with Apache License 2.0 4 votes vote down vote up 
/**
 * Messages getTreeNodeForPage(path, onlyIfVisible, shouldCreate,
 * path.length) as long as path is non-null and the length is {@literal >} 0.
 * Otherwise returns null.
 */
private FHTreeStateNode getNodeForPath(TreePath path,
                                         boolean onlyIfVisible,
                                         boolean shouldCreate) {
    if(path != null) {
        FHTreeStateNode      node;

        node = getMapping(path);
        if(node != null) {
            if(onlyIfVisible && !node.isVisible())
                return null;
            return node;
        }
        if(onlyIfVisible)
            return null;

        // Check all the parent paths, until a match is found.
        Stack<TreePath> paths;

        if(tempStacks.size() == 0) {
            paths = new Stack<TreePath>();
        }
        else {
            paths = tempStacks.pop();
        }

        try {
            paths.push(path);
            path = path.getParentPath();
            node = null;
            while(path != null) {
                node = getMapping(path);
                if(node != null) {
                    // Found a match, create entries for all paths in
                    // paths.
                    while(node != null && paths.size() > 0) {
                        path = paths.pop();
                        node = node.createChildFor(path.
                                                   getLastPathComponent());
                    }
                    return node;
                }
                paths.push(path);
                path = path.getParentPath();
            }
        }
        finally {
            paths.removeAllElements();
            tempStacks.push(paths);
        }
        // If we get here it means they share a different root!
        return null;
    }
    return null;
}