insertWith package:Agda

insertWith :: Ord n => (e -> e -> e) -> n -> n -> e -> Graph n e -> Graph n e

Agda Agda.Utils.Graph.AdjacencyMap.Unidirectional

insertWith f s t new inserts an edge from s to t into the graph. If there is already an edge from s to t with label old, then this edge gets replaced by an edge with label f new old, and otherwise the edge's label is new. O(log n).

insertWith :: Ord k => (v -> v -> v) -> [k] -> v -> Trie k v -> Trie k v

Agda Agda.Utils.Trie

Insert with function merging new value with old value.