See: Description
Interface | Description |
---|---|
ReturnVisitor<E,F,D,I> |
A visitor that visits every node in the AST, returning some value for each.
|
VoidVisitor |
A visitor that visits every node in the AST.
|
Class | Description |
---|---|
AbstractCollector<T> |
A depth first collector.
|
AbstractDetector |
A depth first detector.
|
AbstractReplacer |
A depth first replacer.
|
AbstractVoidVisitor |
Implements a depth first traversal of the kodkod AST.
|
Provides two interfaces for traversing the Kodkod AST using the visitor pattern. A VoidVisitor visits the nodes but returns no values. A ReturnVisitor can be parametrized to return values of specific types for Decls, Expression, IntExpression, and Formula nodes.
Several skeletal implementations of the VoidVisitor and ReturnVisitor interfaces are also provided. These traverse the AST in a depth-first manner and optionally cache the results of visiting specified nodes. The caching functionality makes it convenient to implement visitors that visit shared nodes only once.
VoidVisitor
,
ReturnVisitor
© Emina Torlak 2005-present