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.

Exact lookup

1. ppIntMap :: Pretty a => IntMap a -> Doc ann

   prettyprinter-combinators	Prettyprinter.Combinators

   No documentation available.

2. ppIntMapWith :: (Int -> Doc ann) -> (a -> Doc ann) -> IntMap a -> Doc ann

   prettyprinter-combinators	Prettyprinter.Combinators

   No documentation available.

3. C_IntMap :: forall (o :: Type -> Type) a1 . Elems o '[a1] -> Classifier_ o (IntMap a1)

   recover-rtti	Debug.RecoverRTTI

   No documentation available.

4. hoistIntMapWithKeyWithAdjust :: (Adjustable t m, MonadHold t m, Functor p, Patch (p (Behavior t Builder)), PatchTarget (p (Behavior t Builder)) ~ IntMap (Behavior t Builder)) => (forall x . () => (Key -> a -> m x) -> IntMap a -> Event t (p a) -> m (IntMap x, Event t (p x))) -> (Key -> a -> StaticDomBuilderT t m b) -> IntMap a -> Event t (p a) -> StaticDomBuilderT t m (IntMap b, Event t (p b))

   reflex-dom-core	Reflex.Dom.Builder.Static

   No documentation available.

5. openThingCheckpointMap :: Open a -> Map CheckpointId Substitution

   Agda	Agda.TypeChecking.Monad.Base

   No documentation available.

6. printMapSizes :: IO ()

   battleship-combinatorics	Combinatorics.Battleship.Count.ShortenShip

   No documentation available.

7. toIntMap :: [(Int, v)] -> IntMap v

   discrimination	Data.Discrimination

   O(n). Construct an IntMap.

   >>> toIntMap []
   fromList []
   

   >>> toIntMap [(5,"a"), (3,"b"), (5, "c")]
   fromList [(3,"b"),(5,"c")]
   

   >>> IntMap.fromList [(5,"a"), (3,"b"), (5, "c")]
   fromList [(3,"b"),(5,"c")]
   

   >>> toIntMap [(5,"c"), (3,"b"), (5, "a")]
   fromList [(3,"b"),(5,"a")]
   

   >>> IntMap.fromList [(5,"c"), (3,"b"), (5, "a")]
   fromList [(3,"b"),(5,"a")]
   

8. toIntMapWith :: (v -> v -> v) -> [(Int, v)] -> IntMap v

   discrimination	Data.Discrimination

   O(n). Construct an IntMap, combining values. This is an asymptotically faster version of fromListWith, which exploits ordered discrimination. (Note: values combine in anti-stable order for compatibility with fromListWith)

   >>> toIntMapWith (++) [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"c")]
   fromList [(3,"ab"),(5,"cba")]
   

   >>> IntMap.fromListWith (++) [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"c")]
   fromList [(3,"ab"),(5,"cba")]
   

   >>> toIntMapWith (++) []
   fromList []
   

9. toIntMapWithKey :: (Int -> v -> v -> v) -> [(Int, v)] -> IntMap v

   discrimination	Data.Discrimination

   O(n). Construct a Map, combining values with access to the key. This is an asymptotically faster version of fromListWithKey, which exploits ordered discrimination. (Note: the values combine in anti-stable order for compatibility with fromListWithKey)

   >>> let f key new_value old_value = show key ++ ":" ++ new_value ++ "|" ++ old_value
   
   >>> toIntMapWithKey f [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"c")]
   fromList [(3,"3:a|b"),(5,"5:c|5:b|a")]
   

   >>> IntMap.fromListWithKey f [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"c")]
   fromList [(3,"3:a|b"),(5,"5:c|5:b|a")]
   

   >>> toIntMapWithKey f []
   fromList []
   

10. toIntMap :: [(Int, v)] -> IntMap v

    discrimination	Data.Discrimination.Sorting

    O(n). Construct an IntMap.

    >>> toIntMap []
    fromList []
    

    >>> toIntMap [(5,"a"), (3,"b"), (5, "c")]
    fromList [(3,"b"),(5,"c")]
    

    >>> IntMap.fromList [(5,"a"), (3,"b"), (5, "c")]
    fromList [(3,"b"),(5,"c")]
    

    >>> toIntMap [(5,"c"), (3,"b"), (5, "a")]
    fromList [(3,"b"),(5,"a")]
    

    >>> IntMap.fromList [(5,"c"), (3,"b"), (5, "a")]
    fromList [(3,"b"),(5,"a")]
    

Page 11 of many | Previous | Next