public final TreeSet<AwtreeObject> find_overlap_objects(ShapeConvex p_shape,int p_layer,NetNosList p_ignore_net_nos){
  TreeSet<AwtreeObject> risul=new TreeSet<AwtreeObject>();
  Collection<AwtreeFindEntry> tree_entries=find_overlap_tree_entries(p_shape,p_layer,p_ignore_net_nos);
  for (  AwtreeFindEntry curr_entry : tree_entries)   risul.add(curr_entry.object);
  return risul;
}

public final TreeSet < AwtreeObject > find_overlap_objects ( ShapeConvex p_shape , int p_layer , NetNosList p_ignore_net_nos ) { TreeSet < AwtreeObject > risul = new TreeSet < AwtreeObject > ( ) ; Collection < AwtreeFindEntry > tree_entries = find_overlap_tree_entries ( p_shape , p_layer , p_ignore_net_nos ) ; for ( AwtreeFindEntry curr_entry : tree_entries ) risul . add ( curr_entry . object ) ; return risul ; }
puts all items in the tree overlapping with p_shape on layer p_layer into p_obstacles . if p_layer < 0 , the layer is ignored .
