SPV class defines a pseudo-vector containing all
k-selections (combinations with replacement) of the objects stored
items. The function
spv is a constructor for this class.
the number of objects taken at a time.
a vector of objects to be selected.
The selections are arranged according to the order in which the objects
items. The arrangement is very similar to the arrangement
of combinations (see cpv) except that objects may be repeatedly selected.
an instance of
Steinhaus-Johnson-Trotter algorithm. (2014, April 29). In Wikipedia, The Free Encyclopedia. Retrieved 13:24, September 5, 2014
1 2 3 4 5 6 7 8 9 10