Algorithms.Util

Documentation

data SP a b

Constructors

SP !a !b

Instances

(Eq a, Eq b) => Eq (SP a b)

Defined in Algorithms.Util

Methods

(==) :: SP a b -> SP a b -> Bool

(/=) :: SP a b -> SP a b -> Bool

(Ord a, Ord b) => Ord (SP a b)

Defined in Algorithms.Util

Methods

compare :: SP a b -> SP a b -> Ordering

(<) :: SP a b -> SP a b -> Bool

(<=) :: SP a b -> SP a b -> Bool

(>) :: SP a b -> SP a b -> Bool

(>=) :: SP a b -> SP a b -> Bool

max :: SP a b -> SP a b -> SP a b

min :: SP a b -> SP a b -> SP a b

(Show a, Show b) => Show (SP a b)

Defined in Algorithms.Util

Methods

showsPrec :: Int -> SP a b -> ShowS

show :: SP a b -> String

showList :: [SP a b] -> ShowS

uniquePairs :: [a] -> [SP a a]

Given a list xs, generate all unique (unordered) pairs.

nonEmptyTails :: [a] -> [[a]]

data ST a b c

Constructors

ST !a !b !c

Instances

(Eq a, Eq b, Eq c) => Eq (ST a b c)

Defined in Algorithms.Util

Methods

(==) :: ST a b c -> ST a b c -> Bool

(/=) :: ST a b c -> ST a b c -> Bool

(Ord a, Ord b, Ord c) => Ord (ST a b c)

Defined in Algorithms.Util

Methods

compare :: ST a b c -> ST a b c -> Ordering

(<) :: ST a b c -> ST a b c -> Bool

(<=) :: ST a b c -> ST a b c -> Bool

(>) :: ST a b c -> ST a b c -> Bool

(>=) :: ST a b c -> ST a b c -> Bool

max :: ST a b c -> ST a b c -> ST a b c

min :: ST a b c -> ST a b c -> ST a b c

(Show a, Show b, Show c) => Show (ST a b c)

Defined in Algorithms.Util

Methods

showsPrec :: Int -> ST a b c -> ShowS

show :: ST a b c -> String

showList :: [ST a b c] -> ShowS

uniqueTriplets :: [a] -> [ST a a a]

All unieuqe unordered triplets.