map -package:Cabal -package:base -package:case-insensitive -package:vector -package:blaze-html -package:hedgehog -package:regex-tdfa is:package

Not on Stackage, so not searched. Class of key-value maps
Syntax sugar for defining maps Haskell's canonical list of tuples syntax for defining maps is not very convenient and also has ambiguous semantics. This package leverages do notation to create a lighter syntax that makes semantics explicit and also allows the option of fail-fast handling of duplicate keys.
Not on Stackage, so not searched. foldl wrappers for map-reduce
Not on Stackage, so not searched. Efficient, polymorphic Map Algebra.
Not on Stackage, so not searched. A set of classes and instances for working with key/value mappings.
Not on Stackage, so not searched. Extensions to Data.Map
Not on Stackage, so not searched. A functional programming language focused around maps.
Not on Stackage, so not searched. Bindings to the MapQuest API
Not on Stackage, so not searched. Mapping
Not on Stackage, so not searched. mapWith: like fmap, but with additional parameters (isFirst, isLast, etc).
Bidirectional mapping between two key types A data structure representing a bidirectional mapping between two key types. Each value in the bimap is associated with exactly one value of the opposite type.
Dependent finite maps (partial dependent products) Provides a type called DMap which generalizes Data.Map.Map, allowing keys to specify the type of value that can be associated with them.
Much safer replacement for QSemN, QSem, and SampleVar This provides a much safer semaphore than the QSem, QSemN, SampleVar in base. Those base modules are not exception safe and can be broken by killThread. See https://github.com/ChrisKuklewicz/SafeSemaphore for more details.
Memory mapped files for POSIX and Windows This library provides a wrapper to mmap(2) or MapViewOfFile, allowing files or devices to be lazily loaded into memory as strict or lazy ByteStrings, ForeignPtrs or plain Ptrs, using the virtual memory subsystem to do on-demand loading. Modifications are also supported.
A multimap. This is a simple implementation of a multimap, based on Data.Map.
  • v1.1 ! had its arguments flipped. Fixed. Also added fromMap.
  • v1.2 Added Data.SetMap, renamed Multimap to Data.MultiMap. Fixed the type of delete. Derive instances for Data and Typeable.
  • v1.2.1 Fixed typos in the documentation.
Persistent containers Map and Set based on hashing. An implementation of persistent Map and Set containers based on hashing. The implementation is build on top of Data.IntMap.IntMap and Data.IntSet.IntSet, with very similar API. It uses Hashable class from the hashable package for hashing. This package can be used as a drop-in replacement for Data.Map and Data.Set modules. The Map key value is an Data.IntMap.IntMap indexed by the hash value, containing either one (key, value) or a Data.Map.Map key value for all keys with the same hash value. The Set elem is an Data.IntMap.IntMap indexed by the hash value, containing either one elem or Data.Set.Set elem for all elements with the same hash value.
Not on Stackage, so not searched. A library for handling and manipulating bitmaps (rectangular pixel arrays).
IntMap and IntSet with Enum keys/elements. This package contains simple wrappers around Data.IntMap and Data.IntSet with Enum keys and elements respectively. Especially useful for Ints wrapped with `newtype`.
bijections with multiple implementations. Bijections between sets of values.
mmap support for strict ByteStrings This library provides a wrapper to mmap(2), allowing files or devices to be lazily loaded into memory as strict or lazy ByteStrings, using the virtual memory subsystem to do on-demand loading.
Not on Stackage, so not searched. Efficient implementation of a dependent map with types as keys
Not on Stackage, so not searched. OpenGL support for Data.Bitmap.
Concurrent, order-preserving mapping Conduit Provides a Conduit that maps a function concurrently over incoming elements, maintaining input order.
Not on Stackage, so not searched. Native, complete-ish, matrix-free linear algebra.
Containers for intervals, with efficient search. Ordered containers of intervals, with efficient search for all keys containing a point or overlapping an interval. See the example code on the home page for a quick introduction.