p_start_piece.set_search_tree_entries(this, start_piece_leaf_arr );
p_end_piece.set_search_tree_entries(this, end_piece_leaf_arr );
}
public final TreeSet<AwtreeObject> find_overlap_objects(ShapeConvex p_shape, int p_layer, NetNosList p_ignore_net_nos)
{
<BUG>TreeSet<AwtreeObject> risul_obstacles = new TreeSet<AwtreeObject>();
Collection<AwtreeEntry> tree_entries = new LinkedList<AwtreeEntry>();
calc_overlapping_tree_entries(p_shape, p_layer, p_ignore_net_nos, tree_entries);</BUG>
Iterator<AwtreeEntry> it = tree_entries.iterator();
while (it.hasNext())

p_start_piece.set_search_tree_entries(this, start_piece_leaf_arr );
p_end_piece.set_search_tree_entries(this, end_piece_leaf_arr );
}
public final TreeSet<AwtreeObject> find_overlap_objects(ShapeConvex p_shape, int p_layer, NetNosList p_ignore_net_nos)
{
TreeSet<AwtreeObject> risul_obstacles = new TreeSet<AwtreeObject>();
Collection<AwtreeEntry> tree_entries = find_overlap_tree_entries(p_shape, p_layer, p_ignore_net_nos);
Iterator<AwtreeEntry> it = tree_entries.iterator();
while (it.hasNext())
