You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@tinkerpop.apache.org by sp...@apache.org on 2015/09/30 16:46:19 UTC
[3/5] incubator-tinkerpop git commit: Move all the tinkergraph play
tests to their own class.
Move all the tinkergraph play tests to their own class.
Project: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/repo
Commit: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/commit/fb6d006b
Tree: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/tree/fb6d006b
Diff: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/diff/fb6d006b
Branch: refs/heads/tp30
Commit: fb6d006b03162789eb2ae698310a34489d40fa19
Parents: 5aa2886
Author: Stephen Mallette <sp...@genoprime.com>
Authored: Wed Sep 30 09:37:46 2015 -0400
Committer: Stephen Mallette <sp...@genoprime.com>
Committed: Wed Sep 30 09:37:46 2015 -0400
----------------------------------------------------------------------
.../structure/TinkerGraphPlayTest.java | 218 +++++++++++++++++++
.../tinkergraph/structure/TinkerGraphTest.java | 203 -----------------
2 files changed, 218 insertions(+), 203 deletions(-)
----------------------------------------------------------------------
http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/blob/fb6d006b/tinkergraph-gremlin/src/test/java/org/apache/tinkerpop/gremlin/tinkergraph/structure/TinkerGraphPlayTest.java
----------------------------------------------------------------------
diff --git a/tinkergraph-gremlin/src/test/java/org/apache/tinkerpop/gremlin/tinkergraph/structure/TinkerGraphPlayTest.java b/tinkergraph-gremlin/src/test/java/org/apache/tinkerpop/gremlin/tinkergraph/structure/TinkerGraphPlayTest.java
new file mode 100644
index 0000000..a7b64d9
--- /dev/null
+++ b/tinkergraph-gremlin/src/test/java/org/apache/tinkerpop/gremlin/tinkergraph/structure/TinkerGraphPlayTest.java
@@ -0,0 +1,218 @@
+package org.apache.tinkerpop.gremlin.tinkergraph.structure;
+
+import org.apache.tinkerpop.gremlin.process.traversal.Operator;
+import org.apache.tinkerpop.gremlin.process.traversal.P;
+import org.apache.tinkerpop.gremlin.process.traversal.Traversal;
+import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversal;
+import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversalSource;
+import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__;
+import org.apache.tinkerpop.gremlin.process.traversal.util.TraversalMetrics;
+import org.apache.tinkerpop.gremlin.structure.Graph;
+import org.apache.tinkerpop.gremlin.structure.T;
+import org.apache.tinkerpop.gremlin.structure.Vertex;
+import org.apache.tinkerpop.gremlin.structure.io.graphml.GraphMLIo;
+import org.apache.tinkerpop.gremlin.util.TimeUtil;
+import org.junit.Ignore;
+import org.junit.Test;
+
+import java.util.Arrays;
+import java.util.List;
+import java.util.function.Supplier;
+
+import static org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__.and;
+import static org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__.as;
+import static org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__.both;
+import static org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__.choose;
+import static org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__.has;
+import static org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__.in;
+import static org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__.out;
+import static org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__.outE;
+import static org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__.select;
+import static org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__.union;
+import static org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__.valueMap;
+
+/**
+ * @author Stephen Mallette (http://stephen.genoprime.com)
+ */
+public class TinkerGraphPlayTest {
+
+ @Test
+ @Ignore
+ public void testPlay() {
+ Graph g = TinkerGraph.open();
+ Vertex v1 = g.addVertex(T.id, "1", "animal", "males");
+ Vertex v2 = g.addVertex(T.id, "2", "animal", "puppy");
+ Vertex v3 = g.addVertex(T.id, "3", "animal", "mama");
+ Vertex v4 = g.addVertex(T.id, "4", "animal", "puppy");
+ Vertex v5 = g.addVertex(T.id, "5", "animal", "chelsea");
+ Vertex v6 = g.addVertex(T.id, "6", "animal", "low");
+ Vertex v7 = g.addVertex(T.id, "7", "animal", "mama");
+ Vertex v8 = g.addVertex(T.id, "8", "animal", "puppy");
+ Vertex v9 = g.addVertex(T.id, "9", "animal", "chula");
+
+ v1.addEdge("link", v2, "weight", 2f);
+ v2.addEdge("link", v3, "weight", 3f);
+ v2.addEdge("link", v4, "weight", 4f);
+ v2.addEdge("link", v5, "weight", 5f);
+ v3.addEdge("link", v6, "weight", 1f);
+ v4.addEdge("link", v6, "weight", 2f);
+ v5.addEdge("link", v6, "weight", 3f);
+ v6.addEdge("link", v7, "weight", 2f);
+ v6.addEdge("link", v8, "weight", 3f);
+ v7.addEdge("link", v9, "weight", 1f);
+ v8.addEdge("link", v9, "weight", 7f);
+
+ g.traversal().withSack(Float.MIN_VALUE).V(v1).repeat(outE().sack(Operator.max, "weight").inV()).times(5).sack().forEachRemaining(System.out::println);
+ }
+
+ /* @Test
+ public void testTraversalDSL() throws Exception {
+ Graph g = TinkerFactory.createClassic();
+ assertEquals(2, g.of(TinkerFactory.SocialTraversal.class).people("marko").knows().name().toList().size());
+ g.of(TinkerFactory.SocialTraversal.class).people("marko").knows().name().forEachRemaining(name -> assertTrue(name.equals("josh") || name.equals("vadas")));
+ assertEquals(1, g.of(TinkerFactory.SocialTraversal.class).people("marko").created().name().toList().size());
+ g.of(TinkerFactory.SocialTraversal.class).people("marko").created().name().forEachRemaining(name -> assertEquals("lop", name));
+ }*/
+
+ @Test
+ @Ignore
+ public void benchmarkStandardTraversals() throws Exception {
+ Graph graph = TinkerGraph.open();
+ GraphTraversalSource g = graph.traversal();
+ graph.io(GraphMLIo.build()).readGraph("data/grateful-dead.xml");
+ final List<Supplier<Traversal>> traversals = Arrays.asList(
+ () -> g.V().outE().inV().outE().inV().outE().inV(),
+ () -> g.V().out().out().out(),
+ () -> g.V().out().out().out().path(),
+ () -> g.V().repeat(out()).times(2),
+ () -> g.V().repeat(out()).times(3),
+ () -> g.V().local(out().out().values("name").fold()),
+ () -> g.V().out().local(out().out().values("name").fold()),
+ () -> g.V().out().map(v -> g.V(v.get()).out().out().values("name").toList())
+ );
+ traversals.forEach(traversal -> {
+ System.out.println("\nTESTING: " + traversal.get());
+ for (int i = 0; i < 7; i++) {
+ final long t = System.currentTimeMillis();
+ traversal.get().iterate();
+ System.out.print(" " + (System.currentTimeMillis() - t));
+ }
+ });
+ }
+
+ @Test
+ @Ignore
+ public void testPlay4() throws Exception {
+ Graph graph = TinkerGraph.open();
+ graph.io(GraphMLIo.build()).readGraph("/Users/marko/software/tinkerpop/tinkerpop3/data/grateful-dead.xml");
+ GraphTraversalSource g = graph.traversal();
+ final List<Supplier<Traversal>> traversals = Arrays.asList(
+ () -> g.V().has(T.label, "song").out().groupCount().<Vertex>by(t ->
+ g.V(t).choose(r -> g.V(r).has(T.label, "artist").hasNext(),
+ in("writtenBy", "sungBy"),
+ both("followedBy")).values("name").next()).fold(),
+ () -> g.V().has(T.label, "song").out().groupCount().<Vertex>by(t ->
+ g.V(t).choose(has(T.label, "artist"),
+ in("writtenBy", "sungBy"),
+ both("followedBy")).values("name").next()).fold(),
+ () -> g.V().has(T.label, "song").out().groupCount().by(
+ choose(has(T.label, "artist"),
+ in("writtenBy", "sungBy"),
+ both("followedBy")).values("name")).fold(),
+ () -> g.V().has(T.label, "song").both().groupCount().<Vertex>by(t -> g.V(t).both().values("name").next()),
+ () -> g.V().has(T.label, "song").both().groupCount().by(both().values("name")));
+ traversals.forEach(traversal -> {
+ System.out.println("\nTESTING: " + traversal.get());
+ for (int i = 0; i < 10; i++) {
+ final long t = System.currentTimeMillis();
+ traversal.get().iterate();
+ //System.out.println(traversal.get().toList());
+ System.out.print(" " + (System.currentTimeMillis() - t));
+ }
+ });
+ }
+
+ @Test
+ @Ignore
+ public void testPlayDK() throws Exception {
+ final Graph graph = TinkerFactory.createModern();
+ final GraphTraversalSource g = graph.traversal();
+ Traversal traversal = g.V().where(out().and().in()).profile().cap(TraversalMetrics.METRICS_KEY);
+ //traversal.forEachRemaining(System.out::println);
+ System.out.println(traversal.toString());
+ traversal.asAdmin().applyStrategies();
+ System.out.println(traversal.toString());
+ traversal.forEachRemaining(System.out::println);
+ traversal = g.V().where(and(out(), in())).profile().cap(TraversalMetrics.METRICS_KEY);
+ //traversal.forEachRemaining(System.out::println);
+ System.out.println(traversal.toString());
+ traversal.asAdmin().applyStrategies();
+ System.out.println(traversal.toString());
+ //System.out.println(traversal.toString());
+ }
+
+ @Test
+ @Ignore
+ public void testPlay7() throws Exception {
+ /*TinkerGraph graph = TinkerGraph.open();
+ graph.createIndex("name",Vertex.class);
+ graph.io(GraphMLIo.build()).readGraph("/Users/marko/software/tinkerpop/tinkerpop3/data/grateful-dead.xml");*/
+ //System.out.println(g.V().properties().key().groupCount().next());
+ TinkerGraph graph = TinkerFactory.createModern();
+ GraphTraversalSource g = graph.traversal(GraphTraversalSource.standard());
+ final List<Supplier<GraphTraversal<?,?>>> traversals = Arrays.asList(
+ () -> g.V().out().as("v").match(
+ __.as("v").outE().count().as("outDegree"),
+ __.as("v").inE().count().as("inDegree")).select("v","outDegree","inDegree").by(valueMap()).by().by().local(union(select("v"), select("inDegree", "outDegree")).unfold().fold())
+ );
+
+ traversals.forEach(traversal -> {
+ System.out.println("pre-strategy: " + traversal.get());
+ System.out.println("post-strategy: " + traversal.get().iterate());
+ System.out.println(TimeUtil.clockWithResult(50, () -> traversal.get().toList()));
+ });
+ }
+
+ @Test
+ @Ignore
+ public void testPlay5() throws Exception {
+
+ TinkerGraph graph = TinkerGraph.open();
+ graph.createIndex("name",Vertex.class);
+ graph.io(GraphMLIo.build()).readGraph("/Users/marko/software/tinkerpop/tinkerpop3/data/grateful-dead.xml");
+ GraphTraversalSource g = graph.traversal(GraphTraversalSource.standard());
+
+ final Supplier<Traversal<?,?>> traversal = () ->
+ g.V().match(
+ as("a").has("name", "Garcia"),
+ as("a").in("writtenBy").as("b"),
+ as("b").out("followedBy").as("c"),
+ as("c").out("writtenBy").as("d"),
+ as("d").where(P.neq("a"))).select("a","b","c","d").by("name");
+
+
+ System.out.println(traversal.get());
+ System.out.println(traversal.get().iterate());
+ traversal.get().forEachRemaining(System.out::println);
+
+ }
+
+ @Test
+ @Ignore
+ public void testPlay6() throws Exception {
+ final Graph graph = TinkerGraph.open();
+ final GraphTraversalSource g = graph.traversal(GraphTraversalSource.standard());
+ for (int i = 0; i < 1000; i++) {
+ graph.addVertex(T.label, "person", T.id, i);
+ }
+ graph.vertices().forEachRemaining(a -> {
+ graph.vertices().forEachRemaining(b -> {
+ if (a != b) {
+ a.addEdge("knows", b);
+ }
+ });
+ });
+ graph.vertices(50).next().addEdge("uncle", graph.vertices(70).next());
+ System.out.println(TimeUtil.clockWithResult(500, () -> g.V().match(as("a").out("knows").as("b"), as("a").out("uncle").as("b")).toList()));
+ }
+}
http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/blob/fb6d006b/tinkergraph-gremlin/src/test/java/org/apache/tinkerpop/gremlin/tinkergraph/structure/TinkerGraphTest.java
----------------------------------------------------------------------
diff --git a/tinkergraph-gremlin/src/test/java/org/apache/tinkerpop/gremlin/tinkergraph/structure/TinkerGraphTest.java b/tinkergraph-gremlin/src/test/java/org/apache/tinkerpop/gremlin/tinkergraph/structure/TinkerGraphTest.java
index 6b23710..3d763b7 100644
--- a/tinkergraph-gremlin/src/test/java/org/apache/tinkerpop/gremlin/tinkergraph/structure/TinkerGraphTest.java
+++ b/tinkergraph-gremlin/src/test/java/org/apache/tinkerpop/gremlin/tinkergraph/structure/TinkerGraphTest.java
@@ -18,30 +18,13 @@
*/
package org.apache.tinkerpop.gremlin.tinkergraph.structure;
-import org.apache.tinkerpop.gremlin.process.traversal.Operator;
import org.apache.tinkerpop.gremlin.process.traversal.P;
-import org.apache.tinkerpop.gremlin.process.traversal.Scope;
-import org.apache.tinkerpop.gremlin.process.traversal.Traversal;
-import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversal;
-import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversalSource;
-import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__;
-import org.apache.tinkerpop.gremlin.process.traversal.util.TraversalMetrics;
import org.apache.tinkerpop.gremlin.structure.Edge;
-import org.apache.tinkerpop.gremlin.structure.Graph;
-import org.apache.tinkerpop.gremlin.structure.T;
import org.apache.tinkerpop.gremlin.structure.Vertex;
-import org.apache.tinkerpop.gremlin.structure.io.graphml.GraphMLIo;
-import org.apache.tinkerpop.gremlin.util.TimeUtil;
-import org.junit.Ignore;
import org.junit.Test;
-import java.util.Arrays;
-import java.util.List;
-import java.util.Map;
import java.util.Set;
-import java.util.function.Supplier;
-import static org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__.*;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertTrue;
@@ -52,186 +35,6 @@ import static org.junit.Assert.assertTrue;
public class TinkerGraphTest {
@Test
- @Ignore
- public void testPlay() {
- Graph g = TinkerGraph.open();
- Vertex v1 = g.addVertex(T.id, "1", "animal", "males");
- Vertex v2 = g.addVertex(T.id, "2", "animal", "puppy");
- Vertex v3 = g.addVertex(T.id, "3", "animal", "mama");
- Vertex v4 = g.addVertex(T.id, "4", "animal", "puppy");
- Vertex v5 = g.addVertex(T.id, "5", "animal", "chelsea");
- Vertex v6 = g.addVertex(T.id, "6", "animal", "low");
- Vertex v7 = g.addVertex(T.id, "7", "animal", "mama");
- Vertex v8 = g.addVertex(T.id, "8", "animal", "puppy");
- Vertex v9 = g.addVertex(T.id, "9", "animal", "chula");
-
- v1.addEdge("link", v2, "weight", 2f);
- v2.addEdge("link", v3, "weight", 3f);
- v2.addEdge("link", v4, "weight", 4f);
- v2.addEdge("link", v5, "weight", 5f);
- v3.addEdge("link", v6, "weight", 1f);
- v4.addEdge("link", v6, "weight", 2f);
- v5.addEdge("link", v6, "weight", 3f);
- v6.addEdge("link", v7, "weight", 2f);
- v6.addEdge("link", v8, "weight", 3f);
- v7.addEdge("link", v9, "weight", 1f);
- v8.addEdge("link", v9, "weight", 7f);
-
- g.traversal().withSack(Float.MIN_VALUE).V(v1).repeat(outE().sack(Operator.max, "weight").inV()).times(5).sack().forEachRemaining(System.out::println);
- }
-
- /* @Test
- public void testTraversalDSL() throws Exception {
- Graph g = TinkerFactory.createClassic();
- assertEquals(2, g.of(TinkerFactory.SocialTraversal.class).people("marko").knows().name().toList().size());
- g.of(TinkerFactory.SocialTraversal.class).people("marko").knows().name().forEachRemaining(name -> assertTrue(name.equals("josh") || name.equals("vadas")));
- assertEquals(1, g.of(TinkerFactory.SocialTraversal.class).people("marko").created().name().toList().size());
- g.of(TinkerFactory.SocialTraversal.class).people("marko").created().name().forEachRemaining(name -> assertEquals("lop", name));
- }*/
-
- @Test
- @Ignore
- public void benchmarkStandardTraversals() throws Exception {
- Graph graph = TinkerGraph.open();
- GraphTraversalSource g = graph.traversal();
- graph.io(GraphMLIo.build()).readGraph("data/grateful-dead.xml");
- final List<Supplier<Traversal>> traversals = Arrays.asList(
- () -> g.V().outE().inV().outE().inV().outE().inV(),
- () -> g.V().out().out().out(),
- () -> g.V().out().out().out().path(),
- () -> g.V().repeat(out()).times(2),
- () -> g.V().repeat(out()).times(3),
- () -> g.V().local(out().out().values("name").fold()),
- () -> g.V().out().local(out().out().values("name").fold()),
- () -> g.V().out().map(v -> g.V(v.get()).out().out().values("name").toList())
- );
- traversals.forEach(traversal -> {
- System.out.println("\nTESTING: " + traversal.get());
- for (int i = 0; i < 7; i++) {
- final long t = System.currentTimeMillis();
- traversal.get().iterate();
- System.out.print(" " + (System.currentTimeMillis() - t));
- }
- });
- }
-
- @Test
- @Ignore
- public void testPlay4() throws Exception {
- Graph graph = TinkerGraph.open();
- graph.io(GraphMLIo.build()).readGraph("/Users/marko/software/tinkerpop/tinkerpop3/data/grateful-dead.xml");
- GraphTraversalSource g = graph.traversal();
- final List<Supplier<Traversal>> traversals = Arrays.asList(
- () -> g.V().has(T.label, "song").out().groupCount().<Vertex>by(t ->
- g.V(t).choose(r -> g.V(r).has(T.label, "artist").hasNext(),
- in("writtenBy", "sungBy"),
- both("followedBy")).values("name").next()).fold(),
- () -> g.V().has(T.label, "song").out().groupCount().<Vertex>by(t ->
- g.V(t).choose(has(T.label, "artist"),
- in("writtenBy", "sungBy"),
- both("followedBy")).values("name").next()).fold(),
- () -> g.V().has(T.label, "song").out().groupCount().by(
- choose(has(T.label, "artist"),
- in("writtenBy", "sungBy"),
- both("followedBy")).values("name")).fold(),
- () -> g.V().has(T.label, "song").both().groupCount().<Vertex>by(t -> g.V(t).both().values("name").next()),
- () -> g.V().has(T.label, "song").both().groupCount().by(both().values("name")));
- traversals.forEach(traversal -> {
- System.out.println("\nTESTING: " + traversal.get());
- for (int i = 0; i < 10; i++) {
- final long t = System.currentTimeMillis();
- traversal.get().iterate();
- //System.out.println(traversal.get().toList());
- System.out.print(" " + (System.currentTimeMillis() - t));
- }
- });
- }
-
- @Test
- @Ignore
- public void testPlayDK() throws Exception {
- final Graph graph = TinkerFactory.createModern();
- final GraphTraversalSource g = graph.traversal();
- Traversal traversal = g.V().where(out().and().in()).profile().cap(TraversalMetrics.METRICS_KEY);
- //traversal.forEachRemaining(System.out::println);
- System.out.println(traversal.toString());
- traversal.asAdmin().applyStrategies();
- System.out.println(traversal.toString());
- traversal.forEachRemaining(System.out::println);
- traversal = g.V().where(and(out(), in())).profile().cap(TraversalMetrics.METRICS_KEY);
- //traversal.forEachRemaining(System.out::println);
- System.out.println(traversal.toString());
- traversal.asAdmin().applyStrategies();
- System.out.println(traversal.toString());
- //System.out.println(traversal.toString());
- }
-
- @Test
- @Ignore
- public void testPlay7() throws Exception {
- /*TinkerGraph graph = TinkerGraph.open();
- graph.createIndex("name",Vertex.class);
- graph.io(GraphMLIo.build()).readGraph("/Users/marko/software/tinkerpop/tinkerpop3/data/grateful-dead.xml");*/
- //System.out.println(g.V().properties().key().groupCount().next());
- TinkerGraph graph = TinkerFactory.createModern();
- GraphTraversalSource g = graph.traversal(GraphTraversalSource.standard());
- final List<Supplier<GraphTraversal<?,?>>> traversals = Arrays.asList(
- () -> g.V().out().as("v").match(
- __.as("v").outE().count().as("outDegree"),
- __.as("v").inE().count().as("inDegree")).select("v","outDegree","inDegree").by(valueMap()).by().by().local(union(select("v"), select("inDegree", "outDegree")).unfold().fold())
- );
-
- traversals.forEach(traversal -> {
- System.out.println("pre-strategy: " + traversal.get());
- System.out.println("post-strategy: " + traversal.get().iterate());
- System.out.println(TimeUtil.clockWithResult(50, () -> traversal.get().toList()));
- });
- }
-
- @Test
- @Ignore
- public void testPlay5() throws Exception {
-
- TinkerGraph graph = TinkerGraph.open();
- graph.createIndex("name",Vertex.class);
- graph.io(GraphMLIo.build()).readGraph("/Users/marko/software/tinkerpop/tinkerpop3/data/grateful-dead.xml");
- GraphTraversalSource g = graph.traversal(GraphTraversalSource.standard());
-
- final Supplier<Traversal<?,?>> traversal = () ->
- g.V().match(
- as("a").has("name", "Garcia"),
- as("a").in("writtenBy").as("b"),
- as("b").out("followedBy").as("c"),
- as("c").out("writtenBy").as("d"),
- as("d").where(P.neq("a"))).select("a","b","c","d").by("name");
-
-
- System.out.println(traversal.get());
- System.out.println(traversal.get().iterate());
- traversal.get().forEachRemaining(System.out::println);
-
- }
-
- @Test
- @Ignore
- public void testPlay6() throws Exception {
- final Graph graph = TinkerGraph.open();
- final GraphTraversalSource g = graph.traversal(GraphTraversalSource.standard());
- for (int i = 0; i < 1000; i++) {
- graph.addVertex(T.label, "person", T.id, i);
- }
- graph.vertices().forEachRemaining(a -> {
- graph.vertices().forEachRemaining(b -> {
- if (a != b) {
- a.addEdge("knows", b);
- }
- });
- });
- graph.vertices(50).next().addEdge("uncle", graph.vertices(70).next());
- System.out.println(TimeUtil.clockWithResult(500, () -> g.V().match(as("a").out("knows").as("b"), as("a").out("uncle").as("b")).toList()));
- }
-
- @Test
public void shouldManageIndices() {
final TinkerGraph g = TinkerGraph.open();
@@ -306,7 +109,6 @@ public class TinkerGraphTest {
g.createIndex("", Edge.class);
}
- @Ignore
@Test
public void shouldUpdateVertexIndicesInNewGraph() {
final TinkerGraph g = TinkerGraph.open();
@@ -326,7 +128,6 @@ public class TinkerGraphTest {
}, 35)).has("name", "stephen").count().next());
}
- @Ignore
@Test
public void shouldRemoveAVertexFromAnIndex() {
final TinkerGraph g = TinkerGraph.open();
@@ -353,7 +154,6 @@ public class TinkerGraphTest {
}, 35)).has("name", "stephen").count().next());
}
- @Ignore
@Test
public void shouldUpdateVertexIndicesInExistingGraph() {
final TinkerGraph g = TinkerGraph.open();
@@ -381,7 +181,6 @@ public class TinkerGraphTest {
}, 35)).has("name", "stephen").count().next());
}
- @Ignore
@Test
public void shouldUpdateEdgeIndicesInNewGraph() {
final TinkerGraph g = TinkerGraph.open();
@@ -402,7 +201,6 @@ public class TinkerGraphTest {
}, 0.5)).has("oid", "1").count().next());
}
- @Ignore
@Test
public void shouldRemoveEdgeFromAnIndex() {
final TinkerGraph g = TinkerGraph.open();
@@ -430,7 +228,6 @@ public class TinkerGraphTest {
}, 0.5)).has("oid", "1").count().next());
}
- @Ignore
@Test
public void shouldUpdateEdgeIndicesInExistingGraph() {
final TinkerGraph g = TinkerGraph.open();