| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Tree.Knuth.Forest
- data KnuthForest a
- = Fork {
- kNode :: a
- kChildren :: KnuthForest a
- kSiblings :: KnuthForest a
- | Nil
- = Fork {
- size :: KnuthForest a -> Int
- elem :: Eq a => a -> KnuthForest a -> Bool
- isSubforestOf :: Eq a => KnuthForest a -> KnuthForest a -> Bool
- isSubforestOf' :: Eq a => KnuthForest a -> KnuthForest a -> Bool
- isProperSubforestOf :: Eq a => KnuthForest a -> KnuthForest a -> Bool
- isProperSubforestOf' :: Eq a => KnuthForest a -> KnuthForest a -> Bool
- isSiblingOf :: Eq a => a -> KnuthForest a -> Bool
- isChildOf :: Eq a => a -> KnuthForest a -> Bool
- isDescendantOf :: Eq a => a -> KnuthForest a -> Bool
- isProperDescendantOf :: Eq a => a -> KnuthForest a -> Bool
- singleton :: a -> KnuthForest a
- delete :: Eq a => a -> KnuthForest a -> KnuthForest a
- union :: KnuthForest a -> KnuthForest a -> KnuthForest a
- intersection :: Eq a => KnuthForest a -> KnuthForest a -> KnuthForest a
- difference :: Eq a => KnuthForest a -> KnuthForest a -> KnuthForest a
Forest
data KnuthForest a Source
Constructors
| Fork | |
Fields
| |
| Nil | |
Instances
| Monad KnuthForest Source | Breadth-first |
| Functor KnuthForest Source | |
| Applicative KnuthForest Source | Zippy |
| Foldable KnuthForest Source | Breadth-first |
| Traversable KnuthForest Source | |
| Alternative KnuthForest Source | |
| MonadPlus KnuthForest Source | |
| Witherable KnuthForest Source | |
| RoseTree KnuthForest Source | |
| HasSingleton a (KnuthForest a) Source | |
| Eq a => HasDelete a (KnuthForest a) Source | |
| Eq a => Eq (KnuthForest a) Source | |
| Ord a => Ord (KnuthForest a) Source | Siblings before children |
| Show a => Show (KnuthForest a) Source | |
| Monoid (KnuthForest a) Source | |
| Semigroup (KnuthForest a) Source | |
| HasUnion (KnuthForest a) Source | |
| HasSize (KnuthForest a) Source | |
| Eq a => HasIntersection (KnuthForest a) Source | |
| HasEmpty (KnuthForest a) Source | |
| Eq a => HasDifference (KnuthForest a) Source | |
| Arbitrary a => Arbitrary (KnuthForest a) Source | |
| type Tail (KnuthForest a) = KnuthForest a Source | |
| type Head (KnuthForest a) = a Source |
Query
size :: KnuthForest a -> Int Source
elem :: Eq a => a -> KnuthForest a -> Bool Source
isSubforestOf :: Eq a => KnuthForest a -> KnuthForest a -> Bool Source
isSubforestOf' :: Eq a => KnuthForest a -> KnuthForest a -> Bool Source
isProperSubforestOf :: Eq a => KnuthForest a -> KnuthForest a -> Bool Source
No siblings
isProperSubforestOf' :: Eq a => KnuthForest a -> KnuthForest a -> Bool Source
Depth-first
isSiblingOf :: Eq a => a -> KnuthForest a -> Bool Source
isChildOf :: Eq a => a -> KnuthForest a -> Bool Source
depth of one
isDescendantOf :: Eq a => a -> KnuthForest a -> Bool Source
isProperDescendantOf :: Eq a => a -> KnuthForest a -> Bool Source
Construction
singleton :: a -> KnuthForest a Source
delete :: Eq a => a -> KnuthForest a -> KnuthForest a Source
Combination
union :: KnuthForest a -> KnuthForest a -> KnuthForest a Source
intersection :: Eq a => KnuthForest a -> KnuthForest a -> KnuthForest a Source
difference :: Eq a => KnuthForest a -> KnuthForest a -> KnuthForest a Source
Removes the possible subtree on the right, from the left.