Safe Haskell	Safe-Inferred
Language	GHC2021

Database.LSMTree.Internal.Map.Range

Synopsis

data Bound k where
- NoBound
- Bound !k !Clusive
- pattern BoundExclusive :: k -> Bound k
- pattern BoundInclusive :: k -> Bound k
data Clusive
- = Exclusive
- | Inclusive
rangeLookup :: forall k v. Ord k => Bound k -> Bound k -> Map k v -> [(k, v)]

Documentation

Constructors

NoBound
Bound !k !Clusive

Bundled Patterns

pattern BoundExclusive :: k -> Bound k
pattern BoundInclusive :: k -> Bound k

Instances details

Show k => Show (Bound k) Source #
Instance details Defined in Database.LSMTree.Internal.Map.Range Methods showsPrec :: Int -> Bound k -> ShowS # show :: Bound k -> String # showList :: [Bound k] -> ShowS #

Constructors

Exclusive
Inclusive

Instances details

Show Clusive Source #
Instance details Defined in Database.LSMTree.Internal.Map.Range Methods showsPrec :: Int -> Clusive -> ShowS # show :: Clusive -> String # showList :: [Clusive] -> ShowS #

Arguments

Find all the keys in the given range and return the corresponding (key, value) pairs (in ascending order).