blob: f6ded694a163d2e3c16e378a7f29b6471be26e34 [file] [log] [blame]
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
package org.apache.tinkerpop.gremlin.process.traversal.strategy.verification;
import org.apache.tinkerpop.gremlin.LoadGraphWith;
import org.apache.tinkerpop.gremlin.process.AbstractGremlinProcessTest;
import org.apache.tinkerpop.gremlin.process.traversal.TraversalEngine;
import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversal;
import org.junit.Test;
import static org.apache.tinkerpop.gremlin.LoadGraphWith.GraphData.MODERN;
import static org.apache.tinkerpop.gremlin.process.traversal.NumberHelper.mul;
import static org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__.*;
import static org.junit.Assert.assertTrue;
import static org.junit.Assert.fail;
/**
* @author Marko A. Rodriguez (http://markorodriguez.com)
*/
public abstract class ComputerVerificationStrategyProcessTest extends AbstractGremlinProcessTest {
public static class StandardTraversals extends ComputerVerificationStrategyProcessTest {
@Test
@LoadGraphWith(MODERN)
public void shouldAllowNestedGlobalTraversalToHaveBarriers() {
try {
g.V().values("age").union(max(), min(), sum()).iterate();
} catch (IllegalStateException e) {
fail("Nested global traversals can have barrier steps on STANDARD:" + e.getMessage());
}
}
@Test
@LoadGraphWith(MODERN)
public void shouldAllowMidTraversalBarriersOnComputer() {
try {
g.V().count().sum().iterate();
} catch (IllegalStateException e) {
fail("Mid-traversal barrier steps are OK on STANDARD: " + e.getMessage());
}
}
@Test
@LoadGraphWith(MODERN)
public void shouldAllowLocalTraversalsToLeaveTheStarGraphOnComputer() {
try {
g.V().local(out().out()).iterate();
} catch (IllegalStateException e) {
fail("Local traversals leaving the star-graph are OK on STANDARD: " + e.getMessage());
}
}
}
public static class ComputerTraversals extends ComputerVerificationStrategyProcessTest {
@Test
@LoadGraphWith(MODERN)
public void shouldNotAllowNestedGlobalTraversalToHaveBarriers() {
try {
final GraphTraversal t = g.V().values("age").union(max(), min(), sum()).iterate();
fail("Nested global traversals should not be allowed to contain barriers (COMPUTER): " + t);
} catch (IllegalStateException e) {
assertTrue(true);
}
}
@Test
@LoadGraphWith(MODERN)
public void shouldNotAllowMidTraversalBarriersOnComputer() {
try {
final GraphTraversal t = g.V().count().sum().iterate();
fail("Mid-traversal barrier steps are not allowed (COMPUTER): " + t);
} catch (IllegalStateException e) {
assertTrue(true);
}
try {
final GraphTraversal t = g.V().count().sum().map(x -> mul(x.get(), 19)).iterate();
fail("Mid-traversal barrier steps are not allowed (COMPUTER): " + t);
} catch (IllegalStateException e) {
assertTrue(true);
}
}
@Test
@LoadGraphWith(MODERN)
public void shouldNotAllowLocalTraversalsToLeaveTheStarGraphOnComputer() {
try {
final GraphTraversal t = g.V().local(out().out()).iterate();
fail("Local traversals should not be allowed to leave the star-graph (COMPUTER): " + t);
} catch (IllegalStateException e) {
assertTrue(true);
}
try {
final GraphTraversal t = g.V().local(out().values("name")).iterate();
fail("Local traversals should not be allowed to leave the star-graph (COMPUTER): " + t);
} catch (IllegalStateException e) {
assertTrue(true);
}
try {
g.V().local(outE().values("weight")).iterate();
g.V().local(out().id()).iterate();
g.V().local(outE().inV()).iterate();
} catch (IllegalStateException e) {
fail("Local traversals on the star-graph are OK on COMPUTER: " + e.getMessage());
}
}
}
}