ord -package:foundation -package:rebase -package:ghc-lib-parser package:ghc

class Eq a => Ord a
ghc GHC.Prelude.Basic
ordClassKey :: Unique
ghc GHC.Builtin.Names
ordClassName :: Name
ghc GHC.Builtin.Names
ordClass_RDR :: RdrName
ghc GHC.Builtin.Names
ordEQDataConKey :: Unique
ghc GHC.Builtin.Names
ordEQDataConName :: Name
ghc GHC.Builtin.Names
ordGTDataConKey :: Unique
ghc GHC.Builtin.Names
ordGTDataConName :: Name
ghc GHC.Builtin.Names
ordLTDataConKey :: Unique
ghc GHC.Builtin.Names
ordLTDataConName :: Name
ghc GHC.Builtin.Names
orderingTyConKey :: Unique
ghc GHC.Builtin.Names
orderingTyConName :: Name
ghc GHC.Builtin.Names
ordEQDataCon :: DataCon
ghc GHC.Builtin.Types
ordEQDataConId :: Id
ghc GHC.Builtin.Types
ordGTDataCon :: DataCon
ghc GHC.Builtin.Types
ordGTDataConId :: Id
ghc GHC.Builtin.Types
ordLTDataCon :: DataCon
ghc GHC.Builtin.Types
ordLTDataConId :: Id
ghc GHC.Builtin.Types
orderingTyCon :: TyCon
ghc GHC.Builtin.Types
order :: Graph gr => gr a b -> Int
ghc GHC.Data.Graph.Inductive.Graph
The number of nodes in the graph. An alias for noNodes.
ordOpTbl :: [(Type, (RdrName, RdrName, RdrName, RdrName, RdrName))]
ghc GHC.Tc.Deriv.Generate
ordNub :: Ord a => [a] -> [a]
ghc GHC.Utils.Misc
Remove duplicates but keep elements in order. O(n * log n)
ordNubOn :: Ord b => (a -> b) -> [a] -> [a]
ghc GHC.Utils.Misc
Remove duplicates but keep elements in order. O(n * log n)
OrdOp :: PrimOp
ghc GHC.Builtin.PrimOps
newtype OrdGr gr a b
ghc GHC.Data.Graph.Inductive.Graph
OrdGr comes equipped with an Ord instance, so that graphs can be used as e.g. Map keys.