natural-sort-0.1.2: User-friendly text collation
Copyright(c) 2010 John Millikin
LicenseBSD3
Maintainer[email protected]
Portabilityportable
Safe HaskellSafe-Inferred
LanguageHaskell98

Algorithms.NaturalSort

Description

Human-friendly text collation

Synopsis

Documentation

data SortKey Source #

Instances

Instances details
Show SortKey Source # 
Instance details

Defined in Algorithms.NaturalSort

Eq SortKey Source # 
Instance details

Defined in Algorithms.NaturalSort

Methods

(==) :: SortKey -> SortKey -> Bool #

(/=) :: SortKey -> SortKey -> Bool #

Ord SortKey Source # 
Instance details

Defined in Algorithms.NaturalSort

class NaturalSort a where Source #

Methods

sortKey :: a -> SortKey Source #

Split a sortable type into textual and numeric sections, with no collation transformation.

If advanced collation is required, either pre-transform the input (using eg toLower) or use sortKeyCollated.

sortKeyCollated :: (Text -> ByteString) -> a -> SortKey Source #

Split a sortable type into textual and numeric sections, using a custom collation transformation. This is useful for providing language- or use-specific ordering.

Instances

Instances details
NaturalSort Text Source # 
Instance details

Defined in Algorithms.NaturalSort

NaturalSort Text Source # 
Instance details

Defined in Algorithms.NaturalSort

NaturalSort String Source # 
Instance details

Defined in Algorithms.NaturalSort

compare :: NaturalSort a => a -> a -> Ordering Source #

Compare two values, using their natural ordering.