Maple Professional
Maple Academic
Maple Student Edition
Maple Personal Edition
Maple Player
Maple Player for iPad
MapleSim Professional
MapleSim Academic
Maple T.A. - Testing & Assessment
Maple T.A. MAA Placement Test Suite
Möbius - Online Courseware
Machine Design / Industrial Automation
Aerospace
Vehicle Engineering
Robotics
Power Industries
System Simulation and Analysis
Model development for HIL
Plant Modeling for Control Design
Robotics/Motion Control/Mechatronics
Other Application Areas
Mathematics Education
Engineering Education
High Schools & Two-Year Colleges
Testing & Assessment
Students
Financial Modeling
Operations Research
High Performance Computing
Physics
Live Webinars
Recorded Webinars
Upcoming Events
MaplePrimes
Maplesoft Blog
Maplesoft Membership
Maple Ambassador Program
MapleCloud
Technical Whitepapers
E-Mail Newsletters
Maple Books
Math Matters
Application Center
MapleSim Model Gallery
User Case Studies
Exploring Engineering Fundamentals
Teaching Concepts with Maple
Maplesoft Welcome Center
Teacher Resource Center
Student Help Center
lexorder - test for lexicographical order
Calling Sequence
lexorder(s1, s2)
Parameters
s1, s2
-
strings or unevaluated symbols
Description
The procedure lexorder returns true if s1 occurs before s2 in lexicographical order, or if s1 is equal to s2. Otherwise, it returns false.
The lexicographical order depends in part upon the ordering of the underlying character set, which is system-dependent.
For strings and symbols consisting of ordinary letters, lexicographical order is the standard alphabetical order.
The most common use of lexorder is as the second (optional) argument to the sort command. This allows you to sort a list of strings (or symbols) lexicographically. Note, however, that it is the symbol lexorder rather than the lexorder procedure that should be used as an option to sort. Both will work, with identical results, but the symbol lexorder is recognized by sort, causing it to use a builtin algorithm that is faster than the one that calls the lexorder procedure. (See the example below.)
Thread Safety
The lexorder command is thread-safe as of Maple 15.
For more information on thread safety, see index/threadsafe.
Examples
Calling the builtin procedure lexorder() directly is slower than using the 'lexorder' algorithm that is built in to sort().
Reversing the sense of the comparison is more costly still, because a full Maple procedure call is incurred for each comparison.
A better way to do this is to use a linear reversal algorithm after sorting the list with the builtin algorithm. Since sorting dominates at O(n*ln(n)), using the sorting algorithm with the smaller constant factor delivers better performance.
revsort := proc( los::list(string) )::list(string); local L; L := sort( los, 'lexorder' ); [ seq( L[ -i ], i = 1 .. nops( L ) ) ] end proc:
See Also
eval, evalb, list, nops, seq, sort, string, StringTools,Random
Download Help Document