test whether a string is a permutation - Maple Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Programming : Names and Strings : StringTools Package : Combinatorics on Words : StringTools/IsPermutation

StringTools[IsPermutation] - test whether a string is a permutation

Calling Sequence

IsPermutation( s )

Parameters

s

-

string

Description

• 

The IsPermutation(s) command returns the value true if the string s is a permutation of its support, and returns the value false otherwise. A string is a permutation if, and only if, each character in the string occurs exactly once.

• 

Note that, since there are only 255 distinct characters (byte values), the Pigeon-Hole Principle  implies that no string permutation can exceed 255 characters in length.

• 

If s is the empty string, the command returns true.

Examples

withStringTools:

IsPermutation

true

(1)

IsPermutationabc

true

(2)

IsPermutationabcba

false

(3)

r:=rand1..10:

S:=seqRandomr,'lower',i=1..1000:

selectIsPermutationandIsPalindrome,S

a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z

(4)

See Also

string, StringTools, StringTools[IsPalindrome], StringTools[Support]


Download Help Document

Was this information helpful?



Please add your Comment (Optional)
E-mail Address (Optional)
What is ? This question helps us to combat spam