Buggy code:
public class RTree < T > { public enum SeedPicker { LINEAR , QUADRATIC ; } private final int maxEntries ; private final int minEntries ; private final int numDims ; private final float [ ] pointDims ; private final RTree . SeedPicker seedPicker ; private RTree < T > . Node root ; private volatile int size ; public RTree ( int maxEntries , int minEntries , int numDims , RTree . SeedPicker seedPicker ) { } public RTree ( int maxEntries , int minEntries , int numDims ) { } private RTree < T > . Node buildRoot ( boolean asLeaf ) { } public RTree ( ) { } public int getMaxEntries ( ) { } public int getMinEntries ( ) { } public int getNumDims ( ) { } public int size ( ) { } public List < T > search ( float [ ] coords , float [ ] dimensions ) { } private void search ( float [ ] coords , float [ ] dimensions , RTree < T > . Node n , LinkedList < T > results ) { } public boolean delete ( float [ ] coords , float [ ] dimensions , T entry ) { } public boolean delete ( float [ ] coords , T entry ) { } private RTree < T > . Node findLeaf ( RTree < T > . Node n , float [ ] coords , float [ ] dimensions , T entry ) { } private void condenseTree ( RTree < T > . Node n ) { } public void clear ( ) { } public void insert ( float [ ] coords , float [ ] dimensions , T entry ) { } public void insert ( float [ ] coords , T entry ) { } private void adjustTree ( RTree < T > . Node n , RTree < T > . Node nn ) { } private RTree < T > . Node [ ] splitNode ( RTree < T > . Node n ) { } private RTree < T > . Node [ ] qPickSeeds ( LinkedList < RTree < T > . Node > nn ) { } private RTree < T > . Node qPickNext ( LinkedList < RTree < T > . Node > cc , RTree < T > . Node [ ] nn ) { } private RTree < T > . Node [ ] lPickSeeds ( LinkedList < RTree < T > . Node > nn ) { } private RTree < T > . Node lPickNext ( LinkedList < RTree < T > . Node > cc ) { } private void tighten ( RTree < T > . Node ... nodes ) { assert ( nodes . length ) >= 1 : "Pass<seq2seq4repair_space>some<seq2seq4repair_space>nodes<seq2seq4repair_space>to<seq2seq4repair_space>tighten!" ; for ( RTree < T > . Node n : nodes ) { assert ( n . children . size ( ) ) > 0 : "tighten()<seq2seq4repair_space>called<seq2seq4repair_space>on<seq2seq4repair_space>empty<seq2seq4repair_space>node!" ; float [ ] minCoords = new float [ numDims ] ; float [ ] maxCoords = new float [ numDims ] ; for ( int i = 0 ; i < ( numDims ) ; i ++ ) { minCoords [ i ] = Float . MAX_VALUE ; <START_BUG> maxCoords [ i ] = Float . MIN_VALUE ; <END_BUG> for ( RTree < T > . Node c : n . children ) { c . parent = n ; if ( ( c . coords [ i ] ) < ( minCoords [ i ] ) ) { minCoords [ i ] = c . coords [ i ] ; } if ( ( ( c . coords [ i ] ) + ( c . dimensions [ i ] ) ) > ( maxCoords [ i ] ) ) { maxCoords [ i ] = ( c . coords [ i ] ) + ( c . dimensions [ i ] ) ; } } } for ( int i = 0 ; i < ( numDims ) ; i ++ ) { maxCoords [ i ] -= minCoords [ i ] ; } System . arraycopy ( minCoords , 0 , n . coords , 0 , numDims ) ; System . arraycopy ( maxCoords , 0 , n . dimensions , 0 , numDims ) ; } } private RTree < T > . Node chooseLeaf ( RTree < T > . Node n , RTree < T > . Entry e ) { } private float getRequiredExpansion ( float [ ] coords , float [ ] dimensions , RTree < T > . Node e ) { } private float getArea ( float [ ] dimensions ) { } private boolean isOverlap ( float [ ] scoords , float [ ] sdimensions , float [ ] coords , float [ ] dimensions ) { } private class Node { final float [ ] coords ; final float [ ] dimensions ; final LinkedList < RTree < T > . Node > children ; final boolean leaf ; RTree < T > . Node parent ; private Node ( float [ ] coords , float [ ] dimensions , boolean leaf ) { } } private class Entry extends RTree < T > . Node { final T entry ; public Entry ( float [ ] coords , float [ ] dimensions , T entry ) { } public String toString ( ) { } } private static final int elemWidth = 150 ; private static final int elemHeight = 120 ; String visualize ( ) { } private void visualize ( RTree < T > . Node n , PrintWriter pw , int x0 , int y0 , int w , int h ) { } }

Fix:
maxCoords [ i ] = ( - 1.0F ) * ( Float . MIN_VALUE ) ;