decreases the key value for a heap node , given the new value to take on . the structure of the heap may be changed and will not be consolidated . running time : o 1 amortized concode_field_sep Map<Object,Node> nodes concode_elem_sep Node parent concode_elem_sep Node min concode_elem_sep int size concode_elem_sep Node left concode_elem_sep int degree concode_elem_sep Object userObject concode_elem_sep Node right concode_elem_sep boolean mark concode_elem_sep double key concode_elem_sep Node child concode_field_sep Node removeMin concode_elem_sep double getKey concode_elem_sep void cut concode_elem_sep void consolidate concode_elem_sep boolean isEmpty concode_elem_sep void link concode_elem_sep void insert concode_elem_sep void cascadingCut concode_elem_sep mxFibonacciHeap union concode_elem_sep void delete concode_elem_sep Object getUserObject concode_elem_sep Node min concode_elem_sep int size concode_elem_sep void setUserObject concode_elem_sep Node getNode
void function ( Node arg0 , double arg1 ) { if ( arg1 > arg0 . key ) { throw new IllegalArgumentException ( "srini_string" ) ; } arg0 . key = arg1 ; Node loc0 = arg0 . parent ; if ( ( loc0 != null ) && ( arg0 . key < loc0 . key ) ) { cut ( arg0 , loc0 ) ; cascadingCut ( loc0 ) ; } if ( min == null || arg0 . key < min . key ) { min = arg0 ; } }