| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.RangeSet.Internal.Inserters
Synopsis
- unsafeInsertL :: Size -> E -> E -> RangeSet a -> RangeSet a
- unsafeInsertR :: Size -> E -> E -> RangeSet a -> RangeSet a
- insertLAdj :: Size -> E -> E -> Int -> Size -> E -> E -> RangeSet a -> RangeSet a -> RangeSet a
- insertRAdj :: Size -> E -> E -> Int -> Size -> E -> E -> RangeSet a -> RangeSet a -> RangeSet a
Documentation
unsafeInsertL :: Size -> 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 :: Size -> 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.