private boolean isBeforeEnd(ConcurrentSkipListMap.Node<K,V> n){
  if (n == null)   return false;
  if (hi == null)   return true;
  K k=n.key;
  if (k == null)   return true;
  int c=m.compare(k,hi);
  if (c > 0 || (c == 0 && !hiInclusive))   return false;
  return true;
}

private boolean isBeforeEnd ( ConcurrentSkipListMap . Node < K , V > n ) { if ( n == null ) return false ; if ( hi == null ) return true ; K k = n . key ; if ( k == null ) return true ; int c = m . compare ( k , hi ) ; if ( c > 0 || ( c == 0 && ! hiInclusive ) ) return false ; return true ; }
returns true if node key is less than upper bound of range .
