Safe Haskell | None |
---|---|
Language | GHC2024 |
Similar to subsequences
but for a tree structure
Synopsis
- data NodeType
- data CombinationTree a
- = CombiNode NodeType [CombinationTree a]
- | CombiLeaf a
- allTreePermutation :: CombinationTree a -> [[a]]
- mkFlatNode :: NodeType -> [a] -> CombinationTree a
- mkAll :: [a] -> CombinationTree a
- mkOneOf :: [a] -> CombinationTree a
- mkMayOneOf :: [a] -> CombinationTree a
Documentation
data CombinationTree a #
Instances
Show a => Show (CombinationTree a) # | |
Defined in Napkin.Backends.MsSql.ApiGen.CombinationTree showsPrec :: Int -> CombinationTree a -> ShowS # show :: CombinationTree a -> String # showList :: [CombinationTree a] -> ShowS # | |
Eq a => Eq (CombinationTree a) # | |
Defined in Napkin.Backends.MsSql.ApiGen.CombinationTree (==) :: CombinationTree a -> CombinationTree a -> Bool # (/=) :: CombinationTree a -> CombinationTree a -> Bool # |
allTreePermutation :: CombinationTree a -> [[a]] #
flattens combinations leaves left to right
mkFlatNode :: NodeType -> [a] -> CombinationTree a #
mkAll :: [a] -> CombinationTree a #
mkOneOf :: [a] -> CombinationTree a #
mkMayOneOf :: [a] -> CombinationTree a #