Hoogle Search
Within LTS Haskell 24.32 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
equateUSDFM :: Uniquable key => UniqSDFM key ele -> key -> key -> (Maybe ele, UniqSDFM key ele)ghc-lib-parser GHC.Types.Unique.SDFM equateUSDFM env x y makes x and y point to the same entry, thereby merging x's class with y's. If both x and y are in the domain of the map, then y's entry will be chosen as the new entry and x's old entry will be returned. Examples in terms of the model (see UniqSDFM): >>> equateUSDFM [] u1 u2 == (Nothing, [({u1,u2}, Nothing)]) >>> equateUSDFM [({u1,u3}, Just ele1)] u3 u4 == (Nothing, [({u1,u3,u4}, Just ele1)]) >>> equateUSDFM [({u1,u3}, Just ele1)] u4 u3 == (Nothing, [({u1,u3,u4}, Just ele1)]) >>> equateUSDFM [({u1,u3}, Just ele1), ({u2}, Just ele2)] u3 u2 == (Just ele1, [({u2,u1,u3}, Just ele2)])
equalLength :: [a] -> [b] -> Boolghc-lib-parser GHC.Utils.Misc True if length xs == length ys
-
ghc-lib-parser GHC.Utils.Outputable No documentation available.
-
ghc-lib-parser GHC.Utils.Ppr No documentation available.
equals# :: forall (n :: Nat) . Fin# n -> Fin# n -> Boolnatural-arithmetic Arithmetic.Fin No documentation available.
eqCast :: (a == b) ~ 'True => a -> bsingleton-bool Data.Singletons.Bool No documentation available.
-
wl-pprint-text Text.PrettyPrint.Leijen.Text The document equals contains an equal sign, "=".
equals :: Applicative m => m Docwl-pprint-text Text.PrettyPrint.Leijen.Text.Monadic The document equals contains an equal sign, "=".
equal :: forall (f :: Type -> Type) . (Functor f, Foldable f, Eq1 f) => Day f f Bool -> Boolyaya Yaya.Fold.Common Provides equality over arbitrary pattern functors.
equalDay :: (Functor f, Foldable f) => (f () -> f () -> Bool) -> Day f f Bool -> Boolyaya Yaya.Fold.Common Provides equality over arbitrary pattern functors.