本文整理了Java中javax.swing.JTree.getNextMatch()
方法的一些代码示例,展示了JTree.getNextMatch()
的具体用法。这些代码示例主要来源于Github
/Stackoverflow
/Maven
等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。JTree.getNextMatch()
方法的具体详情如下:
包路径:javax.swing.JTree
类名称:JTree
方法名:getNextMatch
暂无
代码示例来源:origin: stackoverflow.com
TreePath treePath = null;
for (String prefix : paths) {
treePath = tree.getNextMatch( prefix, row, Position.Bias.Forward );
row = tree.getRowForPath(treePath);
代码示例来源:origin: org.biojava.thirdparty/forester
private void expandPath( final String name ) {
final TreePath tp = getJTree().getNextMatch( name, 0, Position.Bias.Forward );
if ( tp != null ) {
getJTree().expandPath( tp );
}
}
代码示例来源:origin: org.biojava.thirdparty/forester
private void collapsePath( final String name ) {
final TreePath tp = getJTree().getNextMatch( name, 0, Position.Bias.Forward );
if ( tp != null ) {
getJTree().collapsePath( tp );
}
}
代码示例来源:origin: stackoverflow.com
TreePath path = tree.getNextMatch(prefix, startRow,
Position.Bias.Forward);
MutableTreeNode node = (MutableTreeNode) path.getLastPathComponent();
代码示例来源:origin: stackoverflow.com
for (String part : parts) {
int row = (path==null ? 0 : tree.getRowForPath(path));
path = tree.getNextMatch(part, row, Position.Bias.Forward);
if (path==null) {
return false;
代码示例来源:origin: net.sf.tinylaf/tinylaf
tree1.setCellRenderer(new SwitchTreeIcons(true));
tree1.setEditable(true);
tree1.expandPath(tree1.getNextMatch("colors", 0, Position.Bias.Forward));
tree1.expandPath(tree1.getNextMatch("food", 0, Position.Bias.Forward));
tree1.setVisibleRowCount(10);
sp1 = new JScrollPane(tree1);
root.setUserObject("JTree disabled");
tree2.getModel().valueForPathChanged(new TreePath(root.getPath()), "JTree disabled");
tree2.expandPath(tree2.getNextMatch("sports", 0, Position.Bias.Forward));
tree2.setEnabled(false);
tree2.setVisibleRowCount(10);
代码示例来源:origin: stackoverflow.com
TreePath treePath = null;
for (String prefix : paths) {
treePath = tree.getNextMatch( prefix, row, Position.Bias.Forward );
row = tree.getRowForPath(treePath);
内容来源于网络,如有侵权,请联系作者删除!