Hoogle Search
Within LTS Haskell 24.67 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
allPossibilities :: CardSet a -> [[a]]combinatorial Combinatorics.CardPairs No documentation available.
allPossibilitiesMedium :: [[Card]]combinatorial Combinatorics.CardPairs No documentation available.
allPossibilitiesSkat :: [[Card]]combinatorial Combinatorics.CardPairs No documentation available.
allPossibilitiesSmall :: [[Card]]combinatorial Combinatorics.CardPairs No documentation available.
allPartitionsInc :: [[[[Int]]]]combinatorial Combinatorics.Partitions type Int is needed because of list node indexing
QC.forAll (QC.choose (1,10)) $ \k -> QC.forAll (QC.choose (0,50)) $ \n -> Parts.partitionsInc k n == Parts.allPartitionsInc !! k !! n
equating (take 30) (map genericLength (Parts.allPartitionsInc !! 1)) Parts.numPartitions
allOptional :: (SectionSpec s () -> IniSpec s ()) -> SectionSpec s () -> IniSpec s ()config-ini Data.Ini.Config.Bidir Treat an entire section as containing entirely optional fields.
-
countable Data.Searchable Not necessarily in counting order.
allWords :: [String] -> Stringcron System.Cron.Internal.Describe.Utils No documentation available.
-
data-bword Data.BinaryWord The word with all bits set to 1
allZeroes :: BinaryWord w => wdata-bword Data.BinaryWord The word with all bits set to 0