Visitor in Whitespace
Separating the unseen algorithm from the ethereal structure it traverses.
The Anatomy of the Silent Visitor
The Visitor pattern represents an operation to be performed on the elements of an object structure, letting you define a new operation without changing the classes of the elements on which it operates.
In Whitespace, the Visitor is a set of specialized labels. As the iterator traverses a complex heap structure (like a composite tree), it passes the current node’s type-identifier to the Visitor routine. The Visitor uses this identifier to dynamically dispatch to the correct handling logic.
This double-dispatch mechanism is notoriously difficult to implement in pure emptiness. It requires a profound mastery of the Unseen Sigils, as the execution flow weaves back and forth between the structural nodes and the algorithmic visitor, maintaining state silently on the stack.