public List < Node < K , V > > stab ( K k ) { Interval < K > i = new Interval < K > ( k , true , k , true ) ; final List < Node < K , V > > nodes = new ArrayList < Node < K , V > > ( ) ; findOverlap ( root . left , i , new NodeCallback < K , V > ( ) { @ Override public void handle ( Node < K , V > node ) { nodes . add ( node ) ; } } ) ; return nodes ; }
Find all Intervals that contain a given value .