Package com.hp.hpl.jena.rdf.model

Examples of com.hp.hpl.jena.rdf.model.Resource.listProperties()


  private void parseConfiguration() {
    Iterator<Individual> it = this.model.listIndividuals(D2RQ.Configuration);
    if (it.hasNext()) {
      Resource configResource = it.next();
      Configuration configuration = new Configuration(configResource);
      StmtIterator stmts = configResource.listProperties(D2RQ.serveVocabulary);
      while (stmts.hasNext()) {
        configuration.setServeVocabulary(stmts.nextStatement().getBoolean());
      }     
      stmts = configResource.listProperties(D2RQ.useAllOptimizations);
      while (stmts.hasNext()) {
View Full Code Here


      Configuration configuration = new Configuration(configResource);
      StmtIterator stmts = configResource.listProperties(D2RQ.serveVocabulary);
      while (stmts.hasNext()) {
        configuration.setServeVocabulary(stmts.nextStatement().getBoolean());
      }     
      stmts = configResource.listProperties(D2RQ.useAllOptimizations);
      while (stmts.hasNext()) {
        configuration.setUseAllOptimizations(stmts.nextStatement().getBoolean());
      }     
      this.mapping.setConfiguration(configuration);
View Full Code Here

            // check for multiple paths arriving at this queue node
            if (!seen.contains( r )) {
                seen.add( r );

                // add the statements to the output model, and queue any new resources
                for (StmtIterator i = r.listProperties(); i.hasNext(); ) {
                    Statement s = i.nextStatement();

                    // don't do the occurs check now in case of reflexive statements
                    m.add( s );
View Full Code Here

            ResIterator ri = incoming.listSubjectsWithProperty(name, "Ian Dickinson");
            Resource bNode = ri.nextResource();
            ri.close();
           
            // Rewrite it to ground form
            int originalCount = bNode.listProperties().toList().size();
            Resource newR = incoming.createResource("http://www.hp.com/people/Ian_Dickinson");
            int runningCount = 0;
            StmtIterator si = incoming.listStatements(bNode, null, (RDFNode)null);
            Model additions = ModelFactory.createDefaultModel();
            while (si.hasNext()) {
View Full Code Here

          "Ian Dickinson");
      final Resource bNode = ri.nextResource();
      ri.close();

      // Rewrite it to ground form
      final int originalCount = bNode.listProperties().toList().size();
      final Resource newR = incoming
          .createResource("http://www.hp.com/people/Ian_Dickinson");
      int runningCount = 0;
      final StmtIterator si = incoming.listStatements(bNode, null,
          (RDFNode) null);
View Full Code Here

                  + " vs. " + qfCandidate);
        }
      }

      // GRAPH
      final StmtIterator dataI = actionNode
          .listProperties(SparqlDawgTestVocabulary.data);
      while (dataI.hasNext()) {
        dataFiles.add(dataI.nextStatement().getResource().getURI());
      }
View Full Code Here

      while (dataI.hasNext()) {
        dataFiles.add(dataI.nextStatement().getResource().getURI());
      }

      // NAMED GRAPH
      final StmtIterator graphDataI = actionNode
          .listProperties(SparqlDawgTestVocabulary.graphData);
      while (graphDataI.hasNext()) {
        graphDataFiles.add(graphDataI.nextStatement().getResource()
            .getURI());
      }
View Full Code Here

        // be more than one level. Basically each Lite test is also a
        // Full
        // test and now this information is given explicitly in Manifest
        // So loop through all the levels and find the tight bound
        int level = 3; // 0 - Lite, 1 - DL, 2 - Full
        StmtIterator si = testCase.listProperties( OWLTestVocabulary.level );
        while( si.hasNext() ) {
          Statement s = si.nextStatement();
          String levelName = s.getResource().getLocalName();
          if( level > LEVELS.indexOf( levelName ) ) {
            levelStmt = s;
View Full Code Here

                  + " vs. " + qfCandidate);
        }
      }

      // GRAPH
      final StmtIterator dataI = actionNode
          .listProperties(SparqlDawgTestVocabulary.data);
      while (dataI.hasNext()) {
        dataFiles.add(dataI.nextStatement().getResource().getURI());
      }
View Full Code Here

      while (dataI.hasNext()) {
        dataFiles.add(dataI.nextStatement().getResource().getURI());
      }

      // NAMED GRAPH
      final StmtIterator graphDataI = actionNode
          .listProperties(SparqlDawgTestVocabulary.graphData);
      while (graphDataI.hasNext()) {
        graphDataFiles.add(graphDataI.nextStatement().getResource()
            .getURI());
      }
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.