A map-like structure with the following quirks:
- each key is associated with a vector of all values inserted at that key.
- `count' returns the sum of lengths of all vector values.
- it works as a priority-map, sorting each key by the length of its associated vector.
- Corollary: `first' returns the entry with the longest value vector.