Package org.wymiwyg.rdf.graphs.impl

Examples of org.wymiwyg.rdf.graphs.impl.SimpleGraph.addAll()

330
331
332
333
334
335
336
337
338
339
340
          //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
35
36
37
38
39
40
41
42
43
44
45
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
38
39
40
41
42
43
44
45
46
47
48
    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());
  }
 
  public static void print(ReferenceGroundedDecomposition dec, Writer writer) throws IOException {
View Full Code Here
369
370
371
372
373
374
375
376
377
378
379
      Node currentAfgn, Node afgn, T tripleSet) {
    try {
      return new GraphUtil<SimpleGraph>().replaceNode(tripleSet, currentAfgn, afgn, new SimpleGraph());
    } catch (SourceNodeNotFoundException e) {
      SimpleGraph result = new SimpleGraph();
      result.addAll(tripleSet);
     
      return result;
    }
    /*
     * Set<Triple> result = new HashSet<Triple>(); for (Triple triple :
View Full Code Here
92
93
94
95
96
97
98
99
100
101
102
    ReferenceGroundedDecomposition refDec = new ReferenceGroundedDecompositionImpl(graph);
    ReferenceGroundedDecomposition leanifiedDec = getLeanVersionWithoutAnonymizing(refDec);
    Graph nonNaturalGraph = new SimpleGraph();
    for (Iterator<MaximumContextualMolecule> iter = leanifiedDec
        .getContextualMolecules().iterator(); iter.hasNext();) {
      nonNaturalGraph.addAll(iter.next());
    }
    for (Iterator<TerminalMolecule> iter = leanifiedDec.getTerminalMolecules()
        .iterator(); iter.hasNext();) {
      nonNaturalGraph.addAll(iter.next());
    }
View Full Code Here
96
97
98
99
100
101
102
103
104
105
106
        .getContextualMolecules().iterator(); iter.hasNext();) {
      nonNaturalGraph.addAll(iter.next());
    }
    for (Iterator<TerminalMolecule> iter = leanifiedDec.getTerminalMolecules()
        .iterator(); iter.hasNext();) {
      nonNaturalGraph.addAll(iter.next());
    }

    try {
      SimpleGraph result = new NaturalizedGraph(nonNaturalGraph, leanifiedDec
          .getFunctionallyGroundedNodes());
View Full Code Here
142
143
144
145
146
147
148
149
150
151
152
          .iterator(); iter.hasNext();) {
        MaximumContextualMolecule current = (MaximumContextualMolecule) iter
            .next();
        // test, why does it takes sooo much longer with molecule?
        SimpleGraph currentGraph = new SimpleGraph();
        currentGraph.addAll(current);
        GraphLeanifier.makeLean(currentGraph);
        currentGraph.markFinalized();
        leanifiedMolecules.add(currentGraph);
      }
      contextualMolecules = new HashSet<MaximumContextualMolecule>();
View Full Code Here
190
191
192
193
194
195
196
197
198
199
200
              new SimpleGraph());
        } catch (SourceNodeNotFoundException e) {
          // this is a bit strange ...
          throw new RuntimeException(e);
        }
        graph.addAll(addition);
        /*
         * graph.addAll(molecule); graph.add(new
         * TripleImp(naturalizer.naturalize(fgNode, null), new
         * PropertyNodeImpl(MODELDIFF.functionallyGroundedIn .getURI()),
         * namedNode));
 
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
     *
     * @see java.util.Iterator#next()
     */
    public Graph nextGraph() {
      SimpleGraph result = new SimpleGraph();
      result.addAll(multiSubllistsIter.nextList());
      result.markFinalized();
      return result;
    }

  }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.