Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. module Data.SortedList

   This module defines a type for sorted lists, together with several functions to create and use values of that type. Many operations are optimized to take advantage of the list being sorted.

2. data SortedList a

   sorted-list	Data.SortedList

   Type of sorted lists. Any (non-bottom) value of this type is a sorted list. Use the Monoid instance to merge sorted lists.

3. fromSortedList :: SortedList a -> [a]

   sorted-list	Data.SortedList

   O(1). Create a list from a SortedList. The returned list is guaranteed to be sorted.

4. toSortedList :: Ord a => [a] -> SortedList a

   sorted-list	Data.SortedList

   Create a SortedList by sorting a regular list.

5. locOfList :: Located a => [a] -> Loc

   srcloc	Data.Loc

   No documentation available.

6. promotedTupleFromList :: Quote m => [m Type] -> m Type

   typelevel-tools-yj	Data.TypeLevel.List.TH

   No documentation available.

7. tupleFromList :: Quote m => [m Type] -> m Type

   typelevel-tools-yj	Data.TypeLevel.List.TH

   No documentation available.

8. freeList :: FrozenDictionary (ks :: Type -> Type) k (vs :: Type -> Type) v -> !Int

   vector-hashtables	Data.Vector.Hashtables

   No documentation available.

9. fromList :: forall (ks :: Type -> Type -> Type) k (vs :: Type -> Type -> Type) v m . (MVector ks k, MVector vs v, PrimMonad m, Hashable k, Eq k) => [(k, v)] -> m (Dictionary (PrimState m) ks k vs v)

   vector-hashtables	Data.Vector.Hashtables

   O(n) Convert list to a Dictionary.

10. toList :: forall (ks :: Type -> Type -> Type) k (vs :: Type -> Type -> Type) v m . (MVector ks k, MVector vs v, PrimMonad m, Hashable k, Eq k) => Dictionary (PrimState m) ks k vs v -> m [(k, v)]

    vector-hashtables	Data.Vector.Hashtables

    O(n) Convert Dictionary to a list.

Page 153 of many | Previous | Next