Package-level declarations

A Flat node that can give a copy of itself at another Info.sortId, as moving siblings does.

A node of a tree kept flat, as a tree's state keeps its nodes: its place is its code.

A named node of a tree, ordered by level, then sortId among its siblings, then code.

The state of a tree: its nodes, flat and ordered (Info.compareTo).

A node of a tree built as a tree: it holds its children.

A node of a tree, named by its code: the codes of its ancestors and its own, joined by DEPARTMENT_CODE_DELIMITER. Its level is the number of codes, 0 for the root.

Builds trees of Leaf nodes from flat ones.

What separates the levels of a tree code: l1-l2-l3 is the node l3 under l1-l2.

The code of the (virtual) root of a tree: its first level's nodes are its direct children.