Examples with PropertyFilteredIterable com.tinkerpop.blueprints.util.PropertyFilteredIterable used on opensource projects

Example 1 with PropertyFilteredIterable

use of com.tinkerpop.blueprints.util.PropertyFilteredIterable in project blueprints by tinkerpop.

the class Neo4jBatchGraphTest method testAddingVerticesEdgesWithIndices.

public void testAddingVerticesEdgesWithIndices() {
    final String directory = this.getWorkingDirectory();
    final Neo4jBatchGraph batch = new Neo4jBatchGraph(directory);
    assertEquals(0, count(batch.getIndices()));
    batch.createKeyIndex("name", Vertex.class);
    batch.createKeyIndex("age", Vertex.class);
    Index<Edge> edgeIndex = batch.createIndex("edgeIdx", Edge.class);
    assertEquals(1, count(batch.getIndices()));
    for (final Index index : batch.getIndices()) {
        if (index.getIndexName().equals("edgeIdx")) {
            assertEquals(index.getIndexClass(), Edge.class);
        } else {
            throw new RuntimeException("There should not be another index.");
        }
    }
    final List<Long> ids = new ArrayList<Long>();
    for (int i = 0; i < 10; i++) {
        final Map<String, Object> map = new HashMap<String, Object>();
        map.put("name", i + "");
        map.put("age", i * 10);
        map.put("nothing", 0);
        ids.add((Long) batch.addVertex(map).getId());
    }
    for (int i = 1; i < ids.size(); i++) {
        final Map<String, Object> map = new HashMap<String, Object>();
        map.put("weight", 0.5f);
        long idA = ids.get(i - 1);
        long idB = ids.get(i);
        final Edge edge = batch.addEdge(map, batch.getVertex(idA), batch.getVertex(idB), idA + "-" + idB);
        edgeIndex.put("unique", idA + "-" + idB, edge);
        edgeIndex.put("full", "blah", edge);
    }
    batch.flushIndices();
    batch.shutdown();
    // native neo4j graph load
    final Neo4jGraph graph = new Neo4jGraph(directory);
    assertEquals(count(graph.getIndices()), 1);
    assertEquals(graph.getIndexedKeys(Vertex.class).size(), 2);
    assertTrue(graph.getIndexedKeys(Vertex.class).contains("name"));
    assertTrue(graph.getIndexedKeys(Vertex.class).contains("age"));
    edgeIndex = graph.getIndex("edgeIdx", Edge.class);
    assertEquals(edgeIndex.getIndexClass(), Edge.class);
    assertEquals(count(graph.getVertices()), 10);
    assertTrue(graph.getVertices("nothing", 0) instanceof PropertyFilteredIterable);
    assertTrue(graph.getVertices("blah", "blop") instanceof PropertyFilteredIterable);
    // key index used
    assertFalse(graph.getVertices("name", "marko") instanceof PropertyFilteredIterable);
    // key indexed used
    assertFalse(graph.getVertices("age", 32) instanceof PropertyFilteredIterable);
    for (final Vertex vertex : graph.getVertices()) {
        int age = (Integer) vertex.getProperty("age");
        assertEquals(vertex.getProperty("name"), (age / 10) + "");
        assertTrue(graph.getVertices("nothing", 0).iterator().hasNext());
        assertEquals(count(graph.getVertices("age", age)), 1);
        assertEquals(graph.getVertices("age", age).iterator().next(), vertex);
        assertEquals(count(graph.getVertices("name", (age / 10) + "")), 1);
        assertEquals(graph.getVertices("name", (age / 10) + "").iterator().next(), vertex);
        assertEquals(vertex.getPropertyKeys().size(), 3);
        vertex.setProperty("NEW", age);
        assertEquals(vertex.getPropertyKeys().size(), 4);
    }
    for (final Vertex vertex : graph.getVertices()) {
        int age = (Integer) vertex.getProperty("age");
        assertEquals(vertex.getProperty("NEW"), age);
        assertEquals(vertex.getPropertyKeys().size(), 4);
        vertex.removeProperty("NEW");
    }
    for (final Vertex vertex : graph.getVertices()) {
        assertNull(vertex.getProperty("NEW"));
        assertEquals(vertex.getPropertyKeys().size(), 3);
    }
    assertEquals(count(graph.getEdges()), 9);
    assertEquals(count(edgeIndex.get("full", "blah")), 9);
    Set<Edge> edges = new HashSet<Edge>();
    for (Edge edge : edgeIndex.get("full", "blah")) {
        edges.add(edge);
    }
    assertEquals(edges.size(), 9);
    for (final Edge edge : graph.getEdges()) {
        long idA = (Long) edge.getVertex(Direction.OUT).getId();
        long idB = (Long) edge.getVertex(Direction.IN).getId();
        assertEquals(idA + 1, idB);
        assertEquals(edge.getLabel(), idA + "-" + idB);
        assertEquals(edge.getPropertyKeys().size(), 1);
        assertEquals(edge.getProperty("weight"), 0.5f);
        assertEquals(edgeIndex.count("weight", 0.5f), 0);
        assertEquals(edgeIndex.count("unique", idA + "-" + idB), 1);
        assertEquals(edgeIndex.get("unique", idA + "-" + idB).iterator().next(), edge);
        assertTrue(edges.contains(edge));
    }
    graph.shutdown();
}

Example 2 with PropertyFilteredIterable

use of com.tinkerpop.blueprints.util.PropertyFilteredIterable in project blueprints by tinkerpop.

the class Neo4j2BatchGraphTest method testAddingVerticesEdgesWithIndices.

public void testAddingVerticesEdgesWithIndices() {
    final String directory = this.getWorkingDirectory();
    final Neo4j2BatchGraph batch = new Neo4j2BatchGraph(directory);
    assertEquals(0, count(batch.getIndices()));
    batch.createKeyIndex("name", Vertex.class);
    batch.createKeyIndex("age", Vertex.class);
    Index<Edge> edgeIndex = batch.createIndex("edgeIdx", Edge.class);
    assertEquals(1, count(batch.getIndices()));
    for (final Index index : batch.getIndices()) {
        if (index.getIndexName().equals("edgeIdx")) {
            assertEquals(index.getIndexClass(), Edge.class);
        } else {
            throw new RuntimeException("There should not be another index.");
        }
    }
    final List<Long> ids = new ArrayList<Long>();
    for (int i = 0; i < 10; i++) {
        final Map<String, Object> map = new HashMap<String, Object>();
        map.put("name", i + "");
        map.put("age", i * 10);
        map.put("nothing", 0);
        ids.add((Long) batch.addVertex(map).getId());
    }
    for (int i = 1; i < ids.size(); i++) {
        final Map<String, Object> map = new HashMap<String, Object>();
        map.put("weight", 0.5f);
        long idA = ids.get(i - 1);
        long idB = ids.get(i);
        final Edge edge = batch.addEdge(map, batch.getVertex(idA), batch.getVertex(idB), idA + "-" + idB);
        edgeIndex.put("unique", idA + "-" + idB, edge);
        edgeIndex.put("full", "blah", edge);
    }
    batch.flushIndices();
    batch.shutdown();
    // native neo4j graph load
    final Neo4j2Graph graph = new Neo4j2Graph(directory);
    graph.autoStartTransaction(true);
    assertEquals(count(graph.getIndices()), 1);
    assertEquals(graph.getIndexedKeys(Vertex.class).size(), 2);
    assertTrue(graph.getIndexedKeys(Vertex.class).contains("name"));
    assertTrue(graph.getIndexedKeys(Vertex.class).contains("age"));
    edgeIndex = graph.getIndex("edgeIdx", Edge.class);
    assertEquals(edgeIndex.getIndexClass(), Edge.class);
    assertEquals(count(graph.getVertices()), 10);
    assertTrue(graph.getVertices("nothing", 0) instanceof PropertyFilteredIterable);
    assertTrue(graph.getVertices("blah", "blop") instanceof PropertyFilteredIterable);
    // key index used
    assertFalse(graph.getVertices("name", "marko") instanceof PropertyFilteredIterable);
    // key indexed used
    assertFalse(graph.getVertices("age", 32) instanceof PropertyFilteredIterable);
    for (final Vertex vertex : graph.getVertices()) {
        int age = (Integer) vertex.getProperty("age");
        assertEquals(vertex.getProperty("name"), (age / 10) + "");
        assertTrue(graph.getVertices("nothing", 0).iterator().hasNext());
        assertEquals(count(graph.getVertices("age", age)), 1);
        assertEquals(graph.getVertices("age", age).iterator().next(), vertex);
        assertEquals(count(graph.getVertices("name", (age / 10) + "")), 1);
        assertEquals(graph.getVertices("name", (age / 10) + "").iterator().next(), vertex);
        assertEquals(vertex.getPropertyKeys().size(), 3);
        vertex.setProperty("NEW", age);
        assertEquals(vertex.getPropertyKeys().size(), 4);
    }
    for (final Vertex vertex : graph.getVertices()) {
        int age = (Integer) vertex.getProperty("age");
        assertEquals(vertex.getProperty("NEW"), age);
        assertEquals(vertex.getPropertyKeys().size(), 4);
        vertex.removeProperty("NEW");
    }
    for (final Vertex vertex : graph.getVertices()) {
        assertNull(vertex.getProperty("NEW"));
        assertEquals(vertex.getPropertyKeys().size(), 3);
    }
    assertEquals(count(graph.getEdges()), 9);
    assertEquals(count(edgeIndex.get("full", "blah")), 9);
    Set<Edge> edges = new HashSet<Edge>();
    for (Edge edge : edgeIndex.get("full", "blah")) {
        edges.add(edge);
    }
    assertEquals(edges.size(), 9);
    for (final Edge edge : graph.getEdges()) {
        long idA = (Long) edge.getVertex(Direction.OUT).getId();
        long idB = (Long) edge.getVertex(Direction.IN).getId();
        assertEquals(idA + 1, idB);
        assertEquals(edge.getLabel(), idA + "-" + idB);
        assertEquals(edge.getPropertyKeys().size(), 1);
        assertEquals(edge.getProperty("weight"), 0.5f);
        assertEquals(edgeIndex.count("weight", 0.5f), 0);
        assertEquals(edgeIndex.count("unique", idA + "-" + idB), 1);
        assertEquals(edgeIndex.get("unique", idA + "-" + idB).iterator().next(), edge);
        assertTrue(edges.contains(edge));
    }
    graph.shutdown();
}