Hoogle Search
Within LTS Haskell 24.32 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
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
allRotations :: CList a -> CList (CList a)data-clist Data.CircularList Return all possible rotations of the provided CList, where the focus is the provided CList.
allRotations :: CList a -> CList (CList a)data-clist Data.CircularList.Internal Return all possible rotations of the provided CList, where the focus is the provided CList.
allBlocked :: BuildableInfo a -> [a]debian Debian.GenBuildDeps No documentation available.
allChanges :: (Monoid c, Ord c) => Params v o c -> Vector v -> Vector v -> ChangeMatrix o cedit-distance-vector Data.Vector.Distance O(nm). Calculate the complete matrix of edit scripts and costs between two vectors.