HaskellWorks.Data.BalancedParens.RangeMinMax

Documentation

data RangeMinMax a

Constructors

RangeMinMax

Fields

• rangeMinMaxBP :: !a
• rangeMinMaxL0Min :: !(Vector Int8)
• rangeMinMaxL0Max :: !(Vector Int8)
• rangeMinMaxL0Excess :: !(Vector Int8)
• rangeMinMaxL1Min :: !(Vector Int16)
• rangeMinMaxL1Max :: !(Vector Int16)
• rangeMinMaxL1Excess :: !(Vector Int16)
• rangeMinMaxL2Min :: !(Vector Int16)
• rangeMinMaxL2Max :: !(Vector Int16)
• rangeMinMaxL2Excess :: !(Vector Int16)

Instances

TestBit a => TestBit (RangeMinMax a)

Methods

(.?.) :: RangeMinMax a -> Position -> Bool

BitLength a => BitLength (RangeMinMax a)

Methods

bitLength :: RangeMinMax a -> Count

endPosition :: RangeMinMax a -> Position

Rank0 a => Rank0 (RangeMinMax a)

Methods

rank0 :: RangeMinMax a -> Count -> Count

Rank1 a => Rank1 (RangeMinMax a)

Methods

rank1 :: RangeMinMax a -> Count -> Count

OpenAt a => OpenAt (RangeMinMax a)

Methods

openAt :: RangeMinMax a -> Count -> Bool

NewCloseAt a => NewCloseAt (RangeMinMax a)

Methods

newCloseAt :: RangeMinMax a -> Count -> Bool

FindOpenN a => FindOpenN (RangeMinMax a)

Methods

findOpenN :: RangeMinMax a -> Count -> Count -> Maybe Count

FindOpen (RangeMinMax a)

Methods

findOpen :: RangeMinMax a -> Count -> Maybe Count

Enclose (RangeMinMax a)

Methods

enclose :: RangeMinMax a -> Count -> Maybe Count

CloseAt a => CloseAt (RangeMinMax a)

Methods

closeAt :: RangeMinMax a -> Count -> Bool

(BitLength a, NewCloseAt a) => FindCloseN (RangeMinMax a)

Methods

findCloseN :: RangeMinMax a -> Count -> Count -> Maybe Count

(BitLength a, CloseAt a, NewCloseAt a, FindCloseN a) => FindClose (RangeMinMax a)

Methods

findClose :: RangeMinMax a -> Count -> Maybe Count

(BitLength a, NewCloseAt a, CloseAt a, OpenAt a, FindCloseN a) => BalancedParens (RangeMinMax a)

Methods

firstChild :: RangeMinMax a -> Count -> Maybe Count

nextSibling :: RangeMinMax a -> Count -> Maybe Count

parent :: RangeMinMax a -> Count -> Maybe Count

mkRangeMinMax :: AsVector64 a => a -> RangeMinMax a