direction = Direction.BOTH; P predicate = ((IsStep)steps.get(1)).getPredicate();
if (i < size - 1 && doStrategy(curr)) { final IsStep isStep = (IsStep) traversal.getSteps().get(i + 1); final P isStepPredicate = isStep.getPredicate(); Long highRange = null; boolean useNotStep = false, dismissCountIs = false; useNotStep &= curr.getLabels().isEmpty() && isStep.getLabels().isEmpty() && isStep.getNextStep() instanceof EmptyStep && ((highRange <= 1L && predicate.equals(Compare.lt)) || (highRange == 1L && (predicate.equals(Compare.eq) || predicate.equals(Compare.lte)))); dismissCountIs &= curr.getLabels().isEmpty() && isStep.getLabels().isEmpty() && isStep.getNextStep() instanceof EmptyStep && (highRange == 1L && (predicate.equals(Compare.gt) || predicate.equals(Compare.gte)));
/** * Filters <code>E</code> object values given the provided {@code predicate}. * * @param predicate the filter to apply * @return the traversal with an appended {@link IsStep} * @see <a href="http://tinkerpop.apache.org/docs/${project.version}/reference/#is-step" target="_blank">Reference Documentation - Is Step</a> * @since 3.0.0-incubating */ public default GraphTraversal<S, E> is(final P<E> predicate) { this.asAdmin().getBytecode().addStep(Symbols.is, predicate); return this.asAdmin().addStep(new IsStep<>(this.asAdmin(), predicate)); }
if (i < size - 1 && doStrategy(curr)) { final IsStep isStep = (IsStep) traversal.getSteps().get(i + 1); final P isStepPredicate = isStep.getPredicate(); Long highRange = null; boolean useNotStep = false, dismissCountIs = false; useNotStep &= curr.getLabels().isEmpty() && isStep.getLabels().isEmpty() && isStep.getNextStep() instanceof EmptyStep && ((highRange <= 1L && predicate.equals(Compare.lt)) || (highRange == 1L && (predicate.equals(Compare.eq) || predicate.equals(Compare.lte)))); dismissCountIs &= curr.getLabels().isEmpty() && isStep.getLabels().isEmpty() && isStep.getNextStep() instanceof EmptyStep && (highRange == 1L && (predicate.equals(Compare.gt) || predicate.equals(Compare.gte)));
/** * Filter the <code>E</code> object if it is not {@link P#eq} to the provided value. * * @param value the value that the object must equal. * @return the traversal with an appended {@link IsStep}. * @see <a href="http://tinkerpop.apache.org/docs/${project.version}/reference/#is-step" target="_blank">Reference Documentation - Is Step</a> * @since 3.0.0-incubating */ public default GraphTraversal<S, E> is(final Object value) { this.asAdmin().getBytecode().addStep(Symbols.is, value); return this.asAdmin().addStep(new IsStep<>(this.asAdmin(), value instanceof P ? (P<E>) value : P.eq((E) value))); }
direction = Direction.BOTH; P predicate = ((IsStep) steps.get(1)).getPredicate();
/** * Filters <code>E</code> object values given the provided {@code predicate}. * * @param predicate the filter to apply * @return the traversal with an appended {@link IsStep} * @see <a href="http://tinkerpop.apache.org/docs/${project.version}/reference/#is-step" target="_blank">Reference Documentation - Is Step</a> * @since 3.0.0-incubating */ public default GraphTraversal<S, E> is(final P<E> predicate) { this.asAdmin().getBytecode().addStep(Symbols.is, predicate); return this.asAdmin().addStep(new IsStep<>(this.asAdmin(), predicate)); }
direction = Direction.BOTH; P predicate = ((IsStep)steps.get(1)).getPredicate();
/** * Filter the <code>E</code> object if it is not {@link P#eq} to the provided value. * * @param value the value that the object must equal. * @return the traversal with an appended {@link IsStep}. * @see <a href="http://tinkerpop.apache.org/docs/${project.version}/reference/#is-step" target="_blank">Reference Documentation - Is Step</a> * @since 3.0.0-incubating */ public default GraphTraversal<S, E> is(final Object value) { this.asAdmin().getBytecode().addStep(Symbols.is, value); return this.asAdmin().addStep(new IsStep<>(this.asAdmin(), value instanceof P ? (P<E>) value : P.eq((E) value))); }