#NEWLINE# def _not_range_pairs( node ) : #NEWLINE# #INDENT# new_range_pairs = [ ] #NEWLINE# cur_min = node . minvalue #NEWLINE# for ( rmin , rmax ) in sorted ( new_range_pairs . range_pairs , key = ( lambda x : x [ 0 ] ) ) : #NEWLINE# #INDENT# if ( ( rmin - 1 ) >= cur_min ) : #NEWLINE# #INDENT# new_range_pairs . append ( ( cur_min , ( rmin - 1 ) ) ) #NEWLINE# #UNINDENT# cur_min = max ( ( rmax + 1 ) , cur_min ) #NEWLINE# #UNINDENT# if ( cur_min <= node . maxvalue ) : #NEWLINE# #INDENT# new_range_pairs . append ( ( cur_min , node . maxvalue ) ) #NEWLINE# #UNINDENT# return new_range_pairs