|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface Visitor
This interface represents a visitor for the terms of a logical expression tree structure.
The visitor design pattern is a way of separating an algorithm from an object structure. A practical result of this separation is the ability to add new operations to existing object structures without modifying those structures.
The idea is to use a structure of element classes, each of which has an accept method that takes a visitor object as an argument. The visitor is an interface that has a different visit() method for each element class. The accept() method of an element class calls back the visit() method for its class. Separate concrete visitor classes can then be written that perform some particular operations.
Method Summary | |
---|---|
void |
visitComplexDataValue(ComplexDataValue t)
|
void |
visitConstructedTerm(ConstructedTerm t)
|
void |
visitIRI(IRI t)
|
void |
visitNumberedID(NumberedAnonymousID t)
|
void |
visitSimpleDataValue(SimpleDataValue t)
|
void |
visitUnnumberedID(UnnumberedAnonymousID t)
|
void |
visitVariable(Variable t)
|
Method Detail |
---|
void visitConstructedTerm(ConstructedTerm t)
t
- ConstructedTermvoid visitVariable(Variable t)
t
- Variablevoid visitSimpleDataValue(SimpleDataValue t)
t
- DataValuevoid visitComplexDataValue(ComplexDataValue t)
t
- DataValuevoid visitUnnumberedID(UnnumberedAnonymousID t)
t
- UnNbAnonymousIDvoid visitNumberedID(NumberedAnonymousID t)
t
- NbAnonymousIDvoid visitIRI(IRI t)
t
- IRI
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |