Examples with KeyIndexableGraph com.tinkerpop.blueprints.KeyIndexableGraph used on opensource projects

Example 11 with KeyIndexableGraph

use of com.tinkerpop.blueprints.KeyIndexableGraph in project blueprints by tinkerpop.

the class SparkseeKeyIndexableGraphTestSuite method testKeyIndicesConsistentWithElementRemoval.

public void testKeyIndicesConsistentWithElementRemoval() throws Exception {
    KeyIndexableGraph graph = (KeyIndexableGraph) graphTest.generateGraph();
    graph.createKeyIndex("foo", Vertex.class);
    Vertex v1 = graph.addVertex(null);
    v1.setProperty("foo", "42");
    vertexCount(graph, 1);
    graph.removeVertex(v1);
    vertexCount(graph, 0);
    assertEquals(0, count(graph.getVertices("foo", "42")));
    graph.shutdown();
}

Example 12 with KeyIndexableGraph

use of com.tinkerpop.blueprints.KeyIndexableGraph in project blueprints by tinkerpop.

the class SparkseeKeyIndexableGraphTestSuite method testNoConcurrentModificationException.

public void testNoConcurrentModificationException() {
    KeyIndexableGraph graph = (KeyIndexableGraph) graphTest.generateGraph();
    if (graph.getFeatures().supportsEdgeKeyIndex) {
        graph.createKeyIndex("key", Edge.class);
        for (int i = 0; i < 25; i++) {
            graph.addEdge(null, graph.addVertex(null), graph.addVertex(null), graphTest.convertLabel("test")).setProperty("key", "value");
        }
        if (graph.getFeatures().supportsVertexIteration)
            assertEquals(count(graph.getVertices()), 50);
        if (graph.getFeatures().supportsEdgeIteration)
            assertEquals(count(graph.getEdges()), 25);
        int counter = 0;
        for (final Edge edge : graph.getEdges("key", "value")) {
            graph.removeEdge(edge);
            counter++;
        }
        assertEquals(counter, 25);
        if (graph.getFeatures().supportsVertexIteration)
            assertEquals(count(graph.getVertices()), 50);
        if (graph.getFeatures().supportsEdgeIteration)
            assertEquals(count(graph.getEdges()), 0);
    }
    graph.shutdown();
}

Example 13 with KeyIndexableGraph

use of com.tinkerpop.blueprints.KeyIndexableGraph in project blueprints by tinkerpop.

the class SparkseeKeyIndexableGraphTestSuite method testRemoveKeyIndexCannotAcceptNullArgumentForClass.

public void testRemoveKeyIndexCannotAcceptNullArgumentForClass() {
    KeyIndexableGraph graph = (KeyIndexableGraph) graphTest.generateGraph();
    try {
        graph.dropKeyIndex("test", null);
    } catch (IllegalArgumentException iae) {
        return;
    } finally {
        graph.shutdown();
    }
    fail();
}

Example 14 with KeyIndexableGraph

use of com.tinkerpop.blueprints.KeyIndexableGraph in project blueprints by tinkerpop.

the class SparkseeKeyIndexableGraphTestSuite method testGettingVerticesAndEdgesWithKeyValue.

//    public void testAutoIndexKeyDroppingWithPersistence() {
//        testAutoIndexKeyManagementWithPersistence();
//        KeyIndexableGraph graph = (KeyIndexableGraph) graphTest.generateGraph();
//        if (graph.getFeatures().isPersistent) {
//            if (graph.getFeatures().supportsVertexKeyIndex) {
//                graph.dropKeyIndex("name", Vertex.class);
//            }
//            if (graph.getFeatures().supportsEdgeKeyIndex) {
//                graph.dropKeyIndex("weight", Edge.class);
//            }
//            graph.shutdown();
//
//            graph = (KeyIndexableGraph) graphTest.generateGraph();
//            if (graph.getFeatures().supportsVertexKeyIndex) {
//                assertEquals(graph.getIndexedKeys(Vertex.class).size(), 1);
//                assertTrue(graph.getIndexedKeys(Vertex.class).contains("location"));
//                graph.dropKeyIndex("location", Vertex.class);
//            }
//            if (graph.getFeatures().supportsEdgeKeyIndex) {
//                assertEquals(graph.getIndexedKeys(Edge.class).size(), 1);
//                assertTrue(graph.getIndexedKeys(Edge.class).contains("since"));
//                graph.dropKeyIndex("since", Edge.class);
//            }
//            graph.shutdown();
//            graph = (KeyIndexableGraph) graphTest.generateGraph();
//            if (graph.getFeatures().supportsVertexKeyIndex) {
//                assertEquals(graph.getIndexedKeys(Vertex.class).size(), 0);
//            }
//            if (graph.getFeatures().supportsEdgeKeyIndex) {
//                assertEquals(graph.getIndexedKeys(Edge.class).size(), 0);
//            }
//        }
//        graph.shutdown();
//    }
public void testGettingVerticesAndEdgesWithKeyValue() {
    KeyIndexableGraph graph = (KeyIndexableGraph) graphTest.generateGraph();
    if (graph.getFeatures().supportsVertexIteration && graph.getFeatures().supportsVertexKeyIndex) {
        graph.createKeyIndex("name", Vertex.class);
        assertEquals(graph.getIndexedKeys(Vertex.class).size(), 1);
        assertTrue(graph.getIndexedKeys(Vertex.class).contains("name"));
        Vertex v1 = graph.addVertex(null);
        v1.setProperty("name", "marko");
        v1.setProperty("location", "everywhere");
        Vertex v2 = graph.addVertex(null);
        v2.setProperty("name", "stephen");
        v2.setProperty("location", "everywhere");
        assertEquals(count(graph.getVertices("location", "everywhere")), 2);
        assertEquals(count(graph.getVertices("name", "marko")), 1);
        assertEquals(count(graph.getVertices("name", "stephen")), 1);
        assertEquals(graph.getVertices("name", "marko").iterator().next(), v1);
        assertEquals(graph.getVertices("name", "stephen").iterator().next(), v2);
    }
    if (graph.getFeatures().supportsEdgeIteration && graph.getFeatures().supportsEdgeKeyIndex) {
        graph.createKeyIndex("place", Edge.class);
        assertEquals(graph.getIndexedKeys(Edge.class).size(), 1);
        assertTrue(graph.getIndexedKeys(Edge.class).contains("place"));
        Edge e1 = graph.addEdge(null, graph.addVertex(null), graph.addVertex(null), graphTest.convertLabel("knows"));
        e1.setProperty("name", "marko");
        e1.setProperty("place", "everywhere");
        Edge e2 = graph.addEdge(null, graph.addVertex(null), graph.addVertex(null), graphTest.convertLabel("knows"));
        e2.setProperty("name", "stephen");
        e2.setProperty("place", "everywhere");
        assertEquals(count(graph.getEdges("place", "everywhere")), 2);
        assertEquals(count(graph.getEdges("name", "marko")), 1);
        assertEquals(count(graph.getEdges("name", "stephen")), 1);
        assertEquals(graph.getEdges("name", "marko").iterator().next(), e1);
        assertEquals(graph.getEdges("name", "stephen").iterator().next(), e2);
    }
    graph.shutdown();
}

Example 15 with KeyIndexableGraph

use of com.tinkerpop.blueprints.KeyIndexableGraph in project blueprints by tinkerpop.

the class SparkseeKeyIndexableGraphTestSuite method testReIndexingOfElements.

public void testReIndexingOfElements() {
    KeyIndexableGraph graph = (KeyIndexableGraph) graphTest.generateGraph();
    if (graph.getFeatures().supportsVertexKeyIndex) {
        Vertex vertex = graph.addVertex(null);
        vertex.setProperty("name", "marko");
        assertEquals(count(graph.getVertices("name", "marko")), 1);
        assertEquals(graph.getVertices("name", "marko").iterator().next(), vertex);
        graph.createKeyIndex("name", Vertex.class);
        assertEquals(count(graph.getVertices("name", "marko")), 1);
        assertEquals(graph.getVertices("name", "marko").iterator().next(), vertex);
    }
    if (graph.getFeatures().supportsEdgeKeyIndex) {
        Edge edge = graph.addEdge(null, graph.addVertex(null), graph.addVertex(null), graphTest.convertLabel("knows"));
        edge.setProperty("date", 2012);
        assertEquals(count(graph.getEdges("date", 2012)), 1);
        assertEquals(graph.getEdges("date", 2012).iterator().next(), edge);
        graph.createKeyIndex("date", Edge.class);
        assertEquals(count(graph.getEdges("date", 2012)), 1);
        assertEquals(graph.getEdges("date", 2012).iterator().next(), edge);
    }
    graph.shutdown();
}