Hoogle Search

Within LTS Haskell 24.42 (ghc-9.10.3)

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

Exact lookup

1. allCE :: forall (m :: Type -> Type) mono o . (Monad m, MonoFoldable mono) => (Element mono -> Bool) -> ConduitT mono o m Bool

   classy-prelude-conduit	ClassyPrelude.Conduit

   Check that all elements in the chunked stream return True. Subject to shortcut logic: at the first False, consumption of the stream will stop.

2. allNewBuffersStrategy :: Int -> BufferAllocStrategy

   classy-prelude-conduit	ClassyPrelude.Conduit

   The simplest buffer allocation strategy: whenever a buffer is requested, allocate a new one that is big enough for the next build step to execute. NOTE that this allocation strategy may spill quite some memory upon direct insertion of a bytestring by the builder. Thats no problem for garbage collection, but it may lead to unreasonably high memory consumption in special circumstances.

3. allocateAcquire :: MonadResource m => Acquire a -> m (ReleaseKey, a)

   classy-prelude-conduit	ClassyPrelude.Conduit

   Allocate a resource and register an action with the MonadResource to free the resource.

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

   combinatorial	Combinatorics.CardPairs

   No documentation available.

5. allPossibilitiesMedium :: [[Card]]

   combinatorial	Combinatorics.CardPairs

   No documentation available.

6. allPossibilitiesSkat :: [[Card]]

   combinatorial	Combinatorics.CardPairs

   No documentation available.

7. allPossibilitiesSmall :: [[Card]]

   combinatorial	Combinatorics.CardPairs

   No documentation available.

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

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

   config-ini	Data.Ini.Config.Bidir

   Treat an entire section as containing entirely optional fields.

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

    countable	Data.Searchable

    Not necessarily in counting order.

Page 109 of many | Previous | Next