Data.Tree.Knuth.Forest

Forest

data KnuthForest a

Constructors

Fork

Fields

• kNode :: a
• kChildren :: KnuthForest a
• kSiblings :: KnuthForest a

Nil

Instances

Monad KnuthForest

Breadth-first

Defined in Data.Tree.Knuth.Forest

Methods

(>>=) :: KnuthForest a -> (a -> KnuthForest b) -> KnuthForest b

(>>) :: KnuthForest a -> KnuthForest b -> KnuthForest b

return :: a -> KnuthForest a

fail :: String -> KnuthForest a

Functor KnuthForest

Defined in Data.Tree.Knuth.Forest

Methods

fmap :: (a -> b) -> KnuthForest a -> KnuthForest b

(<$) :: a -> KnuthForest b -> KnuthForest a

Applicative KnuthForest

Zippy

Defined in Data.Tree.Knuth.Forest

Methods

pure :: a -> KnuthForest a

(<*>) :: KnuthForest (a -> b) -> KnuthForest a -> KnuthForest b

liftA2 :: (a -> b -> c) -> KnuthForest a -> KnuthForest b -> KnuthForest c

(*>) :: KnuthForest a -> KnuthForest b -> KnuthForest b

(<*) :: KnuthForest a -> KnuthForest b -> KnuthForest a

Foldable KnuthForest

Breadth-first

Defined in Data.Tree.Knuth.Forest

Methods

fold :: Monoid m => KnuthForest m -> m

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

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

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

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

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

foldr1 :: (a -> a -> a) -> KnuthForest a -> a

foldl1 :: (a -> a -> a) -> KnuthForest a -> a

toList :: KnuthForest a -> [a]

null :: KnuthForest a -> Bool

length :: KnuthForest a -> Int

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

maximum :: Ord a => KnuthForest a -> a

minimum :: Ord a => KnuthForest a -> a

sum :: Num a => KnuthForest a -> a

product :: Num a => KnuthForest a -> a

Traversable KnuthForest

Defined in Data.Tree.Knuth.Forest

Methods

traverse :: Applicative f => (a -> f b) -> KnuthForest a -> f (KnuthForest b)

sequenceA :: Applicative f => KnuthForest (f a) -> f (KnuthForest a)

mapM :: Monad m => (a -> m b) -> KnuthForest a -> m (KnuthForest b)

sequence :: Monad m => KnuthForest (m a) -> m (KnuthForest a)

Alternative KnuthForest

Defined in Data.Tree.Knuth.Forest

Methods

empty :: KnuthForest a

(<|>) :: KnuthForest a -> KnuthForest a -> KnuthForest a

some :: KnuthForest a -> KnuthForest [a]

many :: KnuthForest a -> KnuthForest [a]

MonadPlus KnuthForest

Defined in Data.Tree.Knuth.Forest

Methods

mzero :: KnuthForest a

mplus :: KnuthForest a -> KnuthForest a -> KnuthForest a

Filterable KnuthForest

Defined in Data.Tree.Knuth.Forest

Methods

mapMaybe :: (a -> Maybe b) -> KnuthForest a -> KnuthForest b

catMaybes :: KnuthForest (Maybe a) -> KnuthForest a

filter :: (a -> Bool) -> KnuthForest a -> KnuthForest a

RoseTree KnuthForest

Defined in Data.Tree.Rose

Methods

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

HasSingleton a (KnuthForest a)

Defined in Data.Tree.Knuth.Forest

Methods

singleton :: a -> KnuthForest a

Eq a => HasDelete a (KnuthForest a)

Defined in Data.Tree.Knuth.Forest

Methods

delete :: a -> KnuthForest a -> KnuthForest a

Eq a => Eq (KnuthForest a)

Defined in Data.Tree.Knuth.Forest

Methods

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

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

Data a => Data (KnuthForest a)

Defined in Data.Tree.Knuth.Forest

Methods

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

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

toConstr :: KnuthForest a -> Constr

dataTypeOf :: KnuthForest a -> DataType

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

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

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

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

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

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

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

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

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

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

Ord a => Ord (KnuthForest a)

Siblings before children

Defined in Data.Tree.Knuth.Forest

Methods

compare :: KnuthForest a -> KnuthForest a -> Ordering

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

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

(>) :: KnuthForest a -> KnuthForest a -> Bool

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

max :: KnuthForest a -> KnuthForest a -> KnuthForest a

min :: KnuthForest a -> KnuthForest a -> KnuthForest a

Show a => Show (KnuthForest a)

Defined in Data.Tree.Knuth.Forest

Methods

showsPrec :: Int -> KnuthForest a -> ShowS

show :: KnuthForest a -> String

showList :: [KnuthForest a] -> ShowS

Generic (KnuthForest a)

Defined in Data.Tree.Knuth.Forest

Associated Types

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

Methods

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

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

Semigroup (KnuthForest a)

Defined in Data.Tree.Knuth.Forest

Methods

(<>) :: KnuthForest a -> KnuthForest a -> KnuthForest a

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

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

Monoid (KnuthForest a)

Defined in Data.Tree.Knuth.Forest

Methods

mempty :: KnuthForest a

mappend :: KnuthForest a -> KnuthForest a -> KnuthForest a

mconcat :: [KnuthForest a] -> KnuthForest a

Arbitrary a => Arbitrary (KnuthForest a)

Defined in Data.Tree.Knuth.Forest

Methods

arbitrary :: Gen (KnuthForest a)

shrink :: KnuthForest a -> [KnuthForest a]

NFData a => NFData (KnuthForest a)

Defined in Data.Tree.Knuth.Forest

Methods

rnf :: KnuthForest a -> ()

HasUnion (KnuthForest a)

Defined in Data.Tree.Knuth.Forest

Methods

union :: KnuthForest a -> KnuthForest a -> KnuthForest a

Eq a => HasIntersection (KnuthForest a)

Defined in Data.Tree.Knuth.Forest

Methods

intersection :: KnuthForest a -> KnuthForest a -> KnuthForest a

Eq a => HasDifference (KnuthForest a)

Defined in Data.Tree.Knuth.Forest

Methods

difference :: KnuthForest a -> KnuthForest a -> KnuthForest a

HasEmpty (KnuthForest a)

Defined in Data.Tree.Knuth.Forest

Methods

empty :: KnuthForest a

HasSize (KnuthForest a)

Defined in Data.Tree.Knuth.Forest

Methods

size :: KnuthForest a -> Int

type Rep (KnuthForest a)

Defined in Data.Tree.Knuth.Forest

type Rep (KnuthForest a) = D1 (MetaData "KnuthForest" "Data.Tree.Knuth.Forest" "rose-trees-0.0.4.5-A00tWdqblf7Al7c9J60KpO" False) (C1 (MetaCons "Fork" PrefixI True) (S1 (MetaSel (Just "kNode") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a) :*: (S1 (MetaSel (Just "kChildren") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (KnuthForest a)) :*: S1 (MetaSel (Just "kSiblings") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (KnuthForest a)))) :+: C1 (MetaCons "Nil" PrefixI False) (U1 :: Type -> Type))

type Tail (KnuthForest a)

Defined in Data.Tree.Rose

type Tail (KnuthForest a) = KnuthForest a

type Head (KnuthForest a)

Defined in Data.Tree.Rose

type Head (KnuthForest a) = a

Query

size :: KnuthForest a -> Int

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

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

No siblings

isProperSubforestOf' :: Eq a => KnuthForest a -> KnuthForest a -> Bool

Depth-first

isSiblingOf :: Eq a => a -> KnuthForest a -> Bool

isChildOf :: Eq a => a -> KnuthForest a -> Bool

depth of one

isDescendantOf :: Eq a => a -> KnuthForest a -> Bool

isProperDescendantOf :: Eq a => a -> KnuthForest a -> Bool

Construction

singleton :: a -> KnuthForest a

delete :: Eq a => a -> KnuthForest a -> KnuthForest a

Combination

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

Removes the possible subtree on the right, from the left.

toForest :: KnuthForest a -> Forest a

fromForest :: Forest a -> KnuthForest a