map -package:base -is:exact -is:exact -package:text -package:unordered-containers -package:case-insensitive -package:containers is:module -package:range-set-list

Contains implementation of polymorphic type classes for data types Set and Map.

Strict Map. Import as:

import qualified RIO.Map as Map

This module does not export any partial or unchecked functions. For those, see RIO.Map.Partial and RIO.Map.Unchecked

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

Map type used to represent records and unions

Bijections via strict maps.

Utilities for mapping or transforming Exprs.

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:

• 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"

Operations have a worst-case complexity of O(log n), with a base equal to the size of the native Word.

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