HaskellWorks.Data.Segment.Strict

Documentation

data Segment k

A closed segment. The lower bound should be less than or equal to the higher bound.

Constructors

Segment

Fields

• low :: !k
• high :: !k

Instances

Monoid k => Measured k (Segment k)

Methods

measure :: Segment k -> k

Eq k => Eq (Segment k)

Methods

(==) :: Segment k -> Segment k -> Bool

(/=) :: Segment k -> Segment k -> Bool

Ord k => Ord (Segment k)

Methods

compare :: Segment k -> Segment k -> Ordering

(<) :: Segment k -> Segment k -> Bool

(<=) :: Segment k -> Segment k -> Bool

(>) :: Segment k -> Segment k -> Bool

(>=) :: Segment k -> Segment k -> Bool

max :: Segment k -> Segment k -> Segment k

min :: Segment k -> Segment k -> Segment k

Show k => Show (Segment k)

Methods

showsPrec :: Int -> Segment k -> ShowS

show :: Segment k -> String

showList :: [Segment k] -> ShowS

Generic (Segment k)

Associated Types

type Rep (Segment k) :: * -> *

Methods

from :: Segment k -> Rep (Segment k) x

to :: Rep (Segment k) x -> Segment k

NFData k => NFData (Segment k)

Methods

rnf :: Segment k -> ()

type Rep (Segment k)

type Rep (Segment k) = D1 * (MetaData "Segment" "HaskellWorks.Data.Segment.Strict" "hw-fingertree-strict-0.1.1.0-BC7rHFKaflB3QI1ck3u9LV" False) (C1 * (MetaCons "Segment" PrefixI True) ((:*:) * (S1 * (MetaSel (Just Symbol "low") NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 * k)) (S1 * (MetaSel (Just Symbol "high") NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 * k))))

point :: k -> Segment k

A segment in which the lower and upper bounds are equal.