A permutation vector is a permutation of the integer vector
$<1, 2,="" ...,="" n="">$, were $n$ is the number of objects. For example,
the permutation vector $<3, 2="" 1,="">$ indicates that in first position is the
object with index 3 then the object with index 1 and finally the object
with index 2.ser_permutation_vector
objects are usually packed into
a ser_permutation
object
which is a collection of $k$ permutation vectors for $k$-mode data.
The constructor ser_permutation_vector
checks if the permutation vector is valid
(i.e. if all integers occur exactly once).
The following functions are implemented: print
, rev
,
length
, get_order
, get_rank
, get_method
.
3,>1,>