Package com.tinkerpop.blueprints

Examples of com.tinkerpop.blueprints.IndexableGraph

143
144
145
146
147
148
149
150
151
152
153
154
  @Override
  public void visit(final VertexPropertyTest vertexPropertyTest) {
    // TODO improve that code !!!
    Graph g = service.getDatabase();
    if (g instanceof IndexableGraph) {
      final IndexableGraph indexable = (IndexableGraph) g;
      final Index<Vertex> vertices = indexable
              .getIndex(IndexNames.VERTICES.getIndexName(), Vertex.class);
      result.put(new Iterable<Vertex>() {
       
        @Override
        public Iterator<Vertex> iterator() {
View Full Code Here
408
409
410
411
412
413
414
415
416
417
418
419
420
   */
  public static <Type extends Element> void setIndexedProperty(Graph database, Type entity, String propertyName, Object newValue) {
    Object oldValue = entity.getProperty(propertyName);
    entity.setProperty(propertyName, newValue);
    if(database instanceof IndexableGraph) {
      IndexableGraph indexable = (IndexableGraph) database;
      IndexNames indexName = IndexNames.forElement(entity);
      Index<Type> index = (Index<Type>) indexable.getIndex(indexName.getIndexName(), indexName.getIndexed());
      if(oldValue!=null) {
        index.remove(propertyName, oldValue, entity);
      }
      if(newValue!=null) {
        index.put(propertyName, newValue, entity);
View Full Code Here
427
428
429
430
431
432
433
434
435
436
437
438
439
440
   * @param database graph on which remove operation will be performed (must be indexable)
   * @param existing element to remove index entries
   */
  public static <Type extends Element> void removeFromIndex(Graph database, Type existing) {
    if (database instanceof IndexableGraph) {
      IndexableGraph indexable = (IndexableGraph) database;
      IndexNames indexName = IndexNames.forElement(existing);
      if(indexName.isUsable()) {
        Index<Type> index = (Index<Type>) indexable.getIndex(indexName.getIndexName(), indexName.getIndexed());
        for(String propertyName : existing.getPropertyKeys()) {
          index.remove(propertyName, existing.getProperty(propertyName), existing);
        }
      }
    }
View Full Code Here
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
        batch.flushIndices();
        batch.shutdown();

        // native neo4j graph load

        IndexableGraph graph = new Neo4jGraph(directory);
        Iterator<Vertex> itty = graph.getIndex("testIdx", Vertex.class).query("name", "*rko").iterator();
        int counter = 0;
        while (itty.hasNext()) {
            counter++;
            assertEquals(itty.next().getProperty("name"), "marko");
        }
        assertEquals(counter, 1);

        itty = graph.getIndex("testIdx", Vertex.class).query("name", "MaRkO").iterator();
        counter = 0;
        while (itty.hasNext()) {
            counter++;
            assertEquals(itty.next().getProperty("name"), "marko");
        }
        assertEquals(counter, 1);

        graph.shutdown();
    }
View Full Code Here
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
        }
    }

    protected void resetGraph() {
        final KeyIndexableGraph graph = (KeyIndexableGraph) this.generateGraph();
        final IndexableGraph idxGraph = (IndexableGraph) graph;

        // since we don't have graph.clear() anymore we manually reset the graph.
        Iterator<Vertex> vertexItty = graph.getVertices().iterator();
        List<Vertex> verticesToRemove = new ArrayList<Vertex>();
        while (vertexItty.hasNext()) {
            verticesToRemove.add(vertexItty.next());
        }

        for (Vertex vertexToRemove : verticesToRemove) {
            graph.removeVertex(vertexToRemove);
        }

        for (String key : graph.getIndexedKeys(Vertex.class)) {
            graph.dropKeyIndex(key, Vertex.class);
        }

        for (String key : graph.getIndexedKeys(Edge.class)) {
            graph.dropKeyIndex(key, Edge.class);
        }

        for (Index idx : idxGraph.getIndices()) {
            idxGraph.dropIndex(idx.getIndexName());
        }
    }
View Full Code Here
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
* @author Marko A. Rodriguez (http://markorodriguez.com)
*/
public class IndexableGraphHelperTest extends BaseTest {

    public void testAddUniqueVertex() {
        IndexableGraph graph = new TinkerGraph();
        Vertex marko = graph.addVertex(0);
        marko.setProperty("name", "marko");
        Index<Vertex> index = graph.createIndex("txIdx", Vertex.class);
        index.put("name", "marko", marko);
        Vertex vertex = IndexableGraphHelper.addUniqueVertex(graph, null, index, "name", "marko");
        assertEquals(vertex.getProperty("name"), "marko");
        assertEquals(vertex, graph.getVertex(0));
        assertEquals(count(graph.getVertices()), 1);
        assertEquals(count(graph.getEdges()), 0);

        vertex = IndexableGraphHelper.addUniqueVertex(graph, null, index, "name", "darrick");
        assertEquals(vertex.getProperty("name"), "darrick");
        assertEquals(count(graph.getVertices()), 2);
        assertEquals(vertex.getId(), "1");
    }
View Full Code Here
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
            assertTrue(edge.getVertex(Direction.IN) instanceof ReadOnlyVertex);
        }
    }

    public void testReadOnlyIndices() {
        IndexableGraph graph = new ReadOnlyIndexableGraph<TinkerGraph>(TinkerGraphFactory.createTinkerGraph());
        Index<Vertex> index = ((WrapperGraph<IndexableGraph>) graph).getBaseGraph().createIndex("blah", Vertex.class);
        index.put("name", "marko", graph.getVertex(1));
        assertTrue(graph.getIndices() instanceof ReadOnlyIndexIterable);
        index = graph.getIndex("blah", Vertex.class);
        assertTrue(index instanceof ReadOnlyIndex);
        assertTrue(index.get("name", "marko") instanceof ReadOnlyVertexIterable);
        try {
            index.put("name", "noname", graph.getVertex(1));
            assertTrue(false);
        } catch (UnsupportedOperationException e) {
            assertTrue(true);
        }
        try {
            index.remove("name", "marko", graph.getVertex(1));
            assertTrue(false);
        } catch (UnsupportedOperationException e) {
            assertTrue(true);
        }
        assertTrue(Vertex.class.isAssignableFrom(index.getIndexClass()));
View Full Code Here
413
414
415
416
417
418
419
420
421
422
423
424
425
   */
  public static <Type extends Element> void setIndexedProperty(Graph database, Type entity, String propertyName, Object newValue) {
    Object oldValue = entity.getProperty(propertyName);
    entity.setProperty(propertyName, newValue);
    if(database instanceof IndexableGraph) {
      IndexableGraph indexable = (IndexableGraph) database;
      IndexNames indexName = IndexNames.forElement(entity);
      Index<Type> index = (Index<Type>) indexable.getIndex(indexName.getIndexName(), indexName.getIndexed());
      if(oldValue!=null) {
        index.remove(propertyName, oldValue, entity);
      }
      if(newValue!=null) {
        index.put(propertyName, newValue, entity);
View Full Code Here
432
433
434
435
436
437
438
439
440
441
442
443
444
445
   * @param database graph on which remove operation will be performed (must be indexable)
   * @param existing element to remove index entries
   */
  public static <Type extends Element> void removeFromIndex(Graph database, Type existing) {
    if (database instanceof IndexableGraph) {
      IndexableGraph indexable = (IndexableGraph) database;
      IndexNames indexName = IndexNames.forElement(existing);
      if(indexName.isUsable()) {
        Index<Type> index = (Index<Type>) indexable.getIndex(indexName.getIndexName(), indexName.getIndexed());
        for(String propertyName : existing.getPropertyKeys()) {
          index.remove(propertyName, existing.getProperty(propertyName), existing);
        }
      }
    }
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
        final RexsterApplicationGraph rag = this.getRexsterApplicationGraph(graphName);
        final Graph graph = rag.getGraph();

        final JSONObject theRequestObject = this.getRequestObject();

        final IndexableGraph idxGraph = graph instanceof IndexableGraph ? (IndexableGraph) graph : null;

        if (idxGraph == null) {
            final JSONObject error = this.generateErrorObject("The requested graph is not of type " + IndexableGraph.class.getName() + ".");
            throw new WebApplicationException(Response.status(Response.Status.INTERNAL_SERVER_ERROR).entity(error).build());
        }

        final Long start = RequestObjectHelper.getStartOffset(theRequestObject);
        final Long end = RequestObjectHelper.getEndOffset(theRequestObject);

        long counter = 0l;

        try {
            final JSONArray indexArray = new JSONArray();
            for (Index index : idxGraph.getIndices()) {
                if (counter >= start && counter < end) {
                    indexArray.put(createJSONObject(index));
                }
                counter++;
            }
View Full Code Here
TOP

Related Classes of com.tinkerpop.blueprints.IndexableGraph

  • com.dooapp.gaedo.blueprints.GraphUtils
  • com.dooapp.gaedo.blueprints.queries.executable.VertexRootsCollector
  • com.tinkerpop.blueprints.impls.neo4j.batch.Neo4jBatchGraphTest
  • com.tinkerpop.blueprints.impls.rexster.RexsterGraphTest
  • com.tinkerpop.blueprints.util.IndexableGraphHelperTest
  • com.tinkerpop.blueprints.util.wrappers.readonly.ReadOnlyGraphTest
  • com.tinkerpop.rexster.BaseTest
  • com.tinkerpop.rexster.IndexResource
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.