Data.Rsv.Common

Common utilities for implementing reservation data structures.

A reservation data structure is one that allows multiple inserts of the same item, by returning a unique handle for each insert operation that must be given to the delete operation.

If you need to store the handle together with the item, e.g. so that the item knows how to delete itself, this can be achieved via the standard Haskell "tying the knot" technique.

This API is experimental at the moment, and parts of it may change.

Documentation

newtype RHandles

Handle generator. Runtime invariants:

1. A handle from one generator is not used in a context that expects a handle from a different generator. TODO: use a string or other data to distinguish the contexts.
2. Newly generated handles are distinguishable from previously-generated ones. checkHandle is used to check this.

Constructors

RHandles

Fields

• getNextHandle :: RHandle

Instances

Eq RHandles

Defined in Data.Rsv.Common

Methods

(==) :: RHandles -> RHandles -> Bool

(/=) :: RHandles -> RHandles -> Bool

Read RHandles

Defined in Data.Rsv.Common

Methods

readsPrec :: Int -> ReadS RHandles

readList :: ReadS [RHandles]

readPrec :: ReadPrec RHandles

readListPrec :: ReadPrec [RHandles]

Show RHandles

Defined in Data.Rsv.Common

Methods

showsPrec :: Int -> RHandles -> ShowS

show :: RHandles -> String

showList :: [RHandles] -> ShowS

Generic RHandles

Defined in Data.Rsv.Common

Associated Types

type Rep RHandles :: Type -> Type

Methods

from :: RHandles -> Rep RHandles x

to :: Rep RHandles x -> RHandles

type Rep RHandles

Defined in Data.Rsv.Common

type Rep RHandles = D1 (MetaData "RHandles" "Data.Rsv.Common" "schedule-0.3.0.0-rXAR2JhUGJ487cqZKqedA" True) (C1 (MetaCons "RHandles" PrefixI True) (S1 (MetaSel (Just "getNextHandle") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 RHandle)))

data RHandle

Instances

Bounded RHandle

Defined in Data.Rsv.Common

Methods

minBound :: RHandle

maxBound :: RHandle

Enum RHandle

Defined in Data.Rsv.Common

Methods

succ :: RHandle -> RHandle

pred :: RHandle -> RHandle

toEnum :: Int -> RHandle

fromEnum :: RHandle -> Int

enumFrom :: RHandle -> [RHandle]

enumFromThen :: RHandle -> RHandle -> [RHandle]

enumFromTo :: RHandle -> RHandle -> [RHandle]

enumFromThenTo :: RHandle -> RHandle -> RHandle -> [RHandle]

Eq RHandle

Defined in Data.Rsv.Common

Methods

(==) :: RHandle -> RHandle -> Bool

(/=) :: RHandle -> RHandle -> Bool

Ord RHandle

Defined in Data.Rsv.Common

Methods

compare :: RHandle -> RHandle -> Ordering

(<) :: RHandle -> RHandle -> Bool

(<=) :: RHandle -> RHandle -> Bool

(>) :: RHandle -> RHandle -> Bool

(>=) :: RHandle -> RHandle -> Bool

max :: RHandle -> RHandle -> RHandle

min :: RHandle -> RHandle -> RHandle

Read RHandle

Defined in Data.Rsv.Common

Methods

readsPrec :: Int -> ReadS RHandle

readList :: ReadS [RHandle]

readPrec :: ReadPrec RHandle

readListPrec :: ReadPrec [RHandle]

Show RHandle

Defined in Data.Rsv.Common

Methods

showsPrec :: Int -> RHandle -> ShowS

show :: RHandle -> String

showList :: [RHandle] -> ShowS

Generic RHandle

Defined in Data.Rsv.Common

Associated Types

type Rep RHandle :: Type -> Type

Methods

from :: RHandle -> Rep RHandle x

to :: Rep RHandle x -> RHandle

type Rep RHandle

Defined in Data.Rsv.Common

type Rep RHandle = D1 (MetaData "RHandle" "Data.Rsv.Common" "schedule-0.3.0.0-rXAR2JhUGJ487cqZKqedA" True) (C1 (MetaCons "RHandle" PrefixI True) (S1 (MetaSel (Just "getHandle") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Word64)))

newHandles :: RHandles

nextHandle :: RHandles -> (RHandle, RHandles)

checkHandle :: RHandles -> RHandle -> Bool

Check that an existing handle is consistent with the current state of a handle generator, i.e. it must not be part of the generator's future.

withHandle :: ((RHandle, i) -> c -> c) -> i -> (RHandles, c) -> (RHandle, (RHandles, c))

sEnqueue :: a -> Seq a -> Seq a

sUnqueue :: (HasCallStack, Eq k) => k -> Seq (k, a) -> (Maybe a, Seq (k, a))

sDequeue :: Seq a -> (Maybe a, Seq a)