SDP.SortM

Contents

Description

SDP.SortM provides SortM - class of sortable mutable structures.

Synopsis

class SortM m s e | s -> m, s -> e where
- sortedMBy :: (e -> e -> Bool) -> s -> m Bool
- sortMBy :: Compare e -> s -> m ()
type SortM1 m s e = SortM m (s e) e
type SortM2 m s i e = SortM m (s i e)
type SortM' m s = forall e. SortM m (s e) e
type SortM'' m s = forall i e. SortM m (s i e)
sortM :: (SortM m s e, Ord e) => s -> m ()
sortMOn :: (SortM m s e, Ord o) => (e -> o) -> s -> m ()
sortedM :: (SortM m s e, Ord e) => s -> m Bool
sortedMOn :: (SortM m s e, Ord o) => (e -> o) -> s -> m Bool

SortM

class SortM m s e | s -> m, s -> e where Source #

SortM is class of sortable mutable structures.

Methods

sortedMBy :: (e -> e -> Bool) -> s -> m Bool Source #

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

sortMBy is common sorting algorithm.

Instances details

(MonadIO io, Unboxed e) => SortM io (MIOBytes# io e) e Source #
Instance details Defined in SDP.Prim.SBytes Methods sortedMBy :: (e -> e -> Bool) -> MIOBytes# io e -> io Bool Source # sortMBy :: Compare e -> MIOBytes# io e -> io () Source #
MonadIO io => SortM io (MIOArray# io e) e Source #
Instance details Defined in SDP.Prim.SArray Methods sortedMBy :: (e -> e -> Bool) -> MIOArray# io e -> io Bool Source # sortMBy :: Compare e -> MIOArray# io e -> io () Source #
(BorderedM1 m rep Int e, SortM1 m rep e, SplitM1 m rep e, LinearM1 m rep e) => SortM m (AnyChunks rep e) e Source #
Instance details Defined in SDP.Templates.AnyChunks Methods sortedMBy :: (e -> e -> Bool) -> AnyChunks rep e -> m Bool Source # sortMBy :: Compare e -> AnyChunks rep e -> m () Source #
(Index i, SortM1 m rep e) => SortM m (AnyBorder rep i e) e Source #
Instance details Defined in SDP.Templates.AnyBorder Methods sortedMBy :: (e -> e -> Bool) -> AnyBorder rep i e -> m Bool Source # sortMBy :: Compare e -> AnyBorder rep i e -> m () Source #
Unboxed e => SortM (ST s) (STBytes# s e) e Source #
Instance details Defined in SDP.Prim.SBytes Methods sortedMBy :: (e -> e -> Bool) -> STBytes# s e -> ST s Bool Source # sortMBy :: Compare e -> STBytes# s e -> ST s () Source #
SortM (ST s) (STArray# s e) e Source #
Instance details Defined in SDP.Prim.SArray Methods sortedMBy :: (e -> e -> Bool) -> STArray# s e -> ST s Bool Source # sortMBy :: Compare e -> STArray# s e -> ST s () Source #

type SortM1 m s e = SortM m (s e) e Source #

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

type SortM2 m s i e = SortM m (s i e) Source #

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

Rank 2 quantified constraints

GHC 8.6.1+ only

type SortM' m s = forall e. SortM m (s e) e Source #

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

type SortM'' m s = forall i e. SortM m (s i e) Source #

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

sortM :: (SortM m s e, Ord e) => s -> m () Source #

sortMOn :: (SortM m s e, Ord o) => (e -> o) -> s -> m () Source #

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

sortedM :: (SortM m s e, Ord e) => s -> m Bool Source #

Checks if the structure is sorted.

sortedMOn :: (SortM m s e, Ord o) => (e -> o) -> s -> m Bool Source #

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