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?

Reply via email to