On Tuesday, 31 December 2013 06:37:46 UTC-3, Christian Groll wrote: > > I want to have a type simplexPoints, where the instances of this type are > points on the n-dimensional simplex. Hence, I need to ensure that the sum > of all vector entries equals one, and all weights are positive. Also, these > instances should not be manipulable, such that one can not manually change > entries such that the constraints are not fulfilled anymore. What would be > the best implementation? >
very late, sorry, and more a question than an answer - but why would a tuple not work here? they abehave like immutable arrays wrt indexing and access. are tuples that are all of the same type not packed like vectors? andrew
