Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
sortPair :: Ord a => (a, a) -> (a, a)utility-ht Data.Tuple.HT This is convenient for quick hacks but I suggest that you better define a type for an ordered pair for your application at hand. This way, you can clearly see from the type that a pair is ordered.
sortQuantVars :: [Var] -> [Var]ghc GHC.Core.Make Sort the variables, putting type and covars first, in scoped order, and then other Ids It is a deterministic sort, meaning it doesn't look at the values of Uniques. For explanation why it's important See Note [Unique Determinism] in GHC.Types.Unique.
sORTKind_maybe :: Kind -> Maybe (TypeOrConstraint, Type)ghc GHC.Core.Type No documentation available.
sortLocatedA :: HasLoc (EpAnn a) => [GenLocated (EpAnn a) e] -> [GenLocated (EpAnn a) e]ghc GHC.Parser.Annotation No documentation available.
sORTKind_maybe :: Kind -> Maybe (TypeOrConstraint, Type)ghc GHC.Plugins No documentation available.
sortHoleFitsByGraph :: [HoleFit] -> TcM [HoleFit]ghc GHC.Tc.Errors.Hole No documentation available.
sortHoleFitsBySize :: [HoleFit] -> TcM [HoleFit]ghc GHC.Tc.Errors.Hole Sort by size uses as a measure for relevance the sizes of the different types needed to instantiate the fit to the type of the hole. This is much quicker than sorting by subsumption, and gives reasonable results in most cases.
sortLocated :: [Located a] -> [Located a]ghc GHC.Types.SrcLoc No documentation available.
sortRealLocated :: [RealLocated a] -> [RealLocated a]ghc GHC.Types.SrcLoc No documentation available.
sortMsgBag :: Maybe DiagOpts -> Bag (MsgEnvelope e) -> [MsgEnvelope e]ghc GHC.Utils.Error No documentation available.