public synchronized TreeEntry < K , V > pollFirstEntry ( ) { final TreeEntry < K , V > entry = firstEntry ( ) ; if ( entry != null ) { remove ( entry . getKey ( ) ) ; } return entry ; }
Removes and returns a key - value mapping associated with the least key in this map or null if the map is empty .