Wumpus.Basic.Kernel.Drawing.Chain

Chaining LocGraphics.

Documentation

data GenChain st u a

Instances

Monad (GenChain st u)

Functor (GenChain st u)

Applicative (GenChain st u)

DrawingCtxM (GenChain st u)

InterpretUnit u => LocationM (GenChain st u)

UserStateM (GenChain st u)

Monoid a => Monoid (GenChain st u a)

type Chain u a = GenChain () u a

type DChain a = Chain Double a

data ChainScheme u

scheme_start is a function from the origin to state.

For instance, we might want to cache the origin - this would not be possible if start was just a pure cst value.

Constructors

forall cst . ChainScheme

Fields

chain_init :: Point2 u -> cst

chain_step :: Point2 u -> cst -> (Point2 u, cst)

runGenChain :: InterpretUnit u => ChainScheme u -> st -> GenChain st u a -> LocImage u (a, st)

evalGenChain :: InterpretUnit u => ChainScheme u -> st -> GenChain st u a -> LocImage u a

Forget the user state LocImage, just return the answer.

execGenChain :: InterpretUnit u => ChainScheme u -> st -> GenChain st u a -> LocImage u st

Forget the answer, just return the user state.

stripGenChain :: InterpretUnit u => ChainScheme u -> st -> GenChain st u a -> LocQuery u (a, st)

runChain :: InterpretUnit u => ChainScheme u -> Chain u a -> LocImage u a

runChain_ :: InterpretUnit u => ChainScheme u -> Chain u a -> LocGraphic u

chain1 :: InterpretUnit u => LocImage u a -> GenChain st u a

Demand a point on the Chain and draw the LocImage at it.

chainSkip_ :: InterpretUnit u => GenChain st u ()

Demand the next position, but draw nothing.

chainMany :: InterpretUnit u => [LocImage u a] -> GenChain st u (UNil u)

Chain a list of images, each demanding a succesive start point.

chainReplicate :: InterpretUnit u => Int -> LocImage u a -> GenChain st u (UNil u)

Replicate a LocImage n times along a Chain.

chainCount :: GenChain st u Int

Return the count of chain steps.

iterationScheme :: (Point2 u -> Point2 u) -> ChainScheme u

General scheme - iterate the next point with the supplied function.

sequenceScheme :: Num u => [Vec2 u] -> ChainScheme u

General scheme - displace successively by the elements of the list of vectors.

Note - the list is cycled to make the chain infinite.

catTrailScheme :: Num u => CatTrail u -> ChainScheme u

Derive a ChainScheme from a CatTrail.

Note - this iterates the control points of curves, it does not iterate points on the curve.

countingScheme :: [(Int, ChainScheme u)] -> ChainScheme u -> ChainScheme u

Build an (infinite) ChainScheme for a prefix list of counted schemes and a final scheme that runs out to infinity.

horizontalScheme :: Num u => u -> ChainScheme u

verticalScheme :: Num u => u -> ChainScheme u

rowwiseTableScheme :: Num u => Int -> (u, u) -> ChainScheme u

Generate a tabular scheme going rowwise (left-to-right) and downwards.

TODO - should probably account for the initial position...

columnwiseTableScheme :: Num u => Int -> (u, u) -> ChainScheme u

Generate a tabular scheme going columwise (top-to-bottom) and rightwards.

TODO - should probably account for the initial position...

distribRowwiseTable :: (Monoid a, InterpretUnit u) => Int -> (u, u) -> [LocImage u a] -> LocImage u a

duplicateRowwiseTable :: (Monoid a, InterpretUnit u) => Int -> Int -> (u, u) -> LocImage u a -> LocImage u a

distribColumnwiseTable :: (Monoid a, InterpretUnit u) => Int -> (u, u) -> [LocImage u a] -> LocImage u a

duplicateColumnwiseTable :: (Monoid a, InterpretUnit u) => Int -> Int -> (u, u) -> LocImage u a -> LocImage u a

radialChainScheme :: Floating u => u -> Radian -> Radian -> ChainScheme u

TODO - account for CW CCW or just rely on +ve -ve angles?...