Hoogle Search

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

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

Exact lookup

1. categoryCharSet :: Category -> CharSet

   charset	Data.CharSet.Unicode.Category

   No documentation available.

2. lookupCategoryCharSet :: String -> Maybe CharSet

   charset	Data.CharSet.Unicode.Category

   No documentation available.

3. offset :: Slice (arr :: Type -> Type) a -> {-# UNPACK #-} !Int

   contiguous	Data.Primitive.Contiguous.Class

   No documentation available.

4. offsetMut :: MutableSlice (arr :: Type -> Type) s a -> {-# UNPACK #-} !Int

   contiguous	Data.Primitive.Contiguous.Class

   No documentation available.

5. insertSet :: Ord a => a -> [a] -> [a]

   data-ordlist	Data.List.Ordered

   The insertSet function inserts an element into an ordered list. If the element is already there, then the element replaces the existing element.

6. insertSetBy :: (a -> a -> Ordering) -> a -> [a] -> [a]

   data-ordlist	Data.List.Ordered

   The insertSetBy function is the non-overloaded version of insertSet.

7. subset :: Ord a => [a] -> [a] -> Bool

   data-ordlist	Data.List.Ordered

   The subset function returns true if the first list is a sub-list of the second.

8. subsetBy :: (a -> a -> Ordering) -> [a] -> [a] -> Bool

   data-ordlist	Data.List.Ordered

   The subsetBy function is the non-overloaded version of subset.

9. module Data.EnumBitSet

   Similar to Data.Edison.Coll.EnumSet but it allows to choose the underlying type for bit storage. This is really a low-level module for type-safe foreign function interfaces. The integer representation of the enumeration type is the bit position of the flag within the bitvector.

10. subset :: (Enum a, Bits w) => T w a -> T w a -> Bool

    enumset	Data.EnumBitSet

    subset a b is True if a is a subset of b.

Page 118 of many | Previous | Next