LeftRecursivePathOrder - Maple Help
For the best experience, we recommend viewing online help using Google Chrome or Microsoft Edge.

Online Help

All Products    Maple    MapleSim


StringTools

  

LexOrder

  

perform lexicographical order comparison of strings

  

ShortLexOrder

  

perform short lexicographical order comparison of strings

  

RevLexOrder

  

perform reverse lexicographical order comparison of strings

  

ShortRevLexOrder

  

perform short reverse lexicographical order comparison of strings

  

LeftRecursivePathOrder

  

perform left recursive path order comparison of strings

  

RightRecursivePathOrder

  

perform right recursive path order comparison of strings

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

LexOrder( s1, s2 )

ShortLexOrder( s1, s2 )

RevLexOrder( s1, s2 )

ShortRevLexOrder( s1, s2 )

LeftRecursivePathOrder( s1, s2 )

RightRecursivePathOrder( s1, s2 )

Parameters

s1, s2

-

Maple strings

Description

• 

These six procedures implement various order relations on strings, extended from the numeric order on character code points.

• 

Each procedure takes two strings s1 and s2 as arguments, and returns one of the values , according to the following table.

String Order

Return Value

 

 

s1 precedes s2

-1

s1 is identical to s2

0

s1 follows s2

1

• 

The LexOrder(s1, s2) command implements simple lexicographic (dictionary) ordering of strings.

• 

The RevLexOrder(s1, s2) command implements the reverse lexicographic order, which is equivalent to the lexicographic order on the reversed strings.

• 

The ShortLexOrder(s1, s2) and ShortRevLexOrder(s1, s2) commands are similar, but apply the respective ordering relation only to strings of equal length. Strings are first compared according to their lengths, with shorter strings preceeding longer strings. The short variants are important because they are translation-invariant:  = ,  = ,  =  and  = ,

• 

The left and right recursive path orders are also translation invariant, and are computed by the LeftRecursivePathOrder(s1, s2) and RightRecursivePathOrder(s1, s2) commands, respectively.

• 

The left and right recursive path orders, manifest in the LeftRecursivePathOrder(s1, s2) and RightRecursivePathOrder(s1, s2) commands, are defined for two strings  and , as follows. Characters (strings with length equal to 1) compare according to the numeric order of the corresponding code points.

• 

String  precedes string  in the left recursive path order if one among the following holds: (1)  and  precedes ; (2)  and  precedes ; or (3)  and  precedes .

  

String  precedes string  in the right recursive path order if one among the following holds: (1)  and  precedes ; (2)  and  precedes ; or (3)  and  precedes .

• 

All of the StringTools package commands treat strings as (null-terminated) sequences of -bit (ASCII) characters.  Thus, there is no support for multibyte character encodings, such as unicode encodings.

Examples

(1)

(2)

(3)

(4)

(5)

(6)

(7)

(8)

(9)

See Also

lexorder

string

StringTools

StringTools[Compare]

 


Download Help Document