Portability | GHC |
---|---|

Stability | unstable |

Maintainer | stephen.tetley@gmail.com |

Generate points in an iterated chain.

WARNING - very unstable.

# Documentation

tableDown :: Num u => Int -> (u, u) -> LocChain uSource

`tableDown`

: ` num_rows * (row_width, row_height) -> LocChain `

The table grows down and right, the implicit initial point is
`top-left`

.

tableRight :: Num u => Int -> (u, u) -> LocChain uSource

`tableRight`

: ` num_cols * row_width * row_height -> LocChain `

The table grows right and down, the implicit initial point is
`top-left`

.

This chain is infinite.

horizontal :: Num u => u -> LocChain uSource

`horizontal`

: ` horizontal_dist -> LocChain `

The chain grows right by the supplied increment.

This chain is infinite.

** WARNING ** - name due to be changed. Current name is too general for this function.

vertical :: Num u => u -> LocChain uSource

`vertical`

: ` vertical_dist -> LocChain `

The chain grows up by the supplied increment.

This chain is infinite.

** WARNING ** - name due to be changed. Current name is too general for this function.

horizontals :: Num u => [u] -> LocChain uSource

`horizontals`

: ` [horizontal_dist] -> LocChain `

This is a `scanl`

successive displacing the start point.

This chain is finite (for finite input list).

** WARNING ** - name due to be changed. Current name is too general for this function.