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. mkSortedList :: Ord a => [a] -> SortedList a

   diagrams-core	Diagrams.Core

   A smart constructor for the SortedList type, which sorts the input to ensure the SortedList invariant.

2. getSortedList :: SortedList a -> [a]

   diagrams-core	Diagrams.Core.Trace

   Project the (guaranteed sorted) list out of a SortedList wrapper.

3. mkSortedList :: Ord a => [a] -> SortedList a

   diagrams-core	Diagrams.Core.Trace

   A smart constructor for the SortedList type, which sorts the input to ensure the SortedList invariant.

4. onSortedList :: Ord b => ([a] -> [b]) -> SortedList a -> SortedList b

   diagrams-core	Diagrams.Core.Trace

   Apply a list function to a SortedList. The function need not result in a sorted list; the result will be sorted before being rewrapped as a SortedList.

5. unsafeOnSortedList :: ([a] -> [b]) -> SortedList a -> SortedList b

   diagrams-core	Diagrams.Core.Trace

   Apply an order-preserving list function to a SortedList. No sorts or checks are done.

6. sSort :: forall a (t :: NonEmpty a) . SOrd a => Sing t -> Sing (Apply (SortSym0 :: TyFun (NonEmpty a) (NonEmpty a) -> Type) t)

   singletons-base	Data.List.NonEmpty.Singletons

   No documentation available.

7. sSortBy :: forall a (t1 :: a ~> (a ~> Ordering)) (t2 :: NonEmpty a) . Sing t1 -> Sing t2 -> Sing (Apply (Apply (SortBySym0 :: TyFun (a ~> (a ~> Ordering)) (NonEmpty a ~> NonEmpty a) -> Type) t1) t2)

   singletons-base	Data.List.NonEmpty.Singletons

   No documentation available.

8. sSortWith :: forall a o (t1 :: a ~> o) (t2 :: NonEmpty a) . SOrd o => Sing t1 -> Sing t2 -> Sing (Apply (Apply (SortWithSym0 :: TyFun (a ~> o) (NonEmpty a ~> NonEmpty a) -> Type) t1) t2)

   singletons-base	Data.List.NonEmpty.Singletons

   No documentation available.

9. sSort :: forall a (t :: [a]) . SOrd a => Sing t -> Sing (Apply (SortSym0 :: TyFun [a] [a] -> Type) t)

   singletons-base	Data.List.Singletons

   No documentation available.

10. sSortBy :: forall a (t1 :: a ~> (a ~> Ordering)) (t2 :: [a]) . Sing t1 -> Sing t2 -> Sing (Apply (Apply (SortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) t1) t2)

    singletons-base	Data.List.Singletons

    No documentation available.

Page 116 of many | Previous | Next