Data.Tree.Set

Documentation

data SetTree a

Constructors

SetTree

Fields

• sNode :: a
• sChildren :: !(Set (SetTree a))

Instances

Foldable SetTree

Defined in Data.Tree.Set

Methods

fold :: Monoid m => SetTree m -> m

foldMap :: Monoid m => (a -> m) -> SetTree a -> m

foldr :: (a -> b -> b) -> b -> SetTree a -> b

foldr' :: (a -> b -> b) -> b -> SetTree a -> b

foldl :: (b -> a -> b) -> b -> SetTree a -> b

foldl' :: (b -> a -> b) -> b -> SetTree a -> b

foldr1 :: (a -> a -> a) -> SetTree a -> a

foldl1 :: (a -> a -> a) -> SetTree a -> a

toList :: SetTree a -> [a]

null :: SetTree a -> Bool

length :: SetTree a -> Int

elem :: Eq a => a -> SetTree a -> Bool

maximum :: Ord a => SetTree a -> a

minimum :: Ord a => SetTree a -> a

sum :: Num a => SetTree a -> a

product :: Num a => SetTree a -> a

Foldable1 SetTree

Defined in Data.Tree.Set

Methods

fold1 :: Semigroup m => SetTree m -> m

foldMap1 :: Semigroup m => (a -> m) -> SetTree a -> m

toNonEmpty :: SetTree a -> NonEmpty a

RoseTree SetTree

Defined in Data.Tree.Rose

Methods

(@->) :: Head (SetTree a) -> Tail (SetTree a) -> SetTree a

HasSingleton a (SetTree a)

Defined in Data.Tree.Set

Methods

singleton :: a -> SetTree a

Eq a => Eq (SetTree a)

Defined in Data.Tree.Set

Methods

(==) :: SetTree a -> SetTree a -> Bool

(/=) :: SetTree a -> SetTree a -> Bool

(Data a, Ord a) => Data (SetTree a)

Defined in Data.Tree.Set

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SetTree a -> c (SetTree a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (SetTree a)

toConstr :: SetTree a -> Constr

dataTypeOf :: SetTree a -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (SetTree a))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (SetTree a))

gmapT :: (forall b. Data b => b -> b) -> SetTree a -> SetTree a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SetTree a -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SetTree a -> r

gmapQ :: (forall d. Data d => d -> u) -> SetTree a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> SetTree a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> SetTree a -> m (SetTree a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SetTree a -> m (SetTree a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SetTree a -> m (SetTree a)

Ord a => Ord (SetTree a)

Defined in Data.Tree.Set

Methods

compare :: SetTree a -> SetTree a -> Ordering

(<) :: SetTree a -> SetTree a -> Bool

(<=) :: SetTree a -> SetTree a -> Bool

(>) :: SetTree a -> SetTree a -> Bool

(>=) :: SetTree a -> SetTree a -> Bool

max :: SetTree a -> SetTree a -> SetTree a

min :: SetTree a -> SetTree a -> SetTree a

Show a => Show (SetTree a)

Defined in Data.Tree.Set

Methods

showsPrec :: Int -> SetTree a -> ShowS

show :: SetTree a -> String

showList :: [SetTree a] -> ShowS

Generic (SetTree a)

Defined in Data.Tree.Set

Associated Types

type Rep (SetTree a) :: Type -> Type

Methods

from :: SetTree a -> Rep (SetTree a) x

to :: Rep (SetTree a) x -> SetTree a

Ord a => Semigroup (SetTree a)

Defined in Data.Tree.Set

Methods

(<>) :: SetTree a -> SetTree a -> SetTree a

sconcat :: NonEmpty (SetTree a) -> SetTree a

stimes :: Integral b => b -> SetTree a -> SetTree a

(Ord a, Arbitrary a) => Arbitrary (SetTree a)

Defined in Data.Tree.Set

Methods

arbitrary :: Gen (SetTree a)

shrink :: SetTree a -> [SetTree a]

NFData a => NFData (SetTree a)

Defined in Data.Tree.Set

Methods

rnf :: SetTree a -> ()

HasSize (SetTree a)

Defined in Data.Tree.Set

Methods

size :: SetTree a -> Int

type Rep (SetTree a)

Defined in Data.Tree.Set

type Rep (SetTree a) = D1 (MetaData "SetTree" "Data.Tree.Set" "rose-trees-0.0.4.5-A00tWdqblf7Al7c9J60KpO" False) (C1 (MetaCons "SetTree" PrefixI True) (S1 (MetaSel (Just "sNode") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a) :*: S1 (MetaSel (Just "sChildren") NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 (Set (SetTree a)))))

type Tail (SetTree a)

Defined in Data.Tree.Rose

type Tail (SetTree a) = Set (SetTree a)

type Head (SetTree a)

Defined in Data.Tree.Rose

type Head (SetTree a) = a

Query

elem :: Eq a => a -> SetTree a -> Bool

set-like alias for isDescendantOf.

elemPath :: 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

Heirarchical analogue to subseteq.

isSubtreeOf' :: Eq a => SetTree a -> SetTree a -> Bool

Bottom-up version

isProperSubtreeOf :: Eq a => SetTree a -> SetTree a -> Bool

isProperSubtreeOf' :: Eq a => SetTree a -> SetTree a -> Bool

Bottom-up version

eqHead :: Eq a => SetTree a -> SetTree a -> Bool

Construction

insertChild :: Ord a => SetTree a -> SetTree a -> SetTree a

delete :: Eq a => a -> SetTree a -> Maybe (SetTree a)

singleton :: a -> SetTree a

Filtering

filter :: Eq a => (a -> Bool) -> SetTree a -> Maybe (SetTree a)

Mapping

map :: Ord b => (a -> b) -> SetTree a -> SetTree b

mapMaybe :: Eq b => (a -> Maybe b) -> SetTree a -> Maybe (SetTree b)

toTree :: SetTree a -> Tree a

fromTree :: Ord a => Tree a -> SetTree a