Hoogle Search

Within LTS Haskell 24.39 (ghc-9.10.3)

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

Exact lookup

1. numNeedles :: Searcher v -> Int

   alfred-margaret	Data.Text.AhoCorasick.Searcher

   No documentation available.

2. numNeedles :: Searcher v -> Int

   alfred-margaret	Data.Text.BoyerMoore.Searcher

   No documentation available.

3. numNeedles :: Searcher v -> Int

   alfred-margaret	Data.Text.BoyerMooreCI.Searcher

   No documentation available.

4. numChar :: Gen Char

   bcp47	Data.BCP47.Internal.Arbitrary

   No documentation available.

5. numIterations :: SolveArgs -> Int

   boltzmann-samplers	Boltzmann.Solver

   No documentation available.

6. numberOfAllPossibilities :: CardCount Int -> Integer

   combinatorial	Combinatorics.CardPairs

   No documentation available.

7. numberOfPossibilitiesRummy :: Integer

   combinatorial	Combinatorics.CardPairs

   No documentation available.

8. numberOfPossibilitiesRummyJK :: Integer

   combinatorial	Combinatorics.CardPairs

   No documentation available.

9. numberOfPossibilitiesSkat :: Integer

   combinatorial	Combinatorics.CardPairs

   No documentation available.

10. 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)
    

Page 87 of many | Previous | Next