Hoogle Search
Within LTS Haskell 24.46 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
lawsCheckMany :: [(String, [Laws])] -> IO ()quickcheck-classes Test.QuickCheck.Classes A convenience function for checking multiple typeclass instances of multiple types. Consider the following Haskell source file:
import Data.Proxy (Proxy(..)) import Data.Map (Map) import Data.Set (Set) -- A Proxy for Set Int. setInt :: Proxy (Set Int) setInt = Proxy -- A Proxy for Map Int Int. mapInt :: Proxy (Map Int Int) mapInt = Proxy myLaws :: Proxy a -> [Laws] myLaws p = [eqLaws p, monoidLaws p] namedTests :: [(String, [Laws])] namedTests = [ ("Set Int", myLaws setInt) , ("Map Int Int", myLaws mapInt) ]
Now, in GHCi:>>> lawsCheckMany namedTests
Testing properties for common typeclasses ------------- -- Set Int -- ------------- Eq: Transitive +++ OK, passed 100 tests. Eq: Symmetric +++ OK, passed 100 tests. Eq: Reflexive +++ OK, passed 100 tests. Monoid: Associative +++ OK, passed 100 tests. Monoid: Left Identity +++ OK, passed 100 tests. Monoid: Right Identity +++ OK, passed 100 tests. Monoid: Concatenation +++ OK, passed 100 tests. ----------------- -- Map Int Int -- ----------------- Eq: Transitive +++ OK, passed 100 tests. Eq: Symmetric +++ OK, passed 100 tests. Eq: Reflexive +++ OK, passed 100 tests. Monoid: Associative +++ OK, passed 100 tests. Monoid: Left Identity +++ OK, passed 100 tests. Monoid: Right Identity +++ OK, passed 100 tests. Monoid: Concatenation +++ OK, passed 100 tests.
In the case of a failing test, the program terminates with exit code 1.DisposalAny :: GifDisposalMethodJuicyPixels Codec.Picture.Gif No documentation available.
-
streaming-commons Data.Streaming.Network.Internal No documentation available.
Many :: [Either String a] -> (ByteString -> Parser a) -> Parser acassava Data.Csv.Incremental The parser parsed and converted zero or more records. Any records that failed type conversion are returned as Left errMsg and the rest as Right val. Feed a ByteString to the continuation to continue parsing. Use an empty string to indicate that no more input data is available. If fed an empty string, the continuation is guaranteed to return either Fail or Done.
gany :: GFoldable t => (a -> Bool) -> t a -> Boolgeneric-deriving Generics.Deriving.Foldable No documentation available.
-
generic-deriving Generics.Deriving.Monoid No documentation available.
-
optics-core Optics.IxFold Return whether or not any element viewed through an IxFold satisfies a predicate, with access to the i. When you don't need access to the index then anyOf is more flexible in what it accepts.
anyOf o ≡ ianyOf o . const
RegexErrorTooManyBranchesInDefine :: RegexErrorgi-glib GI.GLib.Enums "DEFINE" group contains more than one branch. Since 2.16
RegexErrorTooManyConditionalBranches :: RegexErrorgi-glib GI.GLib.Enums Conditional group contains more than two branches. Since 2.16
RegexErrorTooManyForwardReferences :: RegexErrorgi-glib GI.GLib.Enums too many forward references. Since: 2.34