Safe Haskell	None
Language	Haskell2010

Data.Rsv.Common

Synopsis

newtype RHandles = RHandles {
- getNextHandle :: RHandle
}
data RHandle
newHandles :: RHandles
nextHandle :: RHandles -> (RHandle, RHandles)
checkHandle :: RHandles -> RHandle -> Bool
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)

Documentation

newtype RHandles Source #

Constructors

RHandles
Fields getNextHandle :: RHandle

Instances

Eq RHandles Source #
Instance details Defined in Data.Rsv.Common Methods (==) :: RHandles -> RHandles -> Bool # (/=) :: RHandles -> RHandles -> Bool #
Read RHandles Source #
Instance details Defined in Data.Rsv.Common Methods readsPrec :: Int -> ReadS RHandles # readList :: ReadS [RHandles] # readPrec :: ReadPrec RHandles # readListPrec :: ReadPrec [RHandles] #
Show RHandles Source #
Instance details Defined in Data.Rsv.Common Methods showsPrec :: Int -> RHandles -> ShowS # show :: RHandles -> String # showList :: [RHandles] -> ShowS #
Generic RHandles Source #
Instance details 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 Source #
Instance details Defined in Data.Rsv.Common type Rep RHandles = D1 (MetaData "RHandles" "Data.Rsv.Common" "schedule-0.1.0.0-3xvNd7Ubdg12LtQp9cpuaG" True) (C1 (MetaCons "RHandles" PrefixI True) (S1 (MetaSel (Just "getNextHandle") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 RHandle)))

data RHandle Source #

Instances

Bounded RHandle Source #
Instance details Defined in Data.Rsv.Common Methods minBound :: RHandle # maxBound :: RHandle #
Enum RHandle Source #
Instance details 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 Source #
Instance details Defined in Data.Rsv.Common Methods (==) :: RHandle -> RHandle -> Bool # (/=) :: RHandle -> RHandle -> Bool #
Ord RHandle Source #
Instance details 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 Source #
Instance details Defined in Data.Rsv.Common Methods readsPrec :: Int -> ReadS RHandle # readList :: ReadS [RHandle] # readPrec :: ReadPrec RHandle # readListPrec :: ReadPrec [RHandle] #
Show RHandle Source #
Instance details Defined in Data.Rsv.Common Methods showsPrec :: Int -> RHandle -> ShowS # show :: RHandle -> String # showList :: [RHandle] -> ShowS #
Generic RHandle Source #
Instance details 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 Source #
Instance details Defined in Data.Rsv.Common type Rep RHandle = D1 (MetaData "RHandle" "Data.Rsv.Common" "schedule-0.1.0.0-3xvNd7Ubdg12LtQp9cpuaG" True) (C1 (MetaCons "RHandle" PrefixI True) (S1 (MetaSel (Just "getHandle") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Word64)))

newHandles :: RHandles Source #

nextHandle :: RHandles -> (RHandle, RHandles) Source #

checkHandle :: RHandles -> RHandle -> Bool Source #

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)) Source #

sEnqueue :: a -> Seq a -> Seq a Source #

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

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