Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. k_any :: String

   hxt	Text.XML.HXT.DOM.XmlKeywords

   No documentation available.

2. v_any :: String

   hxt	Text.XML.HXT.DOM.XmlKeywords

   No documentation available.

3. xsd_anyURI :: String

   hxt	Text.XML.HXT.XMLSchema.DataTypeLibW3CNames

   No documentation available.

4. lawsCheckMany :: [(String, [Laws])] -> IO ()

   quickcheck-classes-base	Test.QuickCheck.Classes.Base

   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.

5. data Many a b

   selective	Control.Selective.Multi

   A potentially uncountable collection of tags for the same unit () payload.

6. Many :: forall a . a -> Many a ()

   selective	Control.Selective.Multi

   No documentation available.

7. many :: a -> Sigma (Many a)

   selective	Control.Selective.Multi

   No documentation available.

8. matchAny :: Graph gr => gr a b -> GDecomp gr a b

   fgl	Data.Graph.Inductive.Graph

   Decompose a graph into the Context for an arbitrarily-chosen Node and the remaining Graph.

9. matchAnyM :: GraphM m gr => m (gr a b) -> m (GDecomp gr a b)

   fgl	Data.Graph.Inductive.Monad

   No documentation available.

10. DeriveAnyClass :: Extension

    ghc-boot-th	GHC.LanguageExtensions.Type

    No documentation available.

Page 131 of many | Previous | Next