Key function ( Key arg0 ) { if ( arg0 == null ) throw new NullPointerException ( "srini_string" ) ; if ( st . containsKey ( arg0 ) ) return arg0 ; SortedMap < Key , Value > loc0 = st . headMap ( arg0 ) ; if ( loc0 . isEmpty ( ) ) throw new NoSuchElementException ( ) ; return loc0 . lastKey ( ) ; }
returns the largest key in the symbol table less than or equal to key . concode_field_sep TreeMap<Key,Value> st concode_field_sep boolean contains concode_elem_sep Iterator<Key> iterator concode_elem_sep Key min concode_elem_sep int size concode_elem_sep Key max concode_elem_sep Iterable<Key> keys concode_elem_sep Value get concode_elem_sep boolean isEmpty concode_elem_sep void main concode_elem_sep Key ceil concode_elem_sep void delete concode_elem_sep void put