chickadee » srfi-13 » string<

(string= s1 s2 [start1 end1 start2 end2]) -> booleanprocedure
(string<> s1 s2 [start1 end1 start2 end2]) -> booleanprocedure
(string< s1 s2 [start1 end1 start2 end2]) -> booleanprocedure
(string> s1 s2 [start1 end1 start2 end2]) -> booleanprocedure
(string<= s1 s2 [start1 end1 start2 end2]) -> booleanprocedure
(string>= s1 s2 [start1 end1 start2 end2]) -> booleanprocedure

These procedures are the lexicographic extensions to strings of the corresponding orderings on characters. For example, string< is the lexicographic ordering on strings induced by the ordering char<? on characters. If two strings differ in length but are the same up to the length of the shorter string, the shorter string is considered to be lexicographically less than the longer string.

The optional start/end indices restrict the comparison to the indicated substrings of S1 and S2.

Comparison is simply done on individual code-points of the string. True text collation is not handled by this SRFI.