lude

Haskell prelude alternative
git clone git://git.rr3.xyz/lude | git clone gits://git.rr3.xyz/lude
Log | Files | Refs | README | LICENSE

commit bdc0d4814d4dfdf2603a407e42cd522ce45906d4
parent 96bf5b1f0bc63ad33b32a5e171469ee05a136423
Author: Robert Russell <robert@rr3.xyz>
Date:   Sat,  3 Oct 2026 17:17:00 -0700

Maybe: change unsafe naming scheme

Diffstat:
Msrc/Lude/Maybe.hs | 6+++---
Msrc/Lude/Order/Total.hs | 2+-
2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/src/Lude/Maybe.hs b/src/Lude/Maybe.hs @@ -1,6 +1,6 @@ module Lude.Maybe ( Maybe (..), - unsafeFromJust, + unsafe_fromJust, ) where import Data.Maybe (Maybe (..)) @@ -14,5 +14,5 @@ import Lude.Haskell -------------------------------------------------------------------------------- -unsafeFromJust :: forall (a :: Type). Maybe a -> a -unsafeFromJust = Base.fromJust +unsafe_fromJust :: forall (a :: Type). Maybe a -> a +unsafe_fromJust = Base.fromJust diff --git a/src/Lude/Order/Total.hs b/src/Lude/Order/Total.hs @@ -30,7 +30,7 @@ class (Latticed a) => TotallyOrdered (a :: Type# r) where cmp :: a -> a -> Ordering default cmp :: (Functional# r) => a -> a -> Ordering - cmp = unsafeFromJust .* pcmp + cmp = unsafe_fromJust .* pcmp min, max :: forall {r :: Repr} (a :: Type# r). (TotallyOrdered a) => Biendo a min = glb