packages feed

unamb 0.1.6 → 0.1.7

raw patch · 3 files changed

+10/−8 lines, 3 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

src/Data/Unamb.hs view
@@ -13,7 +13,7 @@ --  -- For non-flat types (where values may be partially defined, rather than -- necessarily bottom or fully defined) and information merging, see the--- '''lub''' package.+-- lub package, <http://haskell.org/haskellwiki/Lub>. ----------------------------------------------------------------------  -- #include "Typeable.h"@@ -120,7 +120,7 @@ assuming True  a = a assuming False _ = undefined --- | The value of agreeing values (or hang)+-- | The value of agreeing values (or undefined/bottom) asAgree :: Eq a => a -> a -> a a `asAgree` b = assuming (a == b) a @@ -159,8 +159,8 @@ --- TODO: This definition may be too strict, as it won't use @op@ unless --- it can prove @y /= ann@.  A lazier version: --- | Binary operation with annihilator element.  For instance, '(*)'/0,--- '(&&)'/'False', '(||)'/'True', 'min'/'minBound', 'max'/'maxBound'.+-- | Binary operation with annihilator element.  For instance, (*) & 0,+-- (&&) & 'False', (||) & 'True', 'min' & 'minBound', 'max' & 'maxBound'. -- Tests either argument as annihilator, in parallel. parAnnihilator :: Eq a => (a -> a -> a) -> a -> (a -> a -> a) parAnnihilator op ann x y =@@ -168,8 +168,8 @@   assuming (y == ann) ann `unamb`   (x `op` y) --- | Binary operation with left & right identity element.  For instance, '(*)'/1,--- '(&&)'/'True', '(||)'/'False', 'min'/'maxBound', 'max'/'minBound'.+-- | Binary operation with left & right identity element.  For instance, (*) & 1,+-- (&&) & 'True', (||) & 'False', 'min' & 'maxBound', 'max' & 'minBound'. -- Tests either argument as identity, in parallel. parIdentity :: (Eq a) => (a -> a -> a) -> a -> a -> a -> a parIdentity op ident x y =@@ -182,7 +182,7 @@ pmin :: (Ord a, Bounded a) => a -> a -> a pmin = parAnnihilator min minBound --- | Parallel max with minBound short-circuit+-- | Parallel max with maxBound short-circuit pmax :: (Ord a, Bounded a) => a -> a -> a pmax = parAnnihilator max maxBound 
unamb.cabal view
@@ -1,5 +1,5 @@ Name:                unamb-Version:             0.1.6+Version:             0.1.7 Cabal-Version:       >= 1.2 Synopsis:            Unambiguous choice Category:            Concurrency, Data, Other
wikipage.tw view
@@ -19,6 +19,8 @@ <!-- * See the [[unamb/Versions| version history]]. -->  <!-- Please leave comments at the [[Talk:unamb|Talk page]]. -->+See also the [[lub]] package, which extends unamb's usefulness with non-flat types.+ As of version 0.1.1, unamb requires ghc 6.10 or better.  As of version 0.1.6, unamb correctly handles recursive termination of sub-efforts and automatic restarting, but only with the GHC RTS fixes that first appeared (stably, by my testing) in GHC HEAD version 6.11.20090115.