Safe Haskell | None |
---|---|
Language | Haskell98 |
Synopsis
- data Simplex d size = Simplex {
- simplexDimension :: UnaryProxy d
- simplexSize :: size
Documentation
Simplex is a generalization of Triangular
to more than two dimensions.
Indices are tuples of fixed size
with elements ordered in ascending, strictly ascending,
descending or strictly descending order.
"Order" refers to the index order in indices
.
In order to avoid confusion we suggest that the order of indices
is consistent with <=
.
Obviously, offset
implements ranking
and indexFromOffset
implements unranking
of combinations (in the combinatorial sense)
with or without repetitions.
>>>
Shape.indices $ ShapeExtra.Simplex (Unary.unary TypeNum.u3) $ Shape.ZeroBased (4::Int)
[0!:1!:2!:end,0!:1!:3!:end,0!:2!:3!:end,1!:2!:3!:end]
Simplex | |
|