private ConcurrentSkipListMap.Node<K,V> hiNode(){
  if (hi == null)   return m.findLast();
 else   if (hiInclusive)   return m.findNear(hi,LT | EQ);
 else   return m.findNear(hi,LT);
}

private ConcurrentSkipListMap . Node < K , V > hiNode ( ) { if ( hi == null ) return m . findLast ( ) ; else if ( hiInclusive ) return m . findNear ( hi , LT | EQ ) ; else return m . findNear ( hi , LT ) ; }
returns highest node . this node might not be in range , so most usages need to check bounds .
