All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.joseki.util.GraphUtils Maven / Gradle / Ivy

/*
 * (c) Copyright 2005, 2006, 2007, 2008, 2009 Hewlett-Packard Development Company, LP
 * All rights reserved.
 * [See end of file]
 */

package org.joseki.util;

import java.io.InputStream;

import org.joseki.graph.GraphErrorHandler;
import org.joseki.graph.LimitingGraph;

import com.hp.hpl.jena.graph.Factory;
import com.hp.hpl.jena.graph.Graph;
import com.hp.hpl.jena.shared.NotFoundException;

import com.hp.hpl.jena.rdf.model.Model;
import com.hp.hpl.jena.rdf.model.ModelFactory;
import com.hp.hpl.jena.rdf.model.RDFReader;

import com.hp.hpl.jena.util.FileManager;
import com.hp.hpl.jena.util.FileUtils;

/** A packaging of code to do a controlled read of a graph or model */

public class GraphUtils
{
    // ---- Model level
    
    public static Model readModel(String uri, int limit)
    {
        return readModel(uri, limit, FileUtils.guessLang(uri)) ;
    }

    public static Model readModel(String uri, int limit, String syntax) 
    {
        Graph g = Factory.createGraphMem() ;
        return readUtil(g, uri, limit, syntax) ;
    }
    
    public static void loadModel(Model model, String uri, int limit) 
    {
        loadModel(model, uri, limit, null) ;
    }

    public static void loadModel(Model model, String uri, int limit, String syntax) 
    {
        Graph g = model.getGraph() ;
        readUtil(g, uri, limit, syntax) ;
    }

    // ---- Graph level
    
    public static Graph readGraph(String uri, int limit)
    {
        return readGraph(uri, limit, FileUtils.guessLang(uri)) ;
    }
    
    public static Graph readGraph(String uri, int limit, String syntax) 
    {
        Graph g = Factory.createGraphMem() ;
        Model m = readUtil(g, uri, limit, syntax) ;
        return m.getGraph() ;
    }
    
    public static void loadGraph(Graph g, String uri, int limit) 
    {
        loadGraph(g, uri, limit, FileUtils.guessLang(uri)) ;
    }

    public static void loadGraph(Graph g, String uri, int limit, String syntax) 
    {
        Model m = readUtil(g, uri, limit, syntax) ;
    }
    
    
    private static Model readUtil(Graph graph, String uri, int limit, String syntax) 
    {
        // Use the mapped uri as the syntax hint.
        {
            String altURI = FileManager.get().mapURI(uri) ;
            if ( altURI != null )
                syntax = FileUtils.guessLang(uri) ;
        }
        // Temporary model wrapper 
        Graph g = new LimitingGraph(graph, limit) ;
        Model m = ModelFactory.createModelForGraph(g) ;
        
        // If it's RDF/XML, go via Jena and set the HTTP readers.
//        if ( FileUtils.langXML.equals(syntax) )
//        {
//            m.read(uri, uri) ;
//            return m ;
//        }
//        else
        {
            // Otherwise open raw and hope the syntax is right. 
            RDFReader r = m.getReader(syntax) ;
            r.setErrorHandler(new GraphErrorHandler()) ;
            InputStream in = FileManager.get().open(uri) ;
            if ( in == null )
                // Not found.
                throw new NotFoundException("Not found: "+uri) ;
            r.read(m, in, uri) ;
            return m ;
        }
    }
}

/*
 * (c) Copyright 2005, 2006, 2007, 2008, 2009 Hewlett-Packard Development Company, LP
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. The name of the author may not be used to endorse or promote products
 *    derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */




© 2015 - 2025 Weber Informatics LLC | Privacy Policy