|
Class Summary |
| AbstractExprNode |
Abstract implementation of a expression node. |
| AndNode |
Node representing an AND connector in a filter operation |
| ApproximateNode<T> |
A simple assertion value node. |
| AssertionNode |
Node used for the application of arbitrary predicates on return candidates. |
| BranchNode |
Node representing branches within the expression tree corresponding to
logical operators within the filter expression. |
| BranchNormalizedVisitor |
Visitor which traverses a filter tree while normalizing the branch node
order. |
| EqualityNode<T> |
A assertion value node for Equality. |
| ExtensibleNode |
Filter expression tree node for extensible assertions. |
| FilterParser |
This class parse a Ldap filter. |
| FilterParserMonitorAdapter |
Adapter for the FilterParser monitor. |
| GreaterEqNode<T> |
A assertion value node for GreaterOrEqual. |
| LeafNode |
Abstract base class for leaf nodes within the expression filter tree. |
| LessEqNode<T> |
A assertion value node for LessOrEqual. |
| NotNode |
Node representing an Not connector in a filter operation |
| OrNode |
Node representing an OR connector in a filter operation |
| PresenceNode |
Filter expression tree node representing a filter attribute value assertion
for presence. |
| ScopeNode |
Node used not to represent a published assertion but an assertion on the
scope of the search. |
| SimpleNode<T> |
A simple assertion value node. |
| SubstringNode |
Filter expression tree node used to represent a substring assertion. |