compare package:ghc

compare :: Ord a => a -> a -> Ordering
ghc GHC.Prelude.Basic
module GHC.Core.TyCo.Compare
ghc
Type equality and comparison
Compare :: LlvmCmpOp -> LlvmVar -> LlvmVar -> LlvmExpression
ghc GHC.Llvm GHC.Llvm.Syntax
Perform a compare operation on the operands left and right * op: operator * left: left operand * right: right operand
compareFixity :: Fixity -> Fixity -> (Bool, Bool)
ghc GHC GHC.Types.Fixity
compare_RDR :: RdrName
ghc GHC.Builtin.Names
compareLength :: [a] -> [b] -> Ordering
ghc GHC.Utils.Misc
CompareByteArraysOp :: PrimOp
ghc GHC.Builtin.PrimOps
bignatCompareIdKey :: Unique
ghc GHC.Builtin.Names
bignatCompareName :: Name
ghc GHC.Builtin.Names
bignatCompareWordIdKey :: Unique
ghc GHC.Builtin.Names
bignatCompareWordName :: Name
ghc GHC.Builtin.Names
lexicalCompareFS :: FastString -> FastString -> Ordering
ghc GHC.Data.FastString
Compare FastString lexically If you don't care about the lexical ordering, use uniqCompareFS instead.
uniqCompareFS :: FastString -> FastString -> Ordering
ghc GHC.Data.FastString
Compare FastString by their Unique (not lexically). Much cheaper than lexicalCompareFS but non-deterministic!
hdCompareByteArraysStr :: FastString
ghc GHC.StgToJS.Symbols
hdComparePointerStr :: FastString
ghc GHC.StgToJS.Symbols