W.WMapThis module implements a map from weights to lists of computational states of same weight.
val empty : 'a tempty returns the empty map
optimum m returns None if m is empty and Some w if w is the best weight of the current computations stored in the map m.
val pp : Format.formatter -> 'a t -> unitpp fmt m pretty prints (a summary of) the map m on the formatter fmt.