# valid

0th

Percentile

##### Functions to validate permutations

Functions to validate permutation objects: if valid, return TRUE and if not valid, generate a warning() and return FALSE.

Function singleword.valid() takes an integer vector, interpreted as a word, and checks that it is a permutation of seq_len(max(x)).

Function cycle.valid() takes a cyclist and checks for disjoint cycles of strictly positive integers with no repeats.

Keywords
symbmath
##### Usage
singleword_valid(w)
cyclist_valid(x)
##### Arguments
x

In function cycle_valid(), a cyclist

w

In function singleword_valid(), an integer vector

##### Value

Returns either TRUE, or stops with an informative error message

cyclist

##### Aliases
• valid
• validity
• singleword_valid
• cyclist_valid
##### Examples
# NOT RUN {
singleword_valid(sample(1:9))      # TRUE
singleword_valid(c(3L,4L,2L,1L))   # TRUE
singleword_valid(c(3,4,2,1))       # FALSE (not integer)
singleword_valid(c(3L,3L,2L,1L))   # FALSE (3 repeated)

cyclist_valid(list(c(1,8,2),c(3,6))) # TRUE
cyclist_valid(list(c(1,8,2),c(3,6))) # FALSE ('8' is repeated)
cyclist_valid(list(c(1,8,1),c(3,6))) # FALSE ('1' is repeated)
cyclist_valid(list(c(0,8,2),c(3,6))) # FALSE (zero element)

# }

Documentation reproduced from package permutations, version 1.0-5, License: GPL-2

### Community examples

Looks like there are no examples yet.