use of org.apache.commons.jexl3.parser.JexlNode in project datawave by NationalSecurityAgency.
the class HasTopLevelNegationVisitor method recurseRoot.
protected boolean recurseRoot(JexlNode node) {
boolean hasNegation = false;
for (int i = 0; i < node.jjtGetNumChildren() && !hasNegation; i++) {
JexlNode child = node.jjtGetChild(i);
Class<?> childClass = child.getClass();
if (ASTNENode.class.equals(childClass)) {
hasNegation = true;
} else if (ASTAndNode.class.equals(childClass)) {
return recurseAnd(child);
} else if (ASTOrNode.class.equals(childClass)) {
return recurseOr(child);
} else {
hasNegation = recurseRoot(child);
}
}
return hasNegation;
}
use of org.apache.commons.jexl3.parser.JexlNode in project datawave by NationalSecurityAgency.
the class HasTopLevelNegationVisitor method recurseOr.
protected boolean recurseOr(JexlNode node) {
boolean hasNegation = false;
for (int i = 0; i < node.jjtGetNumChildren() && !hasNegation; i++) {
JexlNode child = node.jjtGetChild(i);
Class<?> childClass = child.getClass();
if (ASTAndNode.class.equals(childClass) || ASTReference.class.equals(childClass) || ASTReferenceExpression.class.equals(child.getClass())) {
hasNegation = recurseOr(child);
}
if (ASTNENode.class.equals(childClass) || ASTNRNode.class.equals(childClass)) {
return true;
}
}
return hasNegation;
}
use of org.apache.commons.jexl3.parser.JexlNode in project datawave by NationalSecurityAgency.
the class HasTopLevelNegationVisitor method recurseAnd.
protected boolean recurseAnd(JexlNode node) {
boolean hasNegation = false;
for (int i = 0; i < node.jjtGetNumChildren() && !hasNegation; i++) {
JexlNode child = node.jjtGetChild(i);
Class<?> childClass = child.getClass();
if (ASTAndNode.class.equals(childClass) || ASTReference.class.equals(childClass) || ASTReferenceExpression.class.equals(childClass)) {
hasNegation = recurseAnd(child);
}
if (ASTNENode.class.equals(childClass)) {
return true;
}
}
return hasNegation;
}
use of org.apache.commons.jexl3.parser.JexlNode in project datawave by NationalSecurityAgency.
the class IteratorBuildingVisitor method visit.
@Override
public Object visit(ASTAndNode and, Object data) {
QueryPropertyMarker.Instance instance = QueryPropertyMarker.findInstance(and);
if (instance.isType(ExceededOrThresholdMarkerJexlNode.class)) {
JexlNode source = instance.getSource();
// Ivarator to get the job done
if (source instanceof ASTAndNode) {
try {
ivarateList(and, source, data);
} catch (IOException ioe) {
throw new DatawaveFatalQueryException(ioe);
}
} else {
QueryException qe = new QueryException(DatawaveErrorCode.UNEXPECTED_SOURCE_NODE, MessageFormat.format("{0}", "Limited ExceededOrThresholdMarkerJexlNode"));
throw new DatawaveFatalQueryException(qe);
}
} else if (data instanceof IndexRangeIteratorBuilder) {
// index checking has already been done, otherwise we would not have
// an "ExceededValueThresholdMarker"
// hence the "IndexAgnostic" method can be used here
LiteralRange range = JexlASTHelper.findRange().recursively().getRange(and);
if (range == null) {
QueryException qe = new QueryException(DatawaveErrorCode.MULTIPLE_RANGES_IN_EXPRESSION);
throw new DatawaveFatalQueryException(qe);
}
((IndexRangeIteratorBuilder) data).setRange(range);
} else if (instance.isType(ExceededValueThresholdMarkerJexlNode.class)) {
// if the parent is our ExceededValueThreshold marker, then use an
// Ivarator to get the job done unless we don't have to
JexlNode source = instance.getSource();
String identifier = null;
LiteralRange<?> range = null;
boolean negatedLocal = false;
if (source instanceof ASTAndNode) {
range = buildLiteralRange(source, null);
identifier = range.getFieldName();
} else {
if (source instanceof ASTNRNode || source instanceof ASTNotNode)
negatedLocal = true;
range = buildLiteralRange(source);
identifier = JexlASTHelper.getIdentifier(source);
}
boolean negatedOverall = negatedLocal;
if (data instanceof AbstractIteratorBuilder) {
AbstractIteratorBuilder oib = (AbstractIteratorBuilder) data;
if (oib.isInANot()) {
negatedOverall = !negatedOverall;
}
}
// or the field is index only but not in the term frequencies, then we must ivarate
if (!limitLookup || !allowTermFrequencyLookup || (indexOnlyFields.contains(identifier) && !termFrequencyFields.contains(identifier))) {
if (source instanceof ASTAndNode) {
try {
List<ASTFunctionNode> functionNodes = JexlASTHelper.getFunctionNodes(source).stream().filter(node -> JexlFunctionArgumentDescriptorFactory.F.getArgumentDescriptor(node).allowIvaratorFiltering()).collect(Collectors.toList());
if (functionNodes.isEmpty()) {
ivarateRange(and, source, data);
} else {
ivarateFilter(and, source, data, functionNodes);
}
} catch (IOException ioe) {
throw new DatawaveFatalQueryException("Unable to ivarate", ioe);
}
} else if (source instanceof ASTERNode || source instanceof ASTNRNode) {
try {
ivarateRegex(and, source, data);
} catch (IOException ioe) {
throw new DatawaveFatalQueryException("Unable to ivarate", ioe);
}
} else {
QueryException qe = new QueryException(DatawaveErrorCode.UNEXPECTED_SOURCE_NODE, MessageFormat.format("{0}", "ExceededValueThresholdMarkerJexlNode"));
throw new DatawaveFatalQueryException(qe);
}
} else {
NestedIterator<Key> nested = null;
if (termFrequencyFields.contains(identifier)) {
nested = buildExceededFromTermFrequency(identifier, and, source, range, data);
} else {
/**
* This is okay since 1) We are doc specific 2) We are not index only or tf 3) Therefore, we must evaluate against the document for this
* expression 4) Return a stubbed range in case we have a disjunction that breaks the current doc.
*/
if (!limitOverride && !negatedOverall)
nested = createExceededCheck(identifier, range, and);
}
if (null != nested && null != data && data instanceof AbstractIteratorBuilder) {
AbstractIteratorBuilder iterators = (AbstractIteratorBuilder) data;
if (negatedLocal) {
iterators.addExclude(nested);
} else {
iterators.addInclude(nested);
}
} else {
if (isQueryFullySatisfied == true) {
log.warn("Determined that isQueryFullySatisfied should be false, but it was not preset to false in the SatisfactionVisitor");
}
return nested;
}
}
} else if (null != data && data instanceof AndIteratorBuilder) {
and.childrenAccept(this, data);
} else {
// Create an AndIterator and recursively add the children
AbstractIteratorBuilder andItr = new AndIteratorBuilder();
andItr.negateAsNeeded(data);
and.childrenAccept(this, andItr);
// If there is no parent
if (data == null) {
// Make this AndIterator the root node
if (!andItr.includes().isEmpty()) {
root = andItr.build();
}
} else {
// Otherwise, add this AndIterator to its parent
AbstractIteratorBuilder parent = (AbstractIteratorBuilder) data;
if (!andItr.includes().isEmpty()) {
parent.addInclude(andItr.build());
}
}
if (log.isTraceEnabled()) {
log.trace("ASTAndNode visit: pretty formatting of:\nparent.includes:" + formatIncludesOrExcludes(andItr.includes()) + "\nparent.excludes:" + formatIncludesOrExcludes(andItr.excludes()));
}
}
return null;
}
use of org.apache.commons.jexl3.parser.JexlNode in project datawave by NationalSecurityAgency.
the class Function method hashCode.
@Override
public int hashCode() {
HashCodeBuilder builder = new HashCodeBuilder();
builder.append(name);
for (JexlNode arg : args) {
builder.append(PrintingVisitor.formattedQueryString(arg));
}
return builder.toHashCode();
}
Aggregations