Lines Matching defs:path

201      * The region is defined by the path closest to
267 public abstract boolean isExpanded(TreePath path);
270 * Returns a rectangle giving the bounds needed to draw path.
272 * @param path a <code>TreePath</code> specifying a node
277 public abstract Rectangle getBounds(TreePath path, Rectangle placeIn);
280 * Returns the path for passed in row. If row is not visible
289 * Returns the row that the last item identified in path is visible
290 * at. Will return -1 if any of the elements in path are not
293 * @param path the <code>TreePath</code> being queried
294 * @return the row where the last item in path is visible or -1
295 * if any elements in path aren't currently visible
297 public abstract int getRowForPath(TreePath path);
300 * Returns the path to the node that is closest to x,y. If
302 * otherwise it'll always return a valid path.
305 * the returned path and test x, y against that.
317 * The first element of the returned enumeration will be path,
321 * @param path the starting location for the enumeration
324 public abstract Enumeration<TreePath> getVisiblePathsFrom(TreePath path);
329 * @param path the path being queried
330 * @return the number of visible children for the specified path
332 public abstract int getVisibleChildCount(TreePath path);
335 * Marks the path <code>path</code> expanded state to
338 * @param path the path being expanded or collapsed
339 * @param isExpanded true if the path should be expanded, false otherwise
341 public abstract void setExpandedState(TreePath path, boolean isExpanded);
344 * Returns true if the path is expanded, and visible.
346 * @param path the path being queried
347 * @return true if the path is expanded and visible, false otherwise
349 public abstract boolean getExpandedState(TreePath path);
366 * <code>path</code> are invalid, and need to be updated.
368 * @param path the path being updated
370 public abstract void invalidatePathBounds(TreePath path);
387 * <p>e.path() returns the path the parent of the changed node(s).</p>
398 * <p>e.path() returns the parent of the new nodes</p>
412 * <p>e.path() returns the former parent of the deleted nodes.</p>
422 * given node down. If the path returned by <code>e.getPath()</code>
427 * <p>e.path() holds the path to the node.</p>
440 * <code>path</code> are being displayed at.
443 * in <code>path</code> is not valid its entry in the array should