traverse

Returns a depth-first traversal range over a CDM tree.

The returned range yields CdmNode* pointers in pre-order depth-first sequence. The root node is visited first, followed by its descendants.

Lifetime Warning: The returned range stores pointers into node and its descendants. The node must remain valid and unmodified (no structural changes like adding/removing children) for the duration of the traversal. The safest pattern is to use the range immediately in a foreach loop.

Acyclicity precondition: node must be the root of an acyclic graph. Cyclic references through member/attribute pointers are not detected by this traversal.