Package com.hp.hpl.jena.graph

Examples of com.hp.hpl.jena.graph.Graph

363
364
365
366
367
368
369
370
371
372
373
        } catch (IOException ex) { errorOccurred(ex) ; return null ; }
    }

    private static DatasetGraph parse(HttpActionREST action, Lang lang, String base, InputStream input)
    {
        Graph graphTmp = GraphFactory.createGraphMem() ;
        Sink<Triple> sink = new SinkTriplesToGraph(graphTmp) ;
        LangRIOT parser = RiotReader.createParserTriples(input, lang, base, sink) ;
        parser.getProfile().setHandler(errorHandler) ;
        try {
            parser.parse() ;
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
78
        Trivial [incomplete] test that a Wrapped graph pokes through to the underlying
        graph. Really want something using mock classes. Will think about it.
    */
    public void testWrappedSame()
        {
        Graph m = Factory.createGraphMem();
        Graph w = new WrappedGraph( m );
        graphAdd( m, "a trumps b; c eats d" );
        assertIsomorphic( m, w );
        graphAdd( w, "i write this; you read that" );
        assertIsomorphic( w, m );
        }       
View Full Code Here
88
89
90
91
92
93
94
95
96
97
98
        }   
   
    public void testListSubjectsDoesntUseFind()
        {
        final boolean [] called = {false};
        Graph g = Factory.createGraphMem();
        ExtendedIterator<Node> subjects = g.queryHandler().subjectsFor( null, null );
        Set<Node> s = CollectionFactory.createHashedSet();
        while (subjects.hasNext()) s.add( subjects.next() );
        assertFalse( "find should not have been called", called[0] );
        }  
View Full Code Here
98
99
100
101
102
103
104
105
106
107
108
        }  
   
    public void testListPredicatesDoesntUseFind()
        {
        final boolean [] called = {false};
        Graph g = Factory.createGraphMem();
        ExtendedIterator<Node> predicates = g.queryHandler().predicatesFor( null, null );
        Set<Node> s = CollectionFactory.createHashedSet();
        while (predicates.hasNext()) s.add( predicates.next() );
        assertFalse( "find should not have been called", called[0] );
        }
View Full Code Here
108
109
110
111
112
113
114
115
116
117
118
        }
   
    public void testListObjectsDoesntUseFind()
        {
        final boolean [] called = {false};
        Graph g = Factory.createGraphMem();
        ExtendedIterator<Node> subjects = g.queryHandler().objectsFor( null, null );
        Set<Node> s = CollectionFactory.createHashedSet();
        while (subjects.hasNext()) s.add( subjects.next() );
        assertFalse( "find should not have been called", called[0] );
        }  
View Full Code Here
161
162
163
164
165
166
167
168
169
170
  }

    @Override
  public Graph getGraph() {
      Graph g = Factory.createGraphMem();
     
      g.getEventManager().register(new CheckChanges("simple tracking",g));
      return g;
  }
View Full Code Here
292
293
294
295
296
297
298
299
300
     * @param base      Base URI
     * @param lang      Language syntax
     */
    public static void read(Model model, StringReader in, String base, Lang lang)
    {
        Graph g = model.getGraph() ;
        StreamRDF dest = StreamRDFLib.graph(g) ;
        process(dest, in, base, lang, null) ;
    }
View Full Code Here
345
346
347
348
349
350
351
352
353
    /** Create a memory Graph and read in some data
     * @see #read(Graph,String)
     */
    public static Graph loadGraph(String uri)
  {
        Graph g = createGraph() ;
        read(g, uri) ;
        return g ;
    }
View Full Code Here
355
356
357
358
359
360
361
362
363
  /** Create a memory Graph and read in some data
     * @see #read(Graph,String,Lang)
     */
    public static Graph loadGraph(String uri, Lang lang)
  {
        Graph g = createGraph() ;
        read(g, uri, lang) ;
        return g ;
    }
View Full Code Here
86
87
88
89
90
91
92
93
    @Override
    public void write(Model model, Writer out, String base)
    {
        if (  base != null && base.equals("") )
            base = null ;
        Graph graph = model.getGraph() ;
        writer().write(out, graph, RiotLib.prefixMap(graph), base, context) ;
    }
View Full Code Here
TOP

Related Classes of com.hp.hpl.jena.graph.Graph

  • arq.examples.propertyfunction.localname
  • arq.load
  • com.clarkparsia.explanation.test.JenaExplanationTest
  • com.github.jsonldjava.jena.JenaRDFParser
  • com.hp.hpl.jena.assembler.ImportManager
  • com.hp.hpl.jena.graph.compose.PolyadicPrefixMappingImpl
  • com.hp.hpl.jena.graph.compose.test.TestDelta
  • com.hp.hpl.jena.graph.compose.test.TestDifference
  • com.hp.hpl.jena.graph.compose.test.TestDisjointUnion
  • com.hp.hpl.jena.graph.compose.test.TestIntersection
    • 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.