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.

  1. allPossibilities :: CardSet a -> [[a]]

    combinatorial Combinatorics.CardPairs

    No documentation available.

  2. allPossibilitiesMedium :: [[Card]]

    combinatorial Combinatorics.CardPairs

    No documentation available.

  3. allPossibilitiesSkat :: [[Card]]

    combinatorial Combinatorics.CardPairs

    No documentation available.

  4. allPossibilitiesSmall :: [[Card]]

    combinatorial Combinatorics.CardPairs

    No documentation available.

  5. 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
    

  6. allOptional :: (SectionSpec s () -> IniSpec s ()) -> SectionSpec s () -> IniSpec s ()

    config-ini Data.Ini.Config.Bidir

    Treat an entire section as containing entirely optional fields.

  7. allValues :: Finite a => [a]

    countable Data.Searchable

    Not necessarily in counting order.

  8. allWords :: [String] -> String

    cron System.Cron.Internal.Describe.Utils

    No documentation available.

  9. allOnes :: BinaryWord w => w

    data-bword Data.BinaryWord

    The word with all bits set to 1

  10. allZeroes :: BinaryWord w => w

    data-bword Data.BinaryWord

    The word with all bits set to 0

Page 109 of many | Previous | Next