Fork of https://github.com/oxigraph/oxigraph.git for the purpose of NextGraph project
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 
oxigraph/lib/oxrdfxml
Yuri Astrakhan 1e37577b71 Optimize some code, lints 9 months ago
..
src Optimize some code, lints 9 months ago
Cargo.toml Release v0.4.0-alpha.3 10 months ago
README.md Simplify complex strings with raw literals, readme fix 10 months ago

README.md

OxRDF/XML

Latest Version Released API docs Crates.io downloads actions status Gitter

OxRdfXml is a parser and serializer for RDF/XML.

The entry points of this library are the two [RdfXmlParser] and [RdfXmlSerializer] structs.

Usage example counting the number of people in a RDF/XML file:

use oxrdf::{NamedNodeRef, vocab::rdf};
use oxrdfxml::RdfXmlParser;

fn main() {
    let file = br#"<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:schema="http://schema.org/">
 <rdf:Description rdf:about="http://example.com/foo">
   <rdf:type rdf:resource="http://schema.org/Person" />
   <schema:name>Foo</schema:name>
 </rdf:Description>
 <schema:Person rdf:about="http://example.com/bar" schema:name="Bar" />
</rdf:RDF>"#;

    let schema_person = NamedNodeRef::new("http://schema.org/Person").unwrap();
    let mut count = 0;
    for triple in RdfXmlParser::new().parse_read(file.as_ref()) {
        let triple = triple.unwrap();
        if triple.predicate == rdf::TYPE && triple.object == schema_person.into() {
            count += 1;
        }
    }
    assert_eq!(2, count);
}

License

This project is licensed under either of

  • Apache License, Version 2.0, (LICENSE-APACHE or <http://www.apache.org/licenses/LICENSE-2.0>)
  • MIT license (LICENSE-MIT or <http://opensource.org/licenses/MIT>)

at your option.

Contribution

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in Oxigraph by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.