SDP.Sort

Contents

Description

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

Synopsis

class Sort s e | s -> e where
- sortedBy :: (e -> e -> Bool) -> s -> Bool
- sortBy :: Compare e -> s -> s
sort :: (Sort s e, Ord e) => s -> s
sortOn :: (Sort s e, Ord o) => (e -> o) -> s -> s
sorted :: (Sort s e, Ord e) => s -> Bool
sortedOn :: (Sort s e, Ord o) => (e -> o) -> s -> Bool

Sort

class Sort s e | s -> e where Source #

Sort is class of types that can be sorted.

Methods

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

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

sortBy function is common sorting algorithm.

Instances details

Sort [a] a Source #
Instance details Defined in SDP.Sort Methods sortedBy :: (a -> a -> Bool) -> [a] -> Bool Source # sortBy :: Compare a -> [a] -> [a] Source #
Unboxed e => Sort (SBytes# e) e Source #
Instance details Defined in SDP.Prim.SBytes Methods sortedBy :: (e -> e -> Bool) -> SBytes# e -> Bool Source # sortBy :: Compare e -> SBytes# e -> SBytes# e Source #
Sort (SArray# e) e Source #
Instance details Defined in SDP.Prim.SArray Methods sortedBy :: (e -> e -> Bool) -> SArray# e -> Bool Source # sortBy :: Compare e -> SArray# e -> SArray# e Source #
Sort (Unlist e) e Source #
Instance details Defined in SDP.Unrolled.Unlist Methods sortedBy :: (e -> e -> Bool) -> Unlist e -> Bool Source # sortBy :: Compare e -> Unlist e -> Unlist e Source #
Unboxed e => Sort (Ublist e) e Source #
Instance details Defined in SDP.ByteList.Ublist Methods sortedBy :: (e -> e -> Bool) -> Ublist e -> Bool Source # sortBy :: Compare e -> Ublist e -> Ublist e Source #
(Index i, Sort (rep e) e) => Sort (AnyBorder rep i e) e Source #
Instance details Defined in SDP.Templates.AnyBorder Methods sortedBy :: (e -> e -> Bool) -> AnyBorder rep i e -> Bool Source # sortBy :: Compare e -> AnyBorder rep i e -> AnyBorder rep i e Source #

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

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

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

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

Checks if the structure is sorted.

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

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