reasonable 0.2.0-alpha

An OWL 2 RL reasoner with reasonable performance
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45

use crate::common::URI;

use oxigraph::model::{Term, NamedNode, IriParseError};
use std::collections::HashMap;

pub struct URIIndex {
    map: HashMap<URI, Term>,
}

impl URIIndex {
    pub fn new() -> Self {
        let mut idx = URIIndex {
            map: HashMap::new(),
        };
        idx.map.insert(0, Term::NamedNode(NamedNode::new("urn:_").unwrap()));
        idx
    }

    pub fn put(&mut self, key: Term) -> URI {
        let h = hash(&key);
        self.map.insert(h, key);
        h
    }

    pub fn put_str(&mut self, _key: &'static str) -> Result<URI, IriParseError> {
        let key = Term::NamedNode(NamedNode::new(_key)?);
        let h = hash(&key);
        self.map.insert(h, key);
        Ok(h)
    }

    pub fn get(&self, key: URI) -> Option<&Term> {
        self.map.get(&key)
    }
}

pub fn hash(key: &Term) -> URI {
    farmhash::hash32(key.to_string().as_bytes())
}

#[allow(dead_code)]
pub fn hash_str(key: &'static str) -> URI {
    let s = key.to_string();
    farmhash::hash32(s.as_bytes())
}