Safe Haskell	None
Language	Haskell2010

Data.Geometry.SegmentTree.Generic

Synopsis

Documentation

data NodeData v r Source #

Internal nodes store a split point, the range, and an associated data structure

Constructors

NodeData
Fields _splitPoint :: !(EndPoint r) _range :: !(Range r) _assoc :: !v

Instances

Functor (NodeData v) Source #
Methods fmap :: (a -> b) -> NodeData v a -> NodeData v b # (<$) :: a -> NodeData v b -> NodeData v a #
(Eq v, Eq r) => Eq (NodeData v r) Source #
Methods (==) :: NodeData v r -> NodeData v r -> Bool # (/=) :: NodeData v r -> NodeData v r -> Bool #
(Show v, Show r) => Show (NodeData v r) Source #
Methods showsPrec :: Int -> NodeData v r -> ShowS # show :: NodeData v r -> String # showList :: [NodeData v r] -> ShowS #
Generic (NodeData v r) Source #
Associated Types type Rep (NodeData v r) :: * -> * # Methods from :: NodeData v r -> Rep (NodeData v r) x # to :: Rep (NodeData v r) x -> NodeData v r #
(NFData v, NFData r) => NFData (NodeData v r) Source #
Methods rnf :: NodeData v r -> () #
type Rep (NodeData v r) Source #
type Rep (NodeData v r) = D1 (MetaData "NodeData" "Data.Geometry.SegmentTree.Generic" "hgeometry-0.6.0.0-ODn7ZyBfwj6IkLPAAzetJ" False) (C1 (MetaCons "NodeData" PrefixI True) ((::) (S1 (MetaSel (Just Symbol "_splitPoint") NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 (EndPoint r))) ((::) (S1 (MetaSel (Just Symbol "_range") NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 (Range r))) (S1 (MetaSel (Just Symbol "_assoc") NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 v)))))

splitPoint :: forall v r. Lens' (NodeData v r) (EndPoint r) Source #

range :: forall v r. Lens' (NodeData v r) (Range r) Source #

assoc :: forall v r v. Lens (NodeData v r) (NodeData v r) v v Source #

data LeafData v r Source #

Leaf nodes store an atomic range, and an associated data structure.

Constructors

LeafData
Fields _atomicRange :: !(AtomicRange r) _leafAssoc :: !v

Instances

Functor (LeafData v) Source #
Methods fmap :: (a -> b) -> LeafData v a -> LeafData v b # (<$) :: a -> LeafData v b -> LeafData v a #
(Eq v, Eq r) => Eq (LeafData v r) Source #
Methods (==) :: LeafData v r -> LeafData v r -> Bool # (/=) :: LeafData v r -> LeafData v r -> Bool #
(Show v, Show r) => Show (LeafData v r) Source #
Methods showsPrec :: Int -> LeafData v r -> ShowS # show :: LeafData v r -> String # showList :: [LeafData v r] -> ShowS #
Generic (LeafData v r) Source #
Associated Types type Rep (LeafData v r) :: * -> * # Methods from :: LeafData v r -> Rep (LeafData v r) x # to :: Rep (LeafData v r) x -> LeafData v r #
(NFData v, NFData r) => NFData (LeafData v r) Source #
Methods rnf :: LeafData v r -> () #
type Rep (LeafData v r) Source #
type Rep (LeafData v r)

atomicRange :: forall v r r. Lens (LeafData v r) (LeafData v r) (AtomicRange r) (AtomicRange r) Source #

leafAssoc :: forall v r v. Lens (LeafData v r) (LeafData v r) v v Source #

newtype SegmentTree v r Source #

Segment tree on a Fixed set of endpoints

Constructors

SegmentTree
Fields _unSegmentTree :: BinLeafTree (NodeData v r) (LeafData v r)

Instances

(Eq r, Eq v) => Eq (SegmentTree v r) Source #
Methods (==) :: SegmentTree v r -> SegmentTree v r -> Bool # (/=) :: SegmentTree v r -> SegmentTree v r -> Bool #
(Show r, Show v) => Show (SegmentTree v r) Source #
Methods showsPrec :: Int -> SegmentTree v r -> ShowS # show :: SegmentTree v r -> String # showList :: [SegmentTree v r] -> ShowS #
Generic (SegmentTree v r) Source #
Associated Types type Rep (SegmentTree v r) :: * -> * # Methods from :: SegmentTree v r -> Rep (SegmentTree v r) x # to :: Rep (SegmentTree v r) x -> SegmentTree v r #
(NFData r, NFData v) => NFData (SegmentTree v r) Source #
Methods rnf :: SegmentTree v r -> () #
type Rep (SegmentTree v r) Source #
type Rep (SegmentTree v r) = D1 (MetaData "SegmentTree" "Data.Geometry.SegmentTree.Generic" "hgeometry-0.6.0.0-ODn7ZyBfwj6IkLPAAzetJ" True) (C1 (MetaCons "SegmentTree" PrefixI True) (S1 (MetaSel (Just Symbol "_unSegmentTree") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (BinLeafTree (NodeData v r) (LeafData v r)))))

unSegmentTree :: forall v r v r. Iso (SegmentTree v r) (SegmentTree v r) (BinLeafTree (NodeData v r) (LeafData v r)) (BinLeafTree (NodeData v r) (LeafData v r)) Source #

class Measured v i => Assoc v i where Source #

Class for associcated data structures

Minimal complete definition

insertAssoc, deleteAssoc

Methods

insertAssoc :: i -> v -> v Source #

deleteAssoc :: i -> v -> v Source #

Instances

Eq a => Assoc [I a] (I a) Source #
Methods insertAssoc :: I a -> [I a] -> [I a] Source # deleteAssoc :: I a -> [I a] -> [I a] Source #

createTree :: NonEmpty r -> v -> SegmentTree v r Source #

Given a sorted list of endpoints, without duplicates, construct a segment tree

$O(n)$ time

fromIntervals :: (Ord r, Eq p, Assoc v i, IntervalLike i, Monoid v, NumType i ~ r) => (Interval p r -> i) -> NonEmpty (Interval p r) -> SegmentTree v r Source #

Build a SegmentTree

$O(n \log n)$

insert :: (Assoc v i, NumType i ~ r, Ord r, IntervalLike i) => i -> SegmentTree v r -> SegmentTree v r Source #

Pre: the interval should have one of the endpoints on which the tree is built.

delete :: (Assoc v i, NumType i ~ r, Ord r, IntervalLike i) => i -> SegmentTree v r -> SegmentTree v r Source #

Delete an interval from the tree

pre: The segment is in the tree!

search :: (Ord r, Monoid v) => r -> SegmentTree v r -> v Source #

Search for all intervals intersecting x

$O(\log n + k)$ where $k$ is the output size

stab :: Ord r => r -> SegmentTree v r -> [v] Source #

Returns the associated values of the nodes on the search path to x

$O(\log n)$

newtype I a Source #

Interval

Constructors

I
Fields _unI :: a

Instances

Eq a => Eq (I a) Source #
Methods (==) :: I a -> I a -> Bool # (/=) :: I a -> I a -> Bool #
Ord a => Ord (I a) Source #
Methods compare :: I a -> I a -> Ordering # (<) :: I a -> I a -> Bool # (<=) :: I a -> I a -> Bool # (>) :: I a -> I a -> Bool # (>=) :: I a -> I a -> Bool # max :: I a -> I a -> I a # min :: I a -> I a -> I a #
Read a => Read (I a) Source #
Methods readsPrec :: Int -> ReadS (I a) # readList :: ReadS [I a] # readPrec :: ReadPrec (I a) # readListPrec :: ReadPrec [I a] #
Show a => Show (I a) Source #
Methods showsPrec :: Int -> I a -> ShowS # show :: I a -> String # showList :: [I a] -> ShowS #
Generic (I a) Source #
Associated Types type Rep (I a) :: * -> * # Methods from :: I a -> Rep (I a) x # to :: Rep (I a) x -> I a #
NFData a => NFData (I a) Source #
Methods rnf :: I a -> () #
IntervalLike a => IntervalLike (I a) Source #
Methods toRange :: I a -> Range (NumType (I a)) Source #
Measured [I a] (I a) Source #
Methods measure :: I a -> [I a] Source #
Eq a => Assoc [I a] (I a) Source #
Methods insertAssoc :: I a -> [I a] -> [I a] Source # deleteAssoc :: I a -> [I a] -> [I a] Source #
type Rep (I a) Source #
type Rep (I a) = D1 (MetaData "I" "Data.Geometry.SegmentTree.Generic" "hgeometry-0.6.0.0-ODn7ZyBfwj6IkLPAAzetJ" True) (C1 (MetaCons "I" PrefixI True) (S1 (MetaSel (Just Symbol "_unI") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type NumType (I a) Source #
type NumType (I a) = NumType a

fromIntervals' :: (Eq p, Ord r) => NonEmpty (Interval p r) -> SegmentTree [I (Interval p r)] r Source #

newtype Count Source #

Constructors

Count
Fields getCount :: Int

Instances

Enum Count Source #
Methods succ :: Count -> Count # pred :: Count -> Count # toEnum :: Int -> Count # fromEnum :: Count -> Int # enumFrom :: Count -> [Count] # enumFromThen :: Count -> Count -> [Count] # enumFromTo :: Count -> Count -> [Count] # enumFromThenTo :: Count -> Count -> Count -> [Count] #
Eq Count Source #
Methods (==) :: Count -> Count -> Bool # (/=) :: Count -> Count -> Bool #
Integral Count Source #
Methods quot :: Count -> Count -> Count # rem :: Count -> Count -> Count # div :: Count -> Count -> Count # mod :: Count -> Count -> Count # quotRem :: Count -> Count -> (Count, Count) # divMod :: Count -> Count -> (Count, Count) # toInteger :: Count -> Integer #
Num Count Source #
Methods (+) :: Count -> Count -> Count # (-) :: Count -> Count -> Count # (*) :: Count -> Count -> Count # negate :: Count -> Count # abs :: Count -> Count # signum :: Count -> Count # fromInteger :: Integer -> Count #
Ord Count Source #
Methods compare :: Count -> Count -> Ordering # (<) :: Count -> Count -> Bool # (<=) :: Count -> Count -> Bool # (>) :: Count -> Count -> Bool # (>=) :: Count -> Count -> Bool # max :: Count -> Count -> Count # min :: Count -> Count -> Count #
Real Count Source #
Methods toRational :: Count -> Rational #
Show Count Source #
Methods showsPrec :: Int -> Count -> ShowS # show :: Count -> String # showList :: [Count] -> ShowS #
Generic Count Source #
Associated Types type Rep Count :: * -> * # Methods from :: Count -> Rep Count x # to :: Rep Count x -> Count #
Semigroup Count Source #
Methods (<>) :: Count -> Count -> Count # sconcat :: NonEmpty Count -> Count # stimes :: Integral b => b -> Count -> Count #
NFData Count Source #
Methods rnf :: Count -> () #
type Rep Count Source #
type Rep Count = D1 (MetaData "Count" "Data.Geometry.SegmentTree.Generic" "hgeometry-0.6.0.0-ODn7ZyBfwj6IkLPAAzetJ" True) (C1 (MetaCons "Count" PrefixI True) (S1 (MetaSel (Just Symbol "getCount") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int)))