Node

Composed into Paths.

A node in a rose tree.

Pattern to ease construction / deconstruction of pure nodes.

Graph nodes. Represents a thing that can conflict with another thing. For the register allocater the nodes represent registers.

Representation for nodes of the Graph.

• The payload is user data, just carried around in this module
• The key is the node identifier. Key has an Ord instance for performance reasons.
• The [key] are the dependencies of the node; it's ok to have extra keys in the dependencies that are not the key of any Node in the graph

Unlabeled node

A smart element constructor which uses the type of its argument to determine what sort of element to make.

The Node struct represents one node in a [n-ary tree][glib-N-ary-Trees].

Memory-managed wrapper type.

Local nodes

A simple, trivial data type which admits an IsNode instance.

A node of a document structure. A node can be text, a comment, or an element. XML processing instructions are intentionally omitted as a simplification, and CDATA and plain text are both text nodes, since they ought to be semantically interchangeable.

A pure tree representation that uses a list as its container type, annotated variant. In the hexpat package, a list of nodes has the type [Node tag text], but note that you can also use the more general type function ListOf to give a list of any node type, using that node's associated list type, e.g. ListOf (UNode Text).