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.

Exact lookup

1. mapIndex :: (i -> j) -> T i name str -> T j name str

   wraxml	Text.XML.WraXML.Tree

   No documentation available.

2. mapTag :: Filter name str -> Filter i name str

   wraxml	Text.XML.WraXML.Tree

   No documentation available.

3. mapText :: (String -> String) -> T i name String -> T i name String

   wraxml	Text.XML.WraXML.Tree

   No documentation available.

4. mapTextA :: Applicative m => (String -> m String) -> FilterA m i name String

   wraxml	Text.XML.WraXML.Tree

   No documentation available.

5. mapAccum :: (a -> b -> (a, c)) -> a -> IntervalMap k b -> (a, IntervalMap k c)

   IntervalMap	Data.IntervalMap.Generic.Lazy

   O(n). The function mapAccum threads an accumulating argument through the map in ascending order of keys.

6. mapAccumRWithKey :: (a -> k -> b -> (a, c)) -> a -> IntervalMap k b -> (a, IntervalMap k c)

   IntervalMap	Data.IntervalMap.Generic.Lazy

   O(n). The function mapAccumRWithKey threads an accumulating argument through the map in descending order of keys.

7. mapAccumWithKey :: (a -> k -> b -> (a, c)) -> a -> IntervalMap k b -> (a, IntervalMap k c)

   IntervalMap	Data.IntervalMap.Generic.Lazy

   O(n). The function mapAccumWithKey threads an accumulating argument through the map in ascending order of keys.

8. mapEither :: Interval k e => (a -> Either b c) -> IntervalMap k a -> (IntervalMap k b, IntervalMap k c)

   IntervalMap	Data.IntervalMap.Generic.Lazy

   O(n). Map values and separate the Left and Right results.

9. mapEitherWithKey :: Interval i k => (i -> a -> Either b c) -> IntervalMap i a -> (IntervalMap i b, IntervalMap i c)

   IntervalMap	Data.IntervalMap.Generic.Lazy

   O(n). Map keys/values and separate the Left and Right results.

10. mapKeys :: (Interval k2 e, Ord k2) => (k1 -> k2) -> IntervalMap k1 a -> IntervalMap k2 a

    IntervalMap	Data.IntervalMap.Generic.Lazy

    O(n log n). mapKeys f s is the map obtained by applying f to each key of s. The size of the result may be smaller if f maps two or more distinct keys to the same new key. In this case the value at the smallest of these keys is retained.

Page 329 of many | Previous | Next