Interface | Description |
---|---|
GroupCache |
Class | Description |
---|---|
AbstractConstraintFactory | |
AbstractParallelSearch | |
AbstractParallelSearch.ItemBuffer | |
AbstractSearchFactory | |
ConstraintAdapter | |
DefaultCaseInsensitiveConstraint | |
DefaultConstraint | |
DefaultGraphEdge | |
DefaultGraphNode | |
DefaultGroupOrderEditor | |
DefaultParameterEditor | |
DefaultQueryParser |
Query-semi-EBNF:
digit = "0" to "9" ;
number = [ "-" ], digit, { digit } ; letter = "A" to "Z" ; space = all whitespace characters symbol = all special symbols ; character = letter | digit | symbol identifier = letter , { letter | "_" } ; char_sequence = character , { character } ; text = "'" , char_sequence , "'" | '"' , char_sequence , '"' ; operator = "=" | "!=" | "=~" | "!~" | "=#" | "!#" | ">" | "≥" | "<" | "≤" grouping = "<*>" assignment = identifier, [ space ], operator, [ space], (text | grouping); node = "[", [ identifier ] { ",", identifier } { node }"]" ; query = [ "!" ], [ space ] |
DefaultQueryParser.Identifier | |
DefaultSearchGraph | |
DefaultSearchOperator | |
DefaultSearchQuery | |
EdgeAdapter | |
GraphValidationResult | |
GraphValidator |
Possible violations (report is optional):
Edge count violation (min/max of incoming/outgoing or total)
Totally undefined graph (mere structural search)
Complementary graphs with root-operation 'disjunction'
Multiple roots
Negated transitive edges
Cyclic sub-graphs
Link-edge containing constraints
Existence of link-edges.
|
NodeAdapter | |
OperatorAdapter |
Enum | Description |
---|---|
AbstractParallelSearch.ItemRequestResult | |
IntOperator |