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