rangeset-0.1.0.0: Efficient sets for semi-contiguous data
Safe HaskellSafe
LanguageHaskell2010

Data.RangeSet.Internal.Inserters

Synopsis

Documentation

unsafeInsertL :: E -> E -> RangeSet a -> RangeSet a Source #

Inserts an range at the left-most position in the tree. It *must* not overlap with any other range within the tree. It *must* be known not to exist within the tree.

unsafeInsertR :: E -> E -> RangeSet a -> RangeSet a Source #

Inserts an range at the right-most position in the tree. It *must* not overlap with any other range within the tree. It *must* be known not to exist within the tree.

insertLAdj :: E -> E -> H -> E -> E -> RangeSet a -> RangeSet a -> RangeSet a Source #

insertRAdj :: E -> E -> H -> E -> E -> RangeSet a -> RangeSet a -> RangeSet a Source #