| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Test.Tasty.Sugar.Iterations
Synopsis
- type IterStat = Map Text Int
- emptyStats :: IterStat
- joinStats :: IterStat -> IterStat -> IterStat
- type LogicI a = LogicT (StateT IterStat Identity) a
- addSubLogicStats :: (a, IterStat) -> LogicI a
- observeIAll :: LogicI a -> ([a], IterStat)
- observeIT :: LogicI a -> ([a], IterStat)
- eachFrom :: Text -> [a] -> LogicI a
- combosLongToShort :: Eq a => [a] -> [[a]]
Documentation
addSubLogicStats :: (a, IterStat) -> LogicI a Source #
observeIAll :: LogicI a -> ([a], IterStat) Source #
eachFrom :: Text -> [a] -> LogicI a Source #
Core Logic function to iteratively return elements of a list via backtracking.
combosLongToShort :: Eq a => [a] -> [[a]] Source #
Given a list, return the list of lists representing all permutations of the same length or shorter, removing any duplications, from longest to shortest (shortest being the empty list).