DataTreeView.StrictTypes

Remark: the heavy use of strictness here is for correctly catching exceptions, not for performance reasons

Documentation

module Data.Tree

module Data.Monoid

Strict lists

data StrictList a

Strict lists (in both the head and tail)

Note: Most operations for this type are provided via the ListLike instance, but ListLike is not reexported here.

Instances

Functor StrictList

Typeable1 StrictList

Foldable StrictList

Traversable StrictList

Data a => Data (StrictList a)

Show a => Show (StrictList a)

Monoid (StrictList a)

Empty list and appending

ListLike (StrictList a) a

FoldableLL (StrictList a) a

ToStrictForest (StrictForest a) a

Identity

ToStrictTree x a => ToStrictForest (StrictList x) a

ToStrictList (StrictList a) a

Identity

Construction

class ToStrictList x a where

Methods

strictList :: x -> StrictList a

Instances

ToStrictList a a

Singleton

ToStrictList [a] a

From lazy list

ToStrictList (StrictList a) a

Identity

ToStrictList x a => ToStrictList (a, x) a

Cons

Destruction

fromStrictList :: StrictList a -> [a]

Strict trees and forests

data StrictTree a

Instances

Functor StrictTree

Typeable1 StrictTree

Foldable StrictTree

Traversable StrictTree

Data a => Data (StrictTree a)

Show a => Show (StrictTree a)

ToStrictForest (StrictForest a) a

Identity

ToStrictTree (StrictTree a) a

Identity

type StrictForest a = StrictList (StrictTree a)

Construction

class ToStrictTree x a where

Methods

strictTree :: x -> StrictTree a

Instances

ToStrictTree a a

Leaf

ToStrictTree (Tree a) a

From lazy tree

ToStrictTree (StrictTree a) a

Identity

ToStrictForest y a => ToStrictTree (a, y) a

From node value and subforest

class ToStrictForest y a where

Methods

strictForest :: y -> StrictForest a

Instances

ToStrictTree x a => ToStrictForest [x] a

ToStrictForest (StrictForest a) a

Identity

ToStrictTree x a => ToStrictForest (StrictList x) a

Modification

modifyValue :: StrictTree a -> (a -> a) -> StrictTree a

Note: this function is not recursive.

modifyChildren :: StrictTree a -> (StrictForest a -> StrictForest a) -> StrictTree a

Note: this function is not recursive.

Destruction

nodeValue :: StrictTree a -> a

nodeChildren :: StrictTree t -> [StrictTree t]

fromStrictTree :: StrictTree a -> Tree a

fromStrictForest :: StrictForest a -> Forest a