Package | Description |
---|---|
com.j_spaces.jdbc |
Provides GigaSpaces JDBC interfaces
|
com.j_spaces.jdbc.builder | |
com.j_spaces.jdbc.executor | |
com.j_spaces.jdbc.parser | |
com.j_spaces.jdbc.parser.grammar | |
com.j_spaces.jdbc.query |
Modifier and Type | Field and Description |
---|---|
protected ExpNode |
AbstractDMLQuery.expTree |
Modifier and Type | Method and Description |
---|---|
ExpNode |
Join.applyOnExpression(ExpNode expNode) |
ExpNode |
AbstractDMLQuery.getExpTree() |
ExpNode |
Join.getOnExpression() |
Modifier and Type | Method and Description |
---|---|
ExpNode |
Join.applyOnExpression(ExpNode expNode) |
void |
AbstractDMLQuery.setExpTree(ExpNode rootNode)
Sets the root node of the expression tree.
|
Constructor and Description |
---|
Join(String joinType,
Query subQuery,
ExpNode onExpression,
String tableName,
String alias) |
Modifier and Type | Method and Description |
---|---|
void |
QueryTemplateBuilder.build(ExpNode node,
short op)
Build QueryTemplatePacket from
ExpNode |
void |
QueryTemplateBuilder.build(ExpNode node,
short op,
short nullOp)
Build QueryTemplatePacket from
ExpNode |
QueryTemplatePacket |
QueryTemplateBuilder.buildTemplate(LiteralNode node,
QueryColumnData queryColumnData,
short op,
short nullOp,
FunctionCallDescription functionCallDescription,
ExpNode father)
Build space template
|
static Range |
QueryTemplateBuilder.toRange(String colName,
FunctionCallDescription functionCallDescription,
Object value,
short matchCode,
ExpNode node,
AbstractDMLQuery query) |
void |
QueryTemplateBuilder.traverseExpressionTree(ExpNode root)
Traverse the binary expression tree non-recursively using a custom stack The tree has to be
traversed in postorder - the parent is traversed after its children.
|
Modifier and Type | Method and Description |
---|---|
protected HashMap<ExpNode,IQueryResultSet<IEntryPacket>> |
AbstractQueryExecutor.getIntermediateResults() |
Modifier and Type | Method and Description |
---|---|
void |
QueryExecutor.execute(ExpNode expNode,
ISpaceProxy space,
Transaction txn,
int readModifier,
int max) |
void |
CollocatedJoinedQueryExecutor.execute(ExpNode equalNode,
ISpaceProxy space,
Transaction txn,
int readModifier,
int max) |
void |
JoinedQueryExecutor.execute(ExpNode exp,
ISpaceProxy space,
Transaction txn,
int readModifier,
int max) |
void |
IQueryExecutor.execute(ExpNode equalNode,
ISpaceProxy space,
Transaction txn,
int readModifier,
int max) |
IQueryResultSet<IEntryPacket> |
AbstractQueryExecutor.extractResults(ExpNode node) |
boolean |
JoinedQueryExecutor.getResults(ExpNode node) |
protected boolean |
JoinedQueryExecutor.matchesExpressionTree(ExpNode root,
ISpaceProxy space,
Transaction txn,
int readModifier,
int max)
Traverse the binary expression tree non-recursively using a custom stack The tree has to be
traversed in postorder - the parent is traversed after its children.
|
void |
JoinedQueryExecutor.setResults(ExpNode node,
boolean result) |
void |
AbstractQueryExecutor.setResults(ExpNode node,
IQueryResultSet<IEntryPacket> results) |
protected IQueryResultSet<IEntryPacket> |
AbstractQueryExecutor.traverseExpressionTree(ExpNode root,
ISpaceProxy space,
Transaction txn,
int readModifier,
int max)
Traverse the binary expression tree non-recursively using a custom stack The tree has to be
traversed in postorder - the parent is traversed after its children.
|
Constructor and Description |
---|
HashedEntriesCursor(QueryTableData table,
ExpNode indexNode,
IQueryResultSet entries) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractInNode |
class |
AndNode
This is the AndNode, expressing an 'and' between conditions.
|
class |
ColumnNode
This is a column Node.
|
class |
ContainsItemNode
node holding a single item inside contains, or a hole expression pointed by value
|
class |
ContainsItemsRootNode
node holding a root inside contains - points at a subtree of containItemNodes
|
class |
ContainsNode
An expression node for a contains argument.
|
class |
EqualNode
This is the equal operator Node.
|
class |
GTENode
This is the greater-than-equal operator Node.
|
class |
GTNode
This is the greater-than operator Node.
|
class |
InnerQueryNode
Represents an inner (sub) query in a WHERE clause condition.
|
class |
InNode
The InNode.
|
class |
IsNullNode
This is the IS NULL operator Node.
|
class |
LikeNode
This is the LIKE operator Node.
|
class |
LiteralNode
This is the Literal node.
|
class |
LTENode
This is the less-than-equal operator Node.
|
class |
LTNode
This is the less-than operator Node.
|
class |
NotEqualNode
This is the not-equal operator Node.
|
class |
NotInNode
The NotInNode.
|
class |
NotLikeNode
This is the NOT LIKE operator Node.
|
class |
OrNode
This is the OR Node that represents an 'OR' between conditions
|
class |
PreparedNode
This is a Prepared node.
|
class |
RelationNode
Created by Barak Bar Orion 8/24/15.
|
class |
RLikeNode
This is the an operator that is used for java regular expression matching
|
class |
RowNumNode
This node represents the rownum command.
|
class |
ValueNode
This is a parent class for the ColumnNode and the LiteralNodes.
|
Modifier and Type | Field and Description |
---|---|
protected ExpNode |
ExpNode.leftChild |
protected ExpNode |
ExpNode.rightChild |
Modifier and Type | Method and Description |
---|---|
ExpNode |
ContainsItemsRootNode.getContainsSubtree() |
ExpNode |
ExpNode.getLeftChild() |
ExpNode |
ExpNode.getRightChild() |
ExpNode |
LTNode.newInstance() |
ExpNode |
AndNode.newInstance() |
ExpNode |
LikeNode.newInstance() |
ExpNode |
NotInNode.newInstance() |
ExpNode |
ContainsNode.newInstance() |
ExpNode |
OrNode.newInstance() |
ExpNode |
NotLikeNode.newInstance() |
ExpNode |
RLikeNode.newInstance() |
ExpNode |
GTNode.newInstance() |
abstract ExpNode |
ExpNode.newInstance()
Prototype method - Create new instance of the class
|
ExpNode |
InNode.newInstance() |
ExpNode |
GTENode.newInstance() |
ExpNode |
ContainsItemNode.newInstance() |
ExpNode |
LTENode.newInstance() |
ExpNode |
RelationNode.newInstance() |
ExpNode |
EqualNode.newInstance() |
ExpNode |
ValueNode.newInstance() |
ExpNode |
IsNullNode.newInstance() |
ExpNode |
NotEqualNode.newInstance() |
Modifier and Type | Method and Description |
---|---|
Collection<ExpNode> |
ExpNode.reverse()
Generates a reverse tree/stack ensuring each node's children are popped before the node.
|
Modifier and Type | Method and Description |
---|---|
void |
ExpNode.setLeftChild(ExpNode leftChild)
Set the left child.
|
void |
ExpNode.setRightChild(ExpNode rightChild)
Set the right child.
|
Modifier and Type | Method and Description |
---|---|
void |
ExpNode.forEachChild(java.util.function.Consumer<ExpNode> consumer)
Applies the consumer on each non-null child.
|
void |
ExpNode.traverse(java.util.function.Consumer<ExpNode> consumer)
Applies the consumer on this node and its children recursively
|
void |
ExpNode.traverseReverse(java.util.function.Consumer<ExpNode> consumer)
Applies the consumer on this node and its children recursively in reverse (children before parent)
|
Constructor and Description |
---|
AbstractInNode(ExpNode leftChild,
ExpNode rightChild) |
AndNode(ExpNode leftChild,
ExpNode rightChild) |
ContainsItemNode(ColumnNode columnNode,
ExpNode operatorNode,
short templateMatchCode) |
ContainsItemNode(ColumnNode columnNode,
ExpNode operatorNode,
short templateMatchCode,
String relation) |
ContainsNode(ColumnNode columnNode,
ExpNode operatorNode,
short templateMatchCode) |
ContainsNode(ColumnNode columnNode,
ExpNode operatorNode,
short templateMatchCode,
String relation) |
EqualNode(ExpNode leftChild,
ExpNode rightChild) |
ExpNode(ExpNode leftChild,
ExpNode rightChild) |
GTENode(ExpNode leftChild,
ExpNode rightChild) |
GTNode(ExpNode leftChild,
ExpNode rightChild) |
IsNullNode(ExpNode leftChild,
ExpNode rightChild) |
LTENode(ExpNode leftChild,
ExpNode rightChild) |
LTNode(ExpNode leftChild,
ExpNode rightChild) |
NotEqualNode(ExpNode leftChild,
ExpNode rightChild) |
OrNode(ExpNode leftChild,
ExpNode rightChild) |
RelationNode(ExpNode left,
String relation,
ExpNode right) |
Modifier and Type | Method and Description |
---|---|
ExpNode |
QueryTableData.getJoinCondition() |
ExpNode |
QueryTableData.getTableCondition() |
Modifier and Type | Method and Description |
---|---|
void |
QueryTableData.createJoinIndex(ExpNode root)
Traverse the expression root(preorder) and create a join index for given table if possible
|
void |
QueryTableData.join(ExpNode exp) |
void |
QueryTableData.setJoinCondition(ExpNode joinIndex) |
void |
QueryTableData.setTableCondition(ExpNode tableCondition) |
Copyright © GigaSpaces.