question: private FastConcurrentSkipListMap . Node < K , V > loNode ( ) { if ( lo == null ) return m . findFirst ( ) ; else if ( loInclusive ) return m . findNear ( lo , m . GT | m . EQ ) ; else return m . findNear ( lo , m . GT ) ; }
target:  Returns lowest node. This node might not be in range, so most usages need to check bounds