sortee-0.1.0.1: Generate string for sort key

Safe HaskellSafe
LanguageHaskell2010

Data.String.Sortee

Synopsis

Documentation

between :: Maybe Sortee -> Maybe Sortee -> Maybe Sortee Source #

Create a new sort string that is between the provided strings. For example:

between "a" "c" -- "b"

Laws:

a < (between a b) < b
(between Nothing a) < a
(between a Nothing) > a
(between a a) == Nothing
(between (Just a) (Just b)) == (between (Just b) (Just a))

newtype Sortee Source #

Constructors

Sortee 

Fields

Instances
Eq Sortee Source # 
Instance details

Defined in Data.String.Sortee

Methods

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

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

Ord Sortee Source # 
Instance details

Defined in Data.String.Sortee

Show Sortee Source # 
Instance details

Defined in Data.String.Sortee

IsString Sortee Source # 
Instance details

Defined in Data.String.Sortee

Methods

fromString :: String -> Sortee #

IsString (Maybe Sortee) Source # 
Instance details

Defined in Data.String.Sortee

chars :: String Source #

All the characters used in a sort string, it's [0-9A-Za-z] sorted alphabetically