java stack remove_Java Stack.removeAllElements方法代码示例

import java.util.Stack; //导入方法依赖的package包/类

/**

* 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 paths;

if(tempStacks.size() == 0) {

paths = new Stack();

}

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;

}