void function ( Interval arg0 , Collection arg1 ) { if ( arg0 != null && ! isSearchMatch ( arg0 ) ) return ; arg1 . addAll ( items ) ; if ( subnode [ 0 ] != null ) subnode [ 0 ] . addAllItemsFromOverlapping ( arg0 , arg1 ) ; if ( subnode [ 1 ] != null ) subnode [ 1 ] . addAllItemsFromOverlapping ( arg0 , arg1 ) ; }
adds items in the tree which potentially overlap the query interval to the given collection . if the query interval is null , add all items in the tree . concode_field_sep Node[] subnode concode_elem_sep List items concode_field_sep void add concode_elem_sep List getItems concode_elem_sep int depth concode_elem_sep int nodeSize concode_elem_sep int size concode_elem_sep boolean hasChildren concode_elem_sep List addAllItems concode_elem_sep boolean hasItems concode_elem_sep boolean isSearchMatch concode_elem_sep int getSubnodeIndex concode_elem_sep boolean isPrunable concode_elem_sep boolean remove