Hoogle Search

Within LTS Haskell 24.19 (ghc-9.10.3)

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

Exact lookup

1. insertMapMax :: Key -> a -> IntMap a -> NEIntMap a

   nonempty-containers	Data.IntMap.NonEmpty

   O(log n) Convert a IntMap into an NEIntMap by adding a key-value pair where the key is strictly greater than all keys in the input map. The keys in the original map must all be strictly less than the new key. The precondition is not checked. At the current moment, this is identical simply insertMap; however, it is left both for consistency and as a placeholder for a future version where optimizations are implemented to allow for a faster implementation.

   insertMap 7 "c" (Data.IntMap.fromList [(5,"a"), (3,"b")]) == fromList ((3,"b") :| [(5,"a"), (7,"c")])
   

2. insertMapMin :: Key -> a -> IntMap a -> NEIntMap a

   nonempty-containers	Data.IntMap.NonEmpty

   O(1) Convert a IntMap into an NEIntMap by adding a key-value pair where the key is strictly less than all keys in the input map. The keys in the original map must all be strictly greater than the new key. The precondition is not checked.

   insertMapMin 2 "c" (Data.IntMap.fromList [(5,"a"), (3,"b")]) == fromList ((2,"c") :| [(3,"b"), (5,"a")])
   valid (insertMapMin 2 "c" (Data.IntMap.fromList [(5,"a"), (3,"b")])) == True
   valid (insertMapMin 7 "c" (Data.IntMap.fromList [(5,"a"), (3,"b")])) == False
   valid (insertMapMin 3 "c" (Data.IntMap.fromList [(5,"a"), (3,"b")])) == False
   

3. insertMapMax :: k -> a -> Map k a -> NEMap k a

   nonempty-containers	Data.Map.NonEmpty

   O(log n) Convert a Map into an NEMap by adding a key-value pair where the key is strictly greater than all keys in the input map. The keys in the original map must all be strictly less than the new key. The precondition is not checked. While this has the same asymptotics as insertMap, it saves a constant factor for key comparison (so may be helpful if comparison is expensive) and also does not require an Ord instance for the key type.

   insertMap 7 "c" (Data.Map.fromList [(5,"a"), (3,"b")]) == fromList ((3,"b") :| [(5,"a"), (7,"c")])
   valid (insertMap 7 "c" (Data.Map.fromList [(5,"a"), (3,"b")])) == True
   valid (insertMap 2 "c" (Data.Map.fromList [(5,"a"), (3,"b")])) == False
   valid (insertMap 5 "c" (Data.Map.fromList [(5,"a"), (3,"b")])) == False
   

4. insertMapMin :: k -> a -> Map k a -> NEMap k a

   nonempty-containers	Data.Map.NonEmpty

   O(1) Convert a Map into an NEMap by adding a key-value pair where the key is strictly less than all keys in the input map. The keys in the original map must all be strictly greater than the new key. The precondition is not checked.

   insertMapMin 2 "c" (Data.Map.fromList [(5,"a"), (3,"b")]) == fromList ((2,"c") :| [(3,"b"), (5,"a")])
   valid (insertMapMin 2 "c" (Data.Map.fromList [(5,"a"), (3,"b")])) == True
   valid (insertMapMin 7 "c" (Data.Map.fromList [(5,"a"), (3,"b")])) == False
   valid (insertMapMin 3 "c" (Data.Map.fromList [(5,"a"), (3,"b")])) == False
   

5. nodeInfoMapMFrom :: Functor f => (From k v -> f (From k v)) -> NodeInfo k v -> f (NodeInfo k v)

   patch	Data.Patch.MapWithMove

   Change the From value of a NodeInfo, using a Functor (or Applicative, Monad, etc.) action to get the new value

6. nodeInfoMapMFrom :: Functor f => (From k v -> f (From k v)) -> NodeInfo k v -> f (NodeInfo k v)

   patch	Data.Patch.MapWithPatchingMove

   Change the From value of a NodeInfo, using a Functor (or Applicative, Monad, etc.) action to get the new value

7. imapM :: Monad m => (Int -> a -> m b) -> Vector a -> m (Vector b)

   rebase	Rebase.Data.Vector

   No documentation available.

8. imapM_ :: Monad m => (Int -> a -> m b) -> Vector a -> m ()

   rebase	Rebase.Data.Vector

   No documentation available.

9. imapMaybe :: (Int -> a -> Maybe b) -> Vector a -> Vector b

   rebase	Rebase.Data.Vector

   No documentation available.

10. imapMaybeM :: Monad m => (Int -> a -> m (Maybe b)) -> Vector a -> m (Vector b)

    rebase	Rebase.Data.Vector

    No documentation available.

Page 83 of many | Previous | Next