Safe Haskell | None |
---|---|
Language | Haskell2010 |
- data SetTree a = SetTree {}
- elem :: Eq a => a -> SetTree a -> Bool
- size :: SetTree a -> Int
- isChildOf :: Eq a => a -> SetTree a -> Bool
- isDescendantOf :: Eq a => a -> SetTree a -> Bool
- isSubtreeOf :: Eq a => SetTree a -> SetTree a -> Bool
- isSubtreeOf' :: Eq a => SetTree a -> SetTree a -> Bool
- isProperSubtreeOf :: Eq a => SetTree a -> SetTree a -> Bool
- isProperSubtreeOf' :: Eq a => SetTree a -> SetTree a -> Bool
- eqHead :: Eq a => SetTree a -> SetTree a -> Bool
- insertChild :: Ord a => SetTree a -> SetTree a -> SetTree a
- delete :: Eq a => a -> SetTree a -> Maybe (SetTree a)
- singleton :: a -> SetTree a
- filter :: Eq a => (a -> Bool) -> SetTree a -> Maybe (SetTree a)
- map :: Ord b => (a -> b) -> SetTree a -> SetTree b
- mapMaybe :: Eq b => (a -> Maybe b) -> SetTree a -> Maybe (SetTree b)
Documentation
Foldable SetTree Source | |
Foldable1 SetTree Source | |
RoseTree SetTree Source | |
HasSingleton a (SetTree a) Source | |
Eq a => Eq (SetTree a) Source | |
(Data a, Ord a) => Data (SetTree a) Source | |
Ord a => Ord (SetTree a) Source | |
Show a => Show (SetTree a) Source | |
Generic (SetTree a) Source | |
NFData a => NFData (SetTree a) Source | |
HasSize (SetTree a) Source | |
(Ord a, Arbitrary a) => Arbitrary (SetTree a) Source | |
type Rep (SetTree a) Source | |
type Tail (SetTree a) = Set (SetTree a) Source | |
type Head (SetTree a) = a Source |
Query
isDescendantOf :: Eq a => a -> SetTree a -> Bool Source