public SplitDockPathProperty vertical( SplitDockPathProperty top, SplitDockPathProperty bottom, double divider, long id, Path[] placeholders, PlaceholderMap placeholderMap, boolean visible ){ if( top != null ) { if( visible ) { top.insert(SplitDockPathProperty.Location.TOP, divider, 0, id); } return top; } if( bottom != null ) { if( visible ) { bottom.insert(SplitDockPathProperty.Location.BOTTOM, 1 - divider, 0, id); } return bottom; } return null; } }
public SplitDockPathProperty horizontal( SplitDockPathProperty left, SplitDockPathProperty right, double divider, long id, Path[] placeholders, PlaceholderMap placeholderMap, boolean visible ){ if( left != null ) { if( visible ) { left.insert(SplitDockPathProperty.Location.LEFT, divider, 0, id); } return left; } if( right != null ) { if( visible ) { right.insert(SplitDockPathProperty.Location.RIGHT, 1 - divider, 0, id); } return right; } return null; }
public SplitDockPathProperty horizontal( SplitDockPathProperty left, SplitDockPathProperty right, double divider, long id, Path[] placeholders, PlaceholderMap placeholderMap, boolean visible ){ if( left != null ) { if( visible ) { left.insert(SplitDockPathProperty.Location.LEFT, divider, 0, id); } return left; } if( right != null ) { if( visible ) { right.insert(SplitDockPathProperty.Location.RIGHT, 1 - divider, 0, id); } return right; } return null; }
public SplitDockPathProperty vertical( SplitDockPathProperty top, SplitDockPathProperty bottom, double divider, long id, Path[] placeholders, PlaceholderMap placeholderMap, boolean visible ){ if( top != null ) { if( visible ) { top.insert(SplitDockPathProperty.Location.TOP, divider, 0, id); } return top; } if( bottom != null ) { if( visible ) { bottom.insert(SplitDockPathProperty.Location.BOTTOM, 1 - divider, 0, id); } return bottom; } return null; } }
/** * Adds a new element to the end of the path. Every element describes which turn the * path takes in a node. * @param location the direction into which the path goes * @param size the relative size of the path, a value in the range 0.0 * to 1.0 * @param id the unique identifier of the node or -1 */ public void add( Location location, double size, long id ){ insert( location, size, nodes.size(), id ); }
path.insert( location, size, 0, parent.getNodeId() );
path.insert( location, size, 0, parent.getNodeId() );