Tree -is:module

data Tree a

containers Data.Graph Data.Tree

Non-empty, possibly infinite, multi-way trees; also known as rose trees.

type Tree = TreeT Identity

hedgehog Hedgehog.Internal.Tree

A rose tree.

pattern Tree :: NodeT Identity a -> Tree a

hedgehog Hedgehog.Internal.Tree

Pattern to ease construction / deconstruction of pure trees.

data Tree c a

hspec-core Test.Hspec.Core.Spec

Internal tree data structure

class Tree t

hxt Control.Arrow.ArrowTree Data.Tree.Class

The interface for trees

data Tree

hspec-discover Test.Hspec.Discover.Run, github GitHub.Data.GitData, persistent-test PersistentTestModels TreeTest

newtype Tree

gi-glib GI.GLib.Structs.Tree

Memory-managed wrapper type.

Tree :: ManagedPtr Tree -> Tree

gi-glib GI.GLib.Structs.Tree

Tree :: !Name Tree -> URL -> !Vector GitTree -> Tree

github GitHub.Data.GitData

data Tree a

HaTeX Text.LaTeX.Packages.Trees

Tree datatype.

data Tree a

yi-core Yi.Syntax.OnlineTree, kind-generics Generics.Kind.Examples, yi Yi.Syntax.OnlineTree, falsify Test.Falsify.Generator

data family Tree r :: *

gitlib Git.Types

Tree :: String -> !Maybe String -> Tree

persistent-test PersistentTestModels

Tree :: Text -> !Maybe Text -> Tree

persistent-test TreeTest

type Tree = Tree LgRepo

gitlib-libgit2 Git.Libgit2 Git.Libgit2.Types

data Tree

svg-tree Graphics.Svg.Types

Main type for the scene description, reorient to specific type describing each tag.

data Tree (n :: Nat) a

ral Data.RAVec.Tree

Perfectly balanced binary tree of depth n, with 2 ^ n elements.

data family Tree (n :: Nat) a

ral Data.RAVec.Tree.DF

type Tree = PModule

yi Yi.Syntax.Haskell

type Tree t = BList (Statement t)

yi Yi.Syntax.JavaScript

data Tree t

yi Yi.Syntax.Latex Yi.Syntax.Paren

data () => Tree a

markup-parse MarkupParse

Non-empty, possibly infinite, multi-way trees; also known as rose trees.

data Tree d c

cabal-install-solver Distribution.Solver.Modular.Tree

Type of the search tree. Inlining the choice nodes for now. Weights on package, flag, and stanza choices control the traversal order. The tree can hold additional data on Done nodes (type d) and choice nodes (type c). For example, during the final traversal, choice nodes contain the variables that introduced the choices, and Done nodes contain the assignments for all variables. TODO: The weight type should be changed from [Double] to Double to avoid giving too much weight to preferences that are applied later.

data Tree e a

elynx-tree ELynx.Tree.Rooted

Rooted rose trees with branch labels. Unary instances such as Functor act on node labels, and not on branch labels. Binary instances such as Bifunctor act on both labels (first acts on branches, second on node labels).

data Tree a

folds Data.Fold.Internal

The shape of a foldMap