SDP.Sort

SDP.Sort provides Sort - class of sortable immutable structures.

Sort

class Sort s e | s -> e where

Sort is class of types that can be sorted.

Methods

sortedBy :: (e -> e -> Bool) -> s -> Bool

Checks if structure is already sorted. Should always return True for structures with less than 2 elements.

sortBy :: Compare e -> s -> s

sortBy function is common sorting algorithm.

Instances

Sort [a] a

Defined in SDP.Sort

Methods

sortedBy :: (a -> a -> Bool) -> [a] -> Bool

sortBy :: Compare a -> [a] -> [a]

Unboxed e => Sort (SBytes# e) e

Defined in SDP.Prim.SBytes

Methods

sortedBy :: (e -> e -> Bool) -> SBytes# e -> Bool

sortBy :: Compare e -> SBytes# e -> SBytes# e

Sort (SArray# e) e

Defined in SDP.Prim.SArray

Methods

sortedBy :: (e -> e -> Bool) -> SArray# e -> Bool

sortBy :: Compare e -> SArray# e -> SArray# e

Sort (Unlist e) e

Defined in SDP.Unrolled.Unlist

Methods

sortedBy :: (e -> e -> Bool) -> Unlist e -> Bool

sortBy :: Compare e -> Unlist e -> Unlist e

Unboxed e => Sort (Ublist e) e

Defined in SDP.ByteList.Ublist

Methods

sortedBy :: (e -> e -> Bool) -> Ublist e -> Bool

sortBy :: Compare e -> Ublist e -> Ublist e

(Index i, Sort (rep e) e) => Sort (AnyBorder rep i e) e

Defined in SDP.Templates.AnyBorder

Methods

sortedBy :: (e -> e -> Bool) -> AnyBorder rep i e -> Bool

sortBy :: Compare e -> AnyBorder rep i e -> AnyBorder rep i e

type Sort1 rep e = Sort (rep e)

Sort contraint for (Type -> Type)-kind types.

type Sort2 rep i e = Sort (rep i e)

Sort contraint for (Type -> Type -> Type)-kind types.

Rank 2 quantified constraints

GHC 8.6.1+ only

type Sort' rep = forall e. Sort (rep e)

Sort quantified contraint for (Type -> Type)-kind types.

type Sort'' rep = forall i e. Sort (rep i e)

Sort quantified contraint for (Type -> Type -> Type)-kind types.

Helpers

sort :: (Sort s e, Ord e) => s -> s

sort is just sortBy compare

sortOn :: (Sort s e, Ord o) => (e -> o) -> s -> s

Sort by comparing the results of a given function applied to each element.

sorted :: (Sort s e, Ord e) => s -> Bool

Checks if the structure is sorted.

sortedOn :: (Sort s e, Ord o) => (e -> o) -> s -> Bool

Sort by comparing the results of a given function applied to each element.