Safe Haskell | Trustworthy |
---|---|
Language | Haskell2010 |
Synopsis
- data BoundedQueue t
- newRB :: MVector MVector t => Int -> IO (BoundedQueue t)
- writeRB :: BoundedQueue t -> t -> IO ()
- readRB :: BoundedQueue t -> IO t
- lengthRB :: BoundedQueue t -> Int
- getSizeRB :: BoundedQueue t -> IO Int
Documentation
data BoundedQueue t Source #
Instances
Typeable t => Data (BoundedQueue t) Source # | |
Defined in Control.CUtils.BoundedQueue gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BoundedQueue t -> c (BoundedQueue t) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (BoundedQueue t) # toConstr :: BoundedQueue t -> Constr # dataTypeOf :: BoundedQueue t -> DataType # dataCast1 :: Typeable t0 => (forall d. Data d => c (t0 d)) -> Maybe (c (BoundedQueue t)) # dataCast2 :: Typeable t0 => (forall d e. (Data d, Data e) => c (t0 d e)) -> Maybe (c (BoundedQueue t)) # gmapT :: (forall b. Data b => b -> b) -> BoundedQueue t -> BoundedQueue t # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BoundedQueue t -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BoundedQueue t -> r # gmapQ :: (forall d. Data d => d -> u) -> BoundedQueue t -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> BoundedQueue t -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> BoundedQueue t -> m (BoundedQueue t) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BoundedQueue t -> m (BoundedQueue t) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BoundedQueue t -> m (BoundedQueue t) # |
writeRB :: BoundedQueue t -> t -> IO () Source #
readRB :: BoundedQueue t -> IO t Source #
lengthRB :: BoundedQueue t -> Int Source #
Read the maximum size of the bounded queue.