Package org.apache.clerezza.rdf.core

Examples of org.apache.clerezza.rdf.core.Triple

186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
    UriRef property2 = new UriRef("http://example.org/property2");
    UriRef newUriRef = new UriRef("http://example.org/newName");
    Literal literal1 = new PlainLiteralImpl("literal");
    Literal literal2 = new PlainLiteralImpl("bla bla");

    Triple triple1 = new TripleImpl(bNode1, property1, literal1);
    Triple triple2 = new TripleImpl(bNode1, property2, property1);
    Triple triple3 = new TripleImpl(bNode2, property2, bNode1);
    Triple triple4 = new TripleImpl(property1, property1, bNode2);
    Triple triple5 = new TripleImpl(property1, property1, literal2);
    initialGraph.add(triple1);
    initialGraph.add(triple2);
    initialGraph.add(triple3);
    initialGraph.add(triple4);
    initialGraph.add(triple5);
    GraphNode node = new GraphNode(property1,
        new SimpleMGraph(initialGraph.iterator()));

    node.replaceWith(newUriRef, true);
    Assert.assertEquals(5, node.getGraph().size());
    Triple expectedTriple1 = new TripleImpl(bNode1, newUriRef, literal1);
    Triple expectedTriple2 = new TripleImpl(bNode1, property2, newUriRef);
    Triple expectedTriple3 = new TripleImpl(newUriRef, newUriRef, bNode2);
    Triple expectedTriple4 = new TripleImpl(newUriRef, newUriRef, literal2);

    Assert.assertTrue(node.getGraph().contains(expectedTriple1));
    Assert.assertTrue(node.getGraph().contains(expectedTriple2));
    Assert.assertTrue(node.getGraph().contains(expectedTriple3));
    Assert.assertTrue(node.getGraph().contains(expectedTriple4));

    Assert.assertFalse(node.getGraph().contains(triple1));
    Assert.assertFalse(node.getGraph().contains(triple2));
    Assert.assertFalse(node.getGraph().contains(triple4));
    Assert.assertFalse(node.getGraph().contains(triple5));

    node = new GraphNode(property1, new SimpleMGraph(initialGraph.iterator()));
    node.replaceWith(newBnode);
    Triple expectedTriple5 = new TripleImpl(bNode1, property2, newBnode);
    Triple expectedTriple6 = new TripleImpl(newBnode, property1, bNode2);
    Triple expectedTriple7 = new TripleImpl(newBnode, property1, literal2);

    Assert.assertTrue(node.getGraph().contains(triple1));
    Assert.assertTrue(node.getGraph().contains(expectedTriple5));
    Assert.assertTrue(node.getGraph().contains(expectedTriple6));
    Assert.assertTrue(node.getGraph().contains(expectedTriple7));

    node = new GraphNode(literal1, new SimpleMGraph(initialGraph.iterator()));
    node.replaceWith(newBnode);
    Triple expectedTriple8 = new TripleImpl(bNode1, property1, newBnode);
    Assert.assertTrue(node.getGraph().contains(expectedTriple8));

    node = new GraphNode(property1, new SimpleMGraph(initialGraph.iterator()));
    node.replaceWith(newUriRef);
    Triple expectedTriple9 = new TripleImpl(bNode1, property2, newUriRef);
    Triple expectedTriple10 = new TripleImpl(newUriRef, property1, bNode2);
    Triple expectedTriple11 = new TripleImpl(newUriRef, property1, literal2);
    Assert.assertTrue(node.getGraph().contains(triple1));
    Assert.assertTrue(node.getGraph().contains(expectedTriple9));
    Assert.assertTrue(node.getGraph().contains(expectedTriple10));
    Assert.assertTrue(node.getGraph().contains(expectedTriple11));
  }
View Full Code Here
87
88
89
90
91
92
93
94
95
96
97
98
      Iterator<Triple> javaPermissionTriples =
          systemGraph.filter(permission, PERMISSION.javaPermissionEntry, null);

      while (javaPermissionTriples.hasNext()) {

        Triple t = javaPermissionTriples.next();
        Literal permEntry = (Literal) t.getObject();

        permInfoList.add(new PermissionInfo(permEntry.getLexicalForm()));
      }
    }
View Full Code Here
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
    public int getRowCount() {
      return tripleList.size();
    }

    public Object getValueAt(int row, int col) {
      Triple triple = tripleList.get(row);
      switch (col) {
        case 0:
          return triple.getSubject();
        case 1:
          return triple.getPredicate();
        default:
          return triple.getObject();
      }
    }
View Full Code Here
97
98
99
100
101
102
103
104
105
106
107
108
    Map<UriRef,DocumentationItem> uri2docItemObj =
      new HashMap<UriRef,DocumentationItem>();
   
    while (docs.hasNext()) {
      Triple docc = docs.next();
      UriRef docItem = (UriRef) docc.getObject();
      Iterator<Triple> afterDocItemsIter = documentations.filter(docItem,
        DOCUMENTATION.after, null);
      Set<UriRef> afterDocItems = new HashSet<UriRef>();
      while (afterDocItemsIter.hasNext()) {
        afterDocItems.add((UriRef) afterDocItemsIter.next().getObject());
View Full Code Here
172
173
174
175
176
177
178
179
    TcManager.getInstance().createMGraph(new UriRef("http://example.org/read/graph"));
  }
  @Test(expected=ReadOnlyException.class)
  public void testAddTripleToMGraph() {
    MGraph mGraph = TcManager.getInstance().getMGraph(new UriRef("http://example.org/read/graph"));
    Triple triple = new TripleImpl(new UriRef("http://example.org/definition/isNonLiteral"), new UriRef("http://example.org/definition/isTest"), new PlainLiteralImpl("test"));
    mGraph.add(triple);
  }
View Full Code Here
72
73
74
75
76
77
78
79
80
  public void dateStorage() {
    MGraph graph = getEmptyMGraph();
    Date date = new Date(0);
    LiteralFactory literalFactory = LiteralFactory.getInstance();
    TypedLiteral dateLiteral = literalFactory.createTypedLiteral(date);
    Triple triple = new TripleImpl(new BNode(), new UriRef("http://example.com/property"), dateLiteral);
    graph.add(triple);
    Assert.assertTrue(graph.contains(triple));
  }
View Full Code Here
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
    Date date = new Date(0);
    LiteralFactory literalFactory = LiteralFactory.getInstance();
    TypedLiteral dateLiteral = literalFactory.createTypedLiteral(date);
    System.out.println(dateLiteral);
    UriRef property = new UriRef("http://example.com/property");
    Triple triple = new TripleImpl(new BNode(), property, dateLiteral);
    graph.add(triple);

    Triple tripleFromGraph = null;
    Iterator<Triple> propertyTriples = graph.filter(null, property, dateLiteral);
    if (propertyTriples.hasNext()) {
      tripleFromGraph = propertyTriples.next();
    } else {
      Assert.assertTrue(false);
    }
    Assert.assertEquals(dateLiteral, tripleFromGraph.getObject());
  }
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
    @Override
    public void run() {
      while (!stopRequested) {
        Literal randomLiteral = new PlainLiteralImpl(Util.createRandomString(22));
        Triple triple = new TripleImpl(new BNode(), new UriRef("http://example.com/property"), randomLiteral);
        mGraph.add(triple);
        addedTripleCount++;
        if ((addedTripleCount % 100) == 0) {
          testTriples.add(triple);
        }
View Full Code Here
130
131
132
133
134
135
136
137
138
139
140
    tmp.addAll(tc);

    List<MSG> msgSet = new LinkedList<MSG>();

    while (tmp.size() > 0) {
      Triple triple = tmp.iterator().next();
      TripleCollection msgTc = new SimpleMGraph();

      boolean containsBNode = fillMSG(triple, tmp, msgTc);
      MSG msg = new MSG(msgTc);
      msg.containsBlankNodes = containsBNode;
View Full Code Here
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
    typeChangeListener = new GraphListener() {

      @Override
      public void graphChanged(List<GraphEvent> events) {
        for (GraphEvent e : events) {
          Triple triple = e.getTriple();
          logger.debug("processing addition of type " + triple.getObject());
          if (type2IndexedProperties.containsKey((UriRef) triple.getObject())) {
            scheduleForReindex(triple.getSubject());
          }

        }
      }
    };

    baseGraph.addGraphListener(typeChangeListener, new FilterTriple(null, RDF.type, null));

    indexedPropertyChangeListener = new GraphListener() {

      @Override
      public void graphChanged(List<GraphEvent> events) {
        for (GraphEvent e : events) {
          logger.debug("Triple: " + e.getTriple());
          Triple triple = e.getTriple();

          UriRef predicate = triple.getPredicate();
          Set<VirtualProperty> vProperties = property2IncludingVProperty.get(predicate);

          List<Resource> indexedResources = new ArrayList<Resource>();
          logger.debug("Predicate: " + predicate);
          for (VirtualProperty vProperty : vProperties) {
            logger.debug("Subject: " + " " + triple.getSubject());
            followInversePaths(triple.getSubject(),
                vProperty.pathToIndexedResource(predicate), indexedResources);

          }
          for (Resource resource : indexedResources) {
            GraphNode node = new GraphNode(resource, e.getGraph());
            List<UriRef> types = new ArrayList<UriRef>();
            Lock lock = node.readLock();
            lock.lock();
            try {
              Iterator<Resource> resources = node.getObjects(RDF.type);
              while (resources.hasNext()) {
                Resource res = resources.next();
                if (res instanceof UriRef) {
                  types.add((UriRef) res);
                }
              }
            } finally {
              lock.unlock();
            }
            for (UriRef type : types) {
              if (type2IndexedProperties.containsKey(type)) {
                scheduleForReindex(resource);
              }
            }
          }

        }
      }
    };

    baseGraph.addGraphListener(indexedPropertyChangeListener,
        new FilterTriple(null, null, null) {

      @Override
      public boolean match(Triple triple) {
        UriRef predicate = triple.getPredicate();
        //check indirectly involved properties
        Set<VirtualProperty> vProperties = property2IncludingVProperty.get(predicate);
        if (vProperties != null) {
          for (VirtualProperty vProperty : vProperties) {
            if (property2TypeMap.containsKey(vProperty)) {
View Full Code Here
TOP

Related Classes of org.apache.clerezza.rdf.core.Triple

  • org.apache.clerezza.platform.content.AbstractDiscobitsHandler
  • org.apache.clerezza.platform.content.DiscobitsTypeHandler
  • org.apache.clerezza.platform.documentation.DocumentationProvider
  • org.apache.clerezza.platform.documentation.UriMutatorIterator
  • org.apache.clerezza.platform.documentation.UriMutatorIteratorTest
  • org.apache.clerezza.platform.documentation.viewer.DocumentationViewer
  • org.apache.clerezza.platform.security.PermissionDefinitions
  • org.apache.clerezza.platform.typehandlerspace.TypeHandlerSpace
  • org.apache.clerezza.platform.typehandlerspace.TypeHandlerSpaceTest
  • org.apache.clerezza.rdf.core.access.security.TcAccessController
    • 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.