57 private int rowCount;
58
59 /**
60 * Used in getting sizes for nodes to avoid creating a new Rectangle
61 * every time a size is needed.
62 */
63 private Rectangle boundsBuffer;
64
65 /**
66 * Maps from TreePath to a FHTreeStateNode.
67 */
68 private Hashtable<TreePath, FHTreeStateNode> treePathMapping;
69
70 /**
71 * Used for getting path/row information.
72 */
73 private SearchInfo info;
74
75 private Stack<Stack<TreePath>> tempStacks;
76
77
78 public FixedHeightLayoutCache() {
79 super();
80 tempStacks = new Stack<Stack<TreePath>>();
81 boundsBuffer = new Rectangle();
82 treePathMapping = new Hashtable<TreePath, FHTreeStateNode>();
83 info = new SearchInfo();
84 setRowHeight(1);
85 }
86
87 /**
88 * Sets the TreeModel that will provide the data.
89 *
90 * @param newModel the TreeModel that is to provide the data
91 */
92 public void setModel(TreeModel newModel) {
93 super.setModel(newModel);
94 rebuild(false);
95 }
96
97 /**
|
57 private int rowCount;
58
59 /**
60 * Used in getting sizes for nodes to avoid creating a new Rectangle
61 * every time a size is needed.
62 */
63 private Rectangle boundsBuffer;
64
65 /**
66 * Maps from TreePath to a FHTreeStateNode.
67 */
68 private Hashtable<TreePath, FHTreeStateNode> treePathMapping;
69
70 /**
71 * Used for getting path/row information.
72 */
73 private SearchInfo info;
74
75 private Stack<Stack<TreePath>> tempStacks;
76
77 /**
78 * Constructs a {@code FixedHeightLayoutCache}.
79 */
80 public FixedHeightLayoutCache() {
81 super();
82 tempStacks = new Stack<Stack<TreePath>>();
83 boundsBuffer = new Rectangle();
84 treePathMapping = new Hashtable<TreePath, FHTreeStateNode>();
85 info = new SearchInfo();
86 setRowHeight(1);
87 }
88
89 /**
90 * Sets the TreeModel that will provide the data.
91 *
92 * @param newModel the TreeModel that is to provide the data
93 */
94 public void setModel(TreeModel newModel) {
95 super.setModel(newModel);
96 rebuild(false);
97 }
98
99 /**
|