| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.PrimitiveArray.Index.EdgeBoundary
Description
Edge boundaries capture edge indexing of the type From :-> To, where
both From and To are Ints. Each such Int gives one of the two
nodes between edge exists.
- data EdgeBoundary t = !Int :-> !Int
- fromEdgeBoundaryFst :: EdgeBoundary t -> Int
- fromEdgeBoundarySnd :: EdgeBoundary t -> Int
- streamUpMk :: Monad m => t1 -> t -> m (t, t1, t1)
- streamUpStep :: Monad m => Int -> Int -> (t1, Int, Int) -> m (Step (t1, Int, Int) ((:.) t1 (EdgeBoundary t)))
- streamDownMk :: Monad m => t1 -> t -> m (t, t1, t1)
- streamDownStep :: Monad m => Int -> Int -> (t1, Int, Int) -> m (Step (t1, Int, Int) ((:.) t1 (EdgeBoundary t)))
Documentation
data EdgeBoundary t Source #
An edge boundary as two Ints denoting the edge From :-> To.
Instances
fromEdgeBoundaryFst :: EdgeBoundary t -> Int Source #
fromEdgeBoundarySnd :: EdgeBoundary t -> Int Source #
streamUpMk :: Monad m => t1 -> t -> m (t, t1, t1) Source #
generic mk for streamUp / streamDown
streamUpStep :: Monad m => Int -> Int -> (t1, Int, Int) -> m (Step (t1, Int, Int) ((:.) t1 (EdgeBoundary t))) Source #
streamDownMk :: Monad m => t1 -> t -> m (t, t1, t1) Source #