Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. fromIntMap :: Storable a => IntMap a -> Array IntSet a

   comfort-array	Data.Array.Comfort.Storable

   No documentation available.

2. fromMap :: (Ord k, Storable a) => Map k a -> Array (Set k) a

   comfort-array	Data.Array.Comfort.Storable

   No documentation available.

3. toIntMap :: Storable a => Array IntSet a -> IntMap a

   comfort-array	Data.Array.Comfort.Storable

   No documentation available.

4. toMap :: (Ord k, Storable a) => Array (Set k) a -> Map k a

   comfort-array	Data.Array.Comfort.Storable

   No documentation available.

5. fmap' :: (Measured v1 a1, Measured v2 a2) => (a1 -> a2) -> FingerTree v1 a1 -> FingerTree v2 a2

   fingertree	Data.FingerTree

   Like fmap, but with constraints on the element types.

6. fmapWithContext :: (Measured v1 a1, Measured v2 a2) => (v1 -> a1 -> v1 -> a2) -> FingerTree v1 a1 -> FingerTree v2 a2

   fingertree	Data.FingerTree

   Map all elements of the tree with a function that also takes the measure of the prefix to the left and of the suffix to the right of the element.

7. fmapWithPos :: (Measured v1 a1, Measured v2 a2) => (v1 -> a1 -> a2) -> FingerTree v1 a1 -> FingerTree v2 a2

   fingertree	Data.FingerTree

   Map all elements of the tree with a function that also takes the measure of the prefix of the tree to the left of the element.

8. unsafeFmap :: (a -> b) -> FingerTree v a -> FingerTree v b

   fingertree	Data.FingerTree

   Like fmap, but safe only if the function preserves the measure.

9. data IntervalMap v a

   fingertree	Data.IntervalMap.FingerTree

   Map of closed intervals, possibly with duplicates.

10. fmapNTreeA :: (b -> Maybe b) -> LA (NTree b) (NTree b)

    hxt	Control.Arrow.NTreeEdit

    No documentation available.

Page 505 of many | Previous | Next