- You will eventually need all the values stored.
- The stored values don't represent large virtual data structures to be lazily computed.

import qualified Data.Map as MapThe implementation of Map is based on

- Stephen Adams, "
*Efficient sets: a balancing act*", Journal of Functional Programming 3(4):553-562, October 1993, http://www.swiss.ai.mit.edu/~adams/BB/. - J. Nievergelt and E.M. Reingold, "
*Binary search trees of bounded balance*", SIAM journal of computing 2(1), March 1973.

- Guy Blelloch, Daniel Ferizovic, and Yihan Sun, "
*Just Join for Parallel Ordered Sets*", https://arxiv.org/abs/1602.02120v3.

Instances to convert between Map and association list.
Copyright (C) 2009-2011 John Goerzen jgoerzen@complete.org
All rights reserved.
For license and copyright information, see the file LICENSE

Strict `Map`. Import as:

import qualified RIO.Map as MapThis module does not export any partial or unchecked functions. For those, see RIO.Map.Partial and RIO.Map.Unchecked

A non-blocking concurrent map from hashable keys to values.
The implementation is based on *lock-free concurrent hash tries*
(aka *Ctries*) as described by:
*O(log n)*, with a
base equal to the size of the native Word.

- Aleksander Prokopec, Phil Bagwell, Martin Odersky, "
*Cache-Aware Lock-Free Concurent Hash Tries*" - Aleksander Prokopec, Nathan G. Bronson, Phil Bagwell, Martin
Odersky "
*Concurrent Tries with Efficient Non-Blocking Snapshots*"

A slightly less trivial implementation of range sets.
This is nearly identical to Data.RangeSet.List except for some
important performance differences:

- Most query functions in this module are
*O(log n)*rather than*O(n)*, so may be much faster. - Most composition functions have the same time complexity but a higher constant, so may be somewhat slower.

import Data.RangeSet.Map (RSet) import qualified Data.RangeSet.Map as RSetThe implementation of RSet is based on Data.Map.Strict.

Maps that handle pairs of amplitudes and sampled values. They are a
special form of arrows.