Hoogle Search

Within Stackage Nightly 2025-10-09 (ghc-9.12.2)

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

Exact lookup

1. unifiedOffset :: (Indexed sh, Checking check) => sh -> Index sh -> Result check Int

   comfort-array	Data.Array.Comfort.Shape

   No documentation available.

2. unifiedSizeOffset :: (Indexed sh, Checking check) => sh -> (Int, Index sh -> Result check Int)

   comfort-array	Data.Array.Comfort.Shape

   No documentation available.

3. takeIntSet :: (Indexed sh, Index sh ~ Int, Storable a) => IntSet -> Array sh a -> Array IntSet a

   comfort-array	Data.Array.Comfort.Storable

   >>> Array.takeIntSet (IntSet.fromList [0,2,4,7,13]) (Array.vectorFromList [3,1,4,1,5,9,2,6,5,3,5,8,9,7,9,3::Word8])
   StorableArray... (... [0,2,4,7,13]) [3,4,5,6,7]
   

4. takeSet :: (Indexed sh, Index sh ~ ix, Ord ix, Storable a) => Set ix -> Array sh a -> Array (Set ix) a

   comfort-array	Data.Array.Comfort.Storable

   >>> Array.takeSet (Set.fromList [0,2,4,7,13]) (Array.vectorFromList [3,1,4,1,5,9,2,6,5,3,5,8,9,7,9,3::Word8])
   StorableArray... (... [0,2,4,7,13]) [3,4,5,6,7]
   

5. class SetContainer set => HasKeysSet set

   mono-traversable	Data.Containers

   Type class for maps whose keys can be converted into sets.

6. class (SetContainer set, Element set ~ ContainerKey set) => IsSet set

   mono-traversable	Data.Containers

   Polymorphic typeclass for interacting with different set types

7. deleteSet :: IsSet set => Element set -> set -> set

   mono-traversable	Data.Containers

   Delete a value from a set.

8. filterSet :: IsSet set => (Element set -> Bool) -> set -> set

   mono-traversable	Data.Containers

   Filter values in a set.

9. insertSet :: IsSet set => Element set -> set -> set

   mono-traversable	Data.Containers

   Insert a value into a set.

10. keysSet :: HasKeysSet set => set -> KeySet set

    mono-traversable	Data.Containers

    Convert a map into a set of its keys.

Page 95 of many | Previous | Next