toy-lib-0.1.0.0

Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.SegmentTree.Util

Contents

Segment tree beats

Synopsis

_childL :: Int -> Int
_childR :: Int -> Int
_isLChild :: Int -> Bool
_isRChild :: Int -> Bool
_pruneTrick :: Int -> Int -> Int -> Bool
class FailableSemigroupActionTarget a where
- isFailureFSAT :: a -> Bool

Documentation

_childL :: Int -> Int #

\(O(1)\)

_childR :: Int -> Int #

\(O(1)\)

_isLChild :: Int -> Bool #

\(O(1)\)

_isRChild :: Int -> Bool #

\(O(1)\)

_pruneTrick :: Int -> Int -> Int -> Bool #

\(O(1)\) Pruning trick for excluding vertices under the glitch segments.

Segment tree beats

class FailableSemigroupActionTarget a where #

Methods

isFailureFSAT :: a -> Bool #

Instances

Instances details

FailableSemigroupActionTarget (SumMinMax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax Methods isFailureFSAT :: SumMinMax a -> Bool #