Map < SkyKey , NodeEntry > function ( Iterable < SkyKey > arg0 , QueryableGraph arg1 ) { Map < SkyKey , NodeEntry > loc0 = arg1 . getBatch ( arg0 ) ; for ( Map . Entry < SkyKey , NodeEntry > loc1 : loc0 . entrySet ( ) ) { Preconditions . checkState ( loc1 . getValue ( ) . isDone ( ) , loc1 ) ; } return loc0 ; }
returns a map giving the nodeentry corresponding to the given keys . if there is no node in the graph corresponding to a skykey in keys , it is silently ignored and will not be present in the returned map . this tolerance allows callers to avoid pre-filtering their keys by checking for existence , which can be expensive . concode_field_sep Function<NodeEntry,SkyValue> GET_SKY_VALUE_FUNCTION concode_elem_sep QueryableGraph fullGraph concode_elem_sep QueryableGraph thinGraph concode_field_sep SkyValue getValue concode_elem_sep Map<SkyKey,SkyValue> getSuccessfulValues concode_elem_sep Map<SkyKey,Iterable<SkyKey>> getDirectDeps concode_elem_sep Exception getException concode_elem_sep SkyValue apply concode_elem_sep boolean exists concode_elem_sep Map<SkyKey,Exception> getMissingAndExceptions concode_elem_sep NodeEntry getEntry concode_elem_sep Map<SkyKey,Iterable<SkyKey>> getReverseDeps