Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. setElemName :: XmlNode a => QName -> a -> a

   hxt	Text.XML.HXT.DOM.XmlNode

   No documentation available.

2. setName :: XmlNode a => QName -> a -> a

   hxt	Text.XML.HXT.DOM.XmlNode

   No documentation available.

3. setPiName :: XmlNode a => QName -> a -> a

   hxt	Text.XML.HXT.DOM.XmlNode

   No documentation available.

4. setText :: XmlNode a => String -> a -> a

   hxt	Text.XML.HXT.DOM.XmlNode

   No documentation available.

5. setCons :: Listable a => ([a] -> b) -> [[b]]

   leancheck	Test.LeanCheck

   Given a constructor that takes a set of elements (as a list), lists tiers of applications of this constructor. A naive Listable instance for the Set (of Data.Set) would read:

   instance Listable a => Listable (Set a) where
   tiers  =  cons0 empty \/ cons2 insert
   

   The above instance has a problem: it generates repeated sets. A more efficient implementation that does not repeat sets is given by:

   tiers  =  setCons fromList
   

   Alternatively, you can use setsOf direclty.

6. setsOf :: [[a]] -> [[[a]]]

   leancheck	Test.LeanCheck

   Takes as argument tiers of element values; returns tiers of size-ordered lists of elements without repetition.

   setsOf [[0],[1],[2],...] =
   [ [[]]
   , [[0]]
   , [[1]]
   , [[0,1],[2]]
   , [[0,2],[3]]
   , [[0,3],[1,2],[4]]
   , [[0,1,2],[0,4],[1,3],[5]]
   , ...
   ]
   

   Can be used in the constructor of specialized Listable instances. For Set (from Data.Set), we would have:

   instance Listable a => Listable (Set a) where
   tiers  =  mapT fromList $ setsOf tiers
   

7. setCons :: Listable a => ([a] -> b) -> [[b]]

   leancheck	Test.LeanCheck.Error

   Given a constructor that takes a set of elements (as a list), lists tiers of applications of this constructor. A naive Listable instance for the Set (of Data.Set) would read:

   instance Listable a => Listable (Set a) where
   tiers  =  cons0 empty \/ cons2 insert
   

   The above instance has a problem: it generates repeated sets. A more efficient implementation that does not repeat sets is given by:

   tiers  =  setCons fromList
   

   Alternatively, you can use setsOf direclty.

8. setsOf :: [[a]] -> [[[a]]]

   leancheck	Test.LeanCheck.Error

   Takes as argument tiers of element values; returns tiers of size-ordered lists of elements without repetition.

   setsOf [[0],[1],[2],...] =
   [ [[]]
   , [[0]]
   , [[1]]
   , [[0,1],[2]]
   , [[0,2],[3]]
   , [[0,3],[1,2],[4]]
   , [[0,1,2],[0,4],[1,3],[5]]
   , ...
   ]
   

   Can be used in the constructor of specialized Listable instances. For Set (from Data.Set), we would have:

   instance Listable a => Listable (Set a) where
   tiers  =  mapT fromList $ setsOf tiers
   

9. setChoices :: [[a]] -> [[(a, [[a]])]]

   leancheck	Test.LeanCheck.Tiers

   Like choices but lists tiers of strictly ascending choices. Used to construct setsOf values.

   setChoices [[False,True]] == [[(False,[[True]]),(True,[[]])]]
   setChoices [[1],[2],[3]]
   == [ [(1,[[],[2],[3]])]
   , [(2,[[],[],[3]])]
   , [(3,[[],[],[]])]
   ]
   

10. setCons :: Listable a => ([a] -> b) -> [[b]]

    leancheck	Test.LeanCheck.Tiers

    Given a constructor that takes a set of elements (as a list), lists tiers of applications of this constructor. A naive Listable instance for the Set (of Data.Set) would read:

    instance Listable a => Listable (Set a) where
    tiers  =  cons0 empty \/ cons2 insert
    

    The above instance has a problem: it generates repeated sets. A more efficient implementation that does not repeat sets is given by:

    tiers  =  setCons fromList
    

    Alternatively, you can use setsOf direclty.

Page 270 of many | Previous | Next