pub fn map<V>(
    current: &mut V,
    new: V,
    key_comparators: &[fn(_: &V::Item, _: &V::Item) -> bool],
    merge_item: fn(_: &mut V::Item, _: V::Item)
)where
    V: AsOptVec,
Expand description

The list is treated as a map.

Any items with matching keys will be deep-merged. Any items in new that are not in current will be appended to current.