本文整理汇总了Java中org.abego.treelayout.NodeExtentProvider类的典型用法代码示例。如果您正苦于以下问题：Java NodeExtentProvider类的具体用法？Java NodeExtentProvider怎么用？Java NodeExtentProvider使用的例子？那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
NodeExtentProvider类属于org.abego.treelayout包，在下文中一共展示了NodeExtentProvider类的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: TreeLayout
import org.abego.treelayout.NodeExtentProvider; //导入依赖的package包/类
/**
* Creates a TreeLayout for a given tree.
* <p>
* In addition to the tree the {@link NodeExtentProvider} and the
* {@link Configuration} must be given.
*
* @param useIdentity
* [default: false] when true, identity ("==") is used instead of
* equality ("equals(...)") when checking nodes. Within a tree
* each node must only be once (using this check).
*/
public TreeLayout(TreeForTreeLayout<TreeNode> tree,
NodeExtentProvider<TreeNode> nodeExtentProvider,
Configuration<TreeNode> configuration, boolean useIdentity) {
this.tree = tree;
this.nodeExtentProvider = nodeExtentProvider;
this.configuration = configuration;
this.useIdentity = useIdentity;
if (this.useIdentity) {
this.mod = new IdentityHashMap<TreeNode, Double>();
this.thread = new IdentityHashMap<TreeNode, TreeNode>();
this.prelim = new IdentityHashMap<TreeNode, Double>();
this.change = new IdentityHashMap<TreeNode, Double>();
this.shift = new IdentityHashMap<TreeNode, Double>();
this.ancestor = new IdentityHashMap<TreeNode, TreeNode>();
this.number = new IdentityHashMap<TreeNode, Integer>();
this.positions = new IdentityHashMap<TreeNode, Point2D>();
} else {
this.mod = new HashMap<TreeNode, Double>();
this.thread = new HashMap<TreeNode, TreeNode>();
this.prelim = new HashMap<TreeNode, Double>();
this.change = new HashMap<TreeNode, Double>();
this.shift = new HashMap<TreeNode, Double>();
this.ancestor = new HashMap<TreeNode, TreeNode>();
this.number = new HashMap<TreeNode, Integer>();
this.positions = new HashMap<TreeNode, Point2D>();
}
// No need to explicitly set mod, thread and ancestor as their getters
// are taking care of the initial values. This avoids a full tree walk
// through and saves some memory as no entries are added for
// "initial values".
TreeNode r = tree.getRoot();
firstWalk(r, null);
calcSizeOfLevels(r, 0);
secondWalk(r, -getPrelim(r), 0, 0);
}
示例2: getNodeExtentProvider
import org.abego.treelayout.NodeExtentProvider; //导入依赖的package包/类
/**
* Returns the {@link NodeExtentProvider} used by this {@link TreeLayout}.
*/
public NodeExtentProvider<TreeNode> getNodeExtentProvider() {
return nodeExtentProvider;
}