Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Map :: EDNMap -> Value

hedn Data.EDN.AST.Types.Value
```
{:a map}
```
data Map ph k v

justified-containers Data.Map.Justified

A Data.Map Map wrapper that allows direct lookup of keys that are known to exist in the map. Here, "direct lookup" means that once a key has been proven to exist in the map, it can be used to extract a value directly from the map, rather than requiring a Maybe layer. Map allows you to shift the burden of proof that a key exists in a map from "prove at every lookup" to "prove once per key".
Map :: Schema -> Schema

language-avro Language.Avro.Types

No documentation available.
module Control.Monad.Trans.Memo.Map

Specialization of MemoStateT with Map as a container
module Opaleye.Internal.Map

No documentation available.
type family Map f x

opaleye Opaleye.Internal.Map

No documentation available.
module Data.RangeSet.Map

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.
If you're mainly calling member, you should consider using this module, but if you're calling union, deleteRange, and other range manipulation functions as often as querying, you might stick with the list implementation. This module is intended to be imported qualified, to avoid name clashes with Prelude functions, e.g.
```
import Data.RangeSet.Map (RSet)
import qualified Data.RangeSet.Map as RSet
```
The implementation of RSet is based on Data.Map.Strict.
module Data.Recursive.Map

The type RMap a b is like Map a b, but allows recursive definitions:
```
>>> :{
let m1 = RM.insert 23 "Hello" m2
m2 = RM.insert 42 "World" m1
in RM.get m1
:}
fromList [(23,"Hello"),(42,"World")]
```
All functions in this API are monotone with regard to the ordering of maps that uses the discrete order on its elements. Furthermore, we only include functions where the key set does not depend on the actual values of the maps. This means that maps defined recursively using functions like insertWith can be used to construct cyclic data structures:
```
>>> :{
let m = RM.insertWith (++) 23 "Hi" m
in take 20 $ RM.get m M.! 23
:}
"HiHiHiHiHiHiHiHiHiHi"
```
And because the APIs provided by this package work similar to cyclic data structures, we can use them inside these maps:
```
>>> :{
let m = RM.insertWith RS.union 23 (RS.singleton "Hi") m
in RM.get m
:}
fromList [(23,fromList ["Hi"])]
```
I am looking for a concice but useful example for this feature to be put here! An alternative would be to order these maps using a pointwise order on the maps of elements (and do a simple fixed-point iteration underneath). But then we could not provide a general unionWith function, because not every function passed to it would be monotone.
data Map k a

stratosphere Stratosphere.ResourceImports

A Map from keys k to values a. The Semigroup operation for Map is union, which prefers values from the left operand. If m1 maps a key k to a value a1, and m2 maps the same key to a different value a2, then their union m1 <> m2 maps k to a1.
type Map = Char -> Text

stringprep Text.StringPrep

No documentation available.

hedn	Data.EDN.AST.Types.Value

justified-containers	Data.Map.Justified

language-avro	Language.Avro.Types

opaleye	Opaleye.Internal.Map

stratosphere	Stratosphere.ResourceImports

stringprep	Text.StringPrep

Page 45 of many | Previous | Next