Safe Haskell	Safe-Inferred
Language	Haskell2010

Unison.Util.Alphabetical

Documentation

class Eq n => Alphabetical n where Source #

Methods

compareAlphabetical :: n -> n -> Ordering Source #

Instances

Instances details

Alphabetical Text Source #
Instance details Defined in Unison.Util.Alphabetical Methods compareAlphabetical :: Text -> Text -> Ordering Source #
Alphabetical NameSegment Source #
Instance details Defined in Unison.NameSegment.Internal Methods compareAlphabetical :: NameSegment -> NameSegment -> Ordering Source #
Alphabetical a => Alphabetical (NonEmpty a) Source #
Instance details Defined in Unison.Util.Alphabetical Methods compareAlphabetical :: NonEmpty a -> NonEmpty a -> Ordering Source #
Alphabetical a => Alphabetical (Maybe a) Source #
Instance details Defined in Unison.Util.Alphabetical Methods compareAlphabetical :: Maybe a -> Maybe a -> Ordering Source #
Alphabetical a => Alphabetical [a] Source #
Instance details Defined in Unison.Util.Alphabetical Methods compareAlphabetical :: [a] -> [a] -> Ordering Source #

sortAlphabetically :: Alphabetical a => [a] -> [a] Source #

sortAlphabeticallyOn :: Alphabetical a => (b -> a) -> [b] -> [b] Source #

newtype OrderAlphabetically a Source #

Constructors

OrderAlphabetically a

Instances

Instances details

Foldable OrderAlphabetically Source #
Instance details Defined in Unison.Util.Alphabetical Methods fold :: Monoid m => OrderAlphabetically m -> m # foldMap :: Monoid m => (a -> m) -> OrderAlphabetically a -> m # foldMap' :: Monoid m => (a -> m) -> OrderAlphabetically a -> m # foldr :: (a -> b -> b) -> b -> OrderAlphabetically a -> b # foldr' :: (a -> b -> b) -> b -> OrderAlphabetically a -> b # foldl :: (b -> a -> b) -> b -> OrderAlphabetically a -> b # foldl' :: (b -> a -> b) -> b -> OrderAlphabetically a -> b # foldr1 :: (a -> a -> a) -> OrderAlphabetically a -> a # foldl1 :: (a -> a -> a) -> OrderAlphabetically a -> a # toList :: OrderAlphabetically a -> [a] # null :: OrderAlphabetically a -> Bool # length :: OrderAlphabetically a -> Int # elem :: Eq a => a -> OrderAlphabetically a -> Bool # maximum :: Ord a => OrderAlphabetically a -> a # minimum :: Ord a => OrderAlphabetically a -> a # sum :: Num a => OrderAlphabetically a -> a # product :: Num a => OrderAlphabetically a -> a #
Traversable OrderAlphabetically Source #
Instance details Defined in Unison.Util.Alphabetical Methods traverse :: Applicative f => (a -> f b) -> OrderAlphabetically a -> f (OrderAlphabetically b) # sequenceA :: Applicative f => OrderAlphabetically (f a) -> f (OrderAlphabetically a) # mapM :: Monad m => (a -> m b) -> OrderAlphabetically a -> m (OrderAlphabetically b) # sequence :: Monad m => OrderAlphabetically (m a) -> m (OrderAlphabetically a) #
Functor OrderAlphabetically Source #
Instance details Defined in Unison.Util.Alphabetical Methods fmap :: (a -> b) -> OrderAlphabetically a -> OrderAlphabetically b # (<$) :: a -> OrderAlphabetically b -> OrderAlphabetically a #
Eq a => Eq (OrderAlphabetically a) Source #
Instance details Defined in Unison.Util.Alphabetical Methods (==) :: OrderAlphabetically a -> OrderAlphabetically a -> Bool # (/=) :: OrderAlphabetically a -> OrderAlphabetically a -> Bool #
(Eq a, Alphabetical a) => Ord (OrderAlphabetically a) Source #
Instance details Defined in Unison.Util.Alphabetical Methods compare :: OrderAlphabetically a -> OrderAlphabetically a -> Ordering # (<) :: OrderAlphabetically a -> OrderAlphabetically a -> Bool # (<=) :: OrderAlphabetically a -> OrderAlphabetically a -> Bool # (>) :: OrderAlphabetically a -> OrderAlphabetically a -> Bool # (>=) :: OrderAlphabetically a -> OrderAlphabetically a -> Bool # max :: OrderAlphabetically a -> OrderAlphabetically a -> OrderAlphabetically a # min :: OrderAlphabetically a -> OrderAlphabetically a -> OrderAlphabetically a #