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.

Exact lookup

1. numberOfPossibilitiesRummy :: Integer

   combinatorial	Combinatorics.CardPairs

   No documentation available.

2. numberOfPossibilitiesRummyJK :: Integer

   combinatorial	Combinatorics.CardPairs

   No documentation available.

3. numberOfPossibilitiesSkat :: Integer

   combinatorial	Combinatorics.CardPairs

   No documentation available.

4. numberDistinct :: Int -> Int -> Int -> Int -> Integer

   combinatorial	Combinatorics.Mastermind

   numberDistinct n k b w computes the number of matching codes, given that all codes have distinct symbols. n is the alphabet size, k the width of the code, b the number of black evaluation sticks and w the number of white evaluation sticks.

   QC.forAll genMastermindDistinct $ \(n,k,b,w) -> let alphabet = take n ['a'..]; code = take k alphabet in Mastermind.numberDistinct n k b w == (genericLength $ filter ((Mastermind.Eval b w ==) . Mastermind.evaluate code) $ Comb.variate k alphabet)
   

5. numberDistinctWhite :: Int -> Int -> Int -> Integer

   combinatorial	Combinatorics.Mastermind

   QC.forAll genMastermindDistinct $ \(n,k,_b,w) -> Mastermind.numberDistinctWhite n k w == Mastermind.numberDistinct n k 0 w
   

6. numberOfPossibilities :: [Int]

   combinatorial	Combinatorics.MaxNim

   No documentation available.

7. numbersOfGames :: [Int]

   combinatorial	Combinatorics.PaperStripGame

   No documentation available.

8. numbersOfGamesSeries :: [Integer]

   combinatorial	Combinatorics.PaperStripGame

   No documentation available.

9. numPartitions :: [Integer]

   combinatorial	Combinatorics.Partitions

   No documentation available.

10. numbers :: Num a => [[a]]

    combinatorial	Combinatorics.Permutation.WithoutSomeFixpoints

    http://oeis.org/A047920

    QC.forAll genPermutationWOFP $ \(k,xs) -> PermWOFP.numbers !! length xs !! k == length (PermWOFP.enumerate k xs)
    

    QC.forAll (QC.choose (0,100)) $ \k -> Comb.factorial (toInteger k) == PermWOFP.numbers !! k !! 0
    

    QC.forAll (QC.choose (0,100)) $ \k -> Comb.derangementNumber (toInteger k) == PermWOFP.numbers !! k !! k
    

Page 88 of many | Previous | Next