import collate.strings
class Collator(object):
+ encoding = "ascii"
+
def cmp(self, string1, string2):
"""Return negative if a < b, zero if a == b, positive if a > b."""
return cmp(self.key(string1), self.key(string2))
+ def key(self, string):
+ return string
+
def words(self, string):
"""Split the string along word boundries."""
if isinstance(string, str):
string = string.decode(self.encoding, 'replace')
return string.split()
- def sortemekey(self, string, invalid=float('inf')):
+ def sortemekey(self, string):
"""Return a key based on sortemes of a string.
If the string is a str instance, it is decoded to a unicode
instance according to the 'encoding' attribute of the
Collator.
"""
- keys = []
if isinstance(string, str):
string = string.decode(self.encoding, 'replace')
- for sorteme in collate.strings.sortemes(string):
- num, alpha = collate.strings.numeric(sorteme, invalid)
- if num == invalid:
- keys.append(self.key(alpha))
- else:
- keys.append(num)
+
# Shove the sortkeyed original string on the end to resolve
# ties intelligently.
- return (keys, self.key(string))
+ return (collate.strings.sortemes(string, self.key),
+ self.key(string))
+