Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
getMonoidalIntMap :: MonoidalIntMap a -> IntMap amonoidal-containers Data.IntMap.Monoidal No documentation available.
-
monoidal-containers Data.IntMap.Monoidal.Strict An IntMap with monoidal accumulation
MonoidalIntMap :: IntMap a -> MonoidalIntMap amonoidal-containers Data.IntMap.Monoidal.Strict No documentation available.
getMonoidalIntMap :: MonoidalIntMap a -> IntMap amonoidal-containers Data.IntMap.Monoidal.Strict No documentation available.
-
nonempty-containers Data.IntMap.NonEmpty A non-empty (by construction) map from integer keys to values a. At least one key-value pair exists in an NEIntMap v at all times. Functions that take an NEIntMap can safely operate on it with the assumption that it has at least one key-value pair. Functions that return an NEIntMap provide an assurance that the result has at least one key-value pair. Data.IntMap.NonEmpty re-exports the API of Data.IntMap, faithfully reproducing asymptotics, typeclass constraints, and semantics. Functions that ensure that input and output maps are both non-empty (like insert) return NEIntMap, but functions that might potentially return an empty map (like delete) return a IntMap instead. You can directly construct an NEIntMap with the API from Data.IntMap.NonEmpty; it's more or less the same as constructing a normal IntMap, except you don't have access to empty. There are also a few ways to construct an NEIntMap from a IntMap:
- The nonEmptyMap smart constructor will convert a IntMap k a into a Maybe (NEIntMap k a), returning Nothing if the original IntMap was empty.
- You can use the insertIntMap family of functions to insert a value into a IntMap to create a guaranteed NEIntMap.
- You can use the IsNonEmpty and IsEmpty patterns to "pattern match" on a IntMap to reveal it as either containing a NEIntMap or an empty map.
- withNonEmpty offers a continuation-based interface for deconstructing a IntMap and treating it as if it were an NEIntMap.
-
nonempty-containers Data.IntMap.NonEmpty.Internal A non-empty (by construction) map from integer keys to values a. At least one key-value pair exists in an NEIntMap v at all times. Functions that take an NEIntMap can safely operate on it with the assumption that it has at least one key-value pair. Functions that return an NEIntMap provide an assurance that the result has at least one key-value pair. Data.IntMap.NonEmpty re-exports the API of Data.IntMap, faithfully reproducing asymptotics, typeclass constraints, and semantics. Functions that ensure that input and output maps are both non-empty (like insert) return NEIntMap, but functions that might potentially return an empty map (like delete) return a IntMap instead. You can directly construct an NEIntMap with the API from Data.IntMap.NonEmpty; it's more or less the same as constructing a normal IntMap, except you don't have access to empty. There are also a few ways to construct an NEIntMap from a IntMap:
- The nonEmptyMap smart constructor will convert a IntMap k a into a Maybe (NEIntMap k a), returning Nothing if the original IntMap was empty.
- You can use the insertIntMap family of functions to insert a value into a IntMap to create a guaranteed NEIntMap.
- You can use the IsNonEmpty and IsEmpty patterns to "pattern match" on a IntMap to reveal it as either containing a NEIntMap or an empty map.
- withNonEmpty offers a continuation-based interface for deconstructing a IntMap and treating it as if it were an NEIntMap.
NEIntMap :: Key -> a -> !IntMap a -> NEIntMap anonempty-containers Data.IntMap.NonEmpty.Internal No documentation available.
neimIntMap :: NEIntMap a -> !IntMap anonempty-containers Data.IntMap.NonEmpty.Internal No documentation available.
dmapToIntMap :: DMap (Const2 Key v) Identity -> IntMap vpatch Data.Functor.Misc -
patch Data.Patch Patch for IntMap which represents insertion or deletion of keys in the mapping. Internally represented by 'IntMap (Maybe a)', where Just means insert/update and Nothing means delete.