Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

1. fromMap :: HashMap a () -> HashSet a

   unordered-containers	Data.HashSet.Internal

   Convert from the equivalent HashMap with () values.

   >>> HashSet.fromMap (HashMap.singleton 1 ())
   fromList [1]
   

2. toMap :: HashSet a -> HashMap a ()

   unordered-containers	Data.HashSet.Internal

   Convert to set to the equivalent HashMap with () values.

   >>> HashSet.toMap (HashSet.singleton 1)
   fromList [(1,())]
   

3. functionMap :: Function b => (a -> b) -> (b -> a) -> (a -> c) -> a :-> c

   tasty-quickcheck	Test.Tasty.QuickCheck

   The basic building block for Function instances. Provides a Function instance by mapping to and from a type that already has a Function instance.

4. shrinkMap :: Arbitrary a => (a -> b) -> (b -> a) -> b -> [b]

   tasty-quickcheck	Test.Tasty.QuickCheck

   Map a shrink function to another domain. This is handy if your data type has special invariants, but is almost isomorphic to some other type.

   shrinkOrderedList :: (Ord a, Arbitrary a) => [a] -> [[a]]
   shrinkOrderedList = shrinkMap sort id
   
   shrinkSet :: (Ord a, Arbitrary a) => Set a -> [Set a]
   shrinkSet = shrinkMap fromList toList
   

5. shrinkMapBy :: (a -> b) -> (b -> a) -> (a -> [a]) -> b -> [b]

   tasty-quickcheck	Test.Tasty.QuickCheck

   Non-overloaded version of shrinkMap.

6. suchThatMap :: Gen a -> (a -> Maybe b) -> Gen b

   tasty-quickcheck	Test.Tasty.QuickCheck

   Generates a value for which the given function returns a Just, and then applies the function.

7. ixmap :: (Ix i, Ix j) => (i, i) -> (i -> j) -> Array j e -> Array i e

   array	Data.Array

   No documentation available.

8. amap :: (IArray a e', IArray a e, Ix i) => (e' -> e) -> a i e' -> a i e

   array	Data.Array.Base

   Returns a new array derived from the original array by applying a function to each of the elements.

9. ixmap :: (IArray a e, Ix i, Ix j) => (i, i) -> (i -> j) -> a j e -> a i e

   array	Data.Array.Base

   Returns a new array derived from the original array by applying a function to each of the indices.

10. amap :: (IArray a e', IArray a e, Ix i) => (e' -> e) -> a i e' -> a i e

    array	Data.Array.IArray

    Returns a new array derived from the original array by applying a function to each of the elements.

Page 415 of many | Previous | Next