Package org.wymiwyg.rdf.graphs.impl

Examples of org.wymiwyg.rdf.graphs.impl.SimpleGraph

205
206
207
208
209
210
211
212
213
214
215
          try {
            Subject.doAsPrivileged(null, new PrivilegedExceptionAction() {
              public Object run() throws Exception {
                Source source = new SourceImpl("http://example.org/graph-source");
                try {
                  store.assertGraph(source, new FCAGraphImpl(new SimpleGraph()));
                } catch (AccessControlException ex) {
                  exceptionCatched[0] = true;
                }
                return null;
              }
View Full Code Here
794
795
796
797
798
799
800
801
802
803
804
805
806
807
        }
      } else {
        relevantTriples.add(triple);
      }
    }
    SimpleGraph result = new SimpleGraph();
    for (Triple triple : relevantTriples) {
      result.add(new TripleImpl(replaceIfPossible(triple.getSubject(),
          map), triple.getPredicate(), replaceIfPossible(triple
          .getObject(), map)));
    }
    result.markFinalized();
    return result;
  }
View Full Code Here
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
      return getNextSubGraph();
    }

    private Graph getNextSubGraph() {
      int count = 0;
      Graph currentGraph = new SimpleGraph();
      for (TripleInfo info : tripleInfos) {
        switch (info.status) {
        case undefined:
          if (count < omitUndefined) {
            count++;
            break;
          } else {
            currentGraph.add(info.triple);
          }
          ;
          break;
        case needed:
          currentGraph.add(info.triple);
        }
      }
      if (count == 0) {
        return null;
      }
      System.out.println("returning subgraph of size "
          + currentGraph.size());
      return currentGraph;
    }
View Full Code Here
144
145
146
147
148
149
150
151
152
153
154
155
156
157
                  }
                  Node object = triple.getObject();
                  if (!(object instanceof GroundedNode)) {
                    object = NonTerminalMolecule.GROUNDED_NODE;
                  }
                  SimpleGraph result = new SimpleGraph();
                  result.add(new TripleImpl(subject, triple
                      .getPredicate(), object));
                  result.markFinalized();
                  return result;
                }

              }.readComponent(componentDir);
            }
View Full Code Here
236
237
238
239
240
241
242
243
244
245
246
              .get(verificationParameters[0]);
          if (loginData == null) {
            throw new HandlerException(
                "Verification string not found, probably expired");
          }
          Graph graph = new SimpleGraph();
          addUser(loginData, graph, request);
          response
              .setDefaultStylesheet("/application/stylesheets/verification-result");
          response.setBody(graph);
          Resource user = getUserByUsernameInIdentityGOT(loginData.userName);
View Full Code Here
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
   */
  private static void updateWorkingGraph(Store store, Source identity, Date now, final Source aggregatedSource, final Graph logEntryGraph) {
    store.perform(identity, new StoreTransaction() {

      public void execute(SourceStoreView storeView) {
        SimpleGraph newWorkingGraph = new SimpleGraph();
        FCAGraph oldWorkingGraph = storeView.getGraph();
        Node downloadAttemptNode = null;
        for (Triple triple : oldWorkingGraph) {
          if (triple.getObject().equals(aggregatedSource) &&
              triple.getPredicate().getURIRef().equals(AGGREGATOR.aggregatedSource.getURI())) {
            downloadAttemptNode = triple.getSubject();
            break;
          }
        }
        for (Iterator<Triple> iter = oldWorkingGraph.iterator(); iter.hasNext();) {
          Triple triple = iter.next();
          //x.equals(null) should return false, making the first condition obsolete
          if ((downloadAttemptNode == null) || !triple.getSubject().equals(downloadAttemptNode)) {
            newWorkingGraph.add(triple);
          }
        }
        newWorkingGraph.addAll(logEntryGraph);
        newWorkingGraph.markFinalized();
        storeView.revokeAll();
        storeView.assertGraph(new FCAGraphImpl(newWorkingGraph));
      }
     
    });
View Full Code Here
472
473
474
475
476
477
478
479
480
481
482
  }

  public void testWithEmptyGraphs() throws Exception {
    FCAGraph[] graphs = new FCAGraph[4];
    for (int i = 0; i < graphs.length; i++) {
      SimpleGraph simpleGraph = new SimpleGraph();
      simpleGraph.markFinalized();
      graphs[i] = new FCAGraphImpl(simpleGraph);
    }
    performTestsWithGraphs(graphs);
  }
View Full Code Here
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
      }
      return getNextSubGraph();
    }
    private Graph getNextSubGraph() {
      int count  = 0;
      Graph currentGraph = new SimpleGraph();
      for (TripleInfo info : tripleInfos) {
        switch (info.status) {
        case undefined:
          if (count < omitUndefined) {
            count++;
            break;
          } else {
            currentGraph.add(info.triple);
          }
          ;
          break;
        case needed:
          currentGraph.add(info.triple);
        }
      }
      if (count == 0) {
        return null;
      }
      System.out.println("returning subgraph of size "+currentGraph.size());
      return currentGraph;
    }
View Full Code Here
33
34
35
36
37
38
39
40
41
42
43
44
45
46
*
*/
public class ReferenceGroundedUtil {

  public static Graph reconstructGraph(ReferenceGroundedDecomposition dec) {
    Graph graph = new SimpleGraph();
    for (TerminalMolecule terminalMolecule : dec.getTerminalMolecules()) {
      graph.addAll(terminalMolecule);
    }
    for (ContextualMolecule contextualMolecule : dec.getContextualMolecules()) {
      graph.addAll(contextualMolecule);
    }
    return new NaturalizedGraph(graph, dec.getFunctionallyGroundedNodes());
  }
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
   *
   * @param graph
   * @param naturalizer
   */
  public NaturalizedGraph(Graph graph, Naturalizer naturalizer) {
    Graph fgNodesGraph = new SimpleGraph();
    Map<Set<NonTerminalMolecule>, Node> replacementMap = new HashMap<Set<NonTerminalMolecule>, Node>();
    addGraphTriples(graph, true, naturalizer, replacementMap, fgNodesGraph);
   
    while (fgNodesGraph.size() > 0) {
      //add the triples of the fg-nodes graph and repeat if new triples result from fg-nodes replacemnets
      //withing these triples
      Graph addingFgNodesGraph = fgNodesGraph;
      fgNodesGraph = new SimpleGraph();
      addGraphTriples(  addingFgNodesGraph, true, naturalizer, replacementMap, fgNodesGraph);
    }
    markFinalized();
  }
View Full Code Here
TOP

Related Classes of org.wymiwyg.rdf.graphs.impl.SimpleGraph

  • com.hp.hpl.jena.gvs.impl.filesystem.FSMoleculeStore
  • com.hp.hpl.jena.gvs.impl.filesystem.FSMoleculeStore$FSNTMolecule
  • com.hp.hpl.jena.gvs.services.aggregator.AggregatorService
  • com.hp.hpl.jena.gvs.services.http.accountmanager.AccountManager
  • com.hp.hpl.jena.gvs.test.MinimumFailingGraphDetector$SubGraphCreator
  • com.hp.hpl.jena.gvs.test.SecurityTest
  • com.hp.hpl.jena.gvs.test.StoreTest
  • org.wymiwyg.rdf.c8lserializer.C8lSerializer
  • org.wymiwyg.rdf.graphs.fgnodes.impl.NaturalizedGraph
  • org.wymiwyg.rdf.graphs.matcher.GraphMatcher
    • 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.