fixed

Pure Haskell large fixed-width integers and Montgomery arithmetic.
git clone git://git.ppad.tech/fixed.git
Log | Files | Refs | README | LICENSE

commit 497ffce0197e28b28e7534a278d52002accfd5b9
parent 92b527cd0141dbd24b28e92290c0b5949d1a4a0c
Author: Jared Tobin <jared@jtobin.io>
Date:   Sun, 21 Dec 2025 17:36:24 -0330

lib: return choice in wider comparisons

Diffstat:
Mlib/Data/Word/Wider.hs | 8++++----
1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/lib/Data/Word/Wider.hs b/lib/Data/Word/Wider.hs @@ -161,8 +161,8 @@ lt# a b = in C.from_word_mask# bor {-# INLINE lt# #-} -lt :: Wider -> Wider -> Bool -lt (Wider a) (Wider b) = C.decide (lt# a b) +lt :: Wider -> Wider -> C.Choice +lt (Wider a) (Wider b) = lt# a b gt# :: (# Limb, Limb, Limb, Limb #) @@ -173,8 +173,8 @@ gt# a b = in C.from_word_mask# bor {-# INLINE gt# #-} -gt :: Wider -> Wider -> Bool -gt (Wider a) (Wider b) = C.decide (gt# a b) +gt :: Wider -> Wider -> C.Choice +gt (Wider a) (Wider b) = gt# a b cmp# :: (# Limb, Limb, Limb, Limb #)