kgdata 4.0.1

Library to process dumps of knowledge graphs (Wikipedia, DBpedia, Wikidata)
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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155

use hashbrown::HashMap;

use crate::error::KGDataError;
use std::cmp::Eq;
use std::hash::Hash;
use std::marker::PhantomData;

use super::interface::Equivalent;
use super::Map;
use rayon::prelude::*;

pub struct ReadonlyRocksDBDict<K: AsRef<[u8]>, V> {
    db: rocksdb::DB,
    deser_value: fn(&[u8]) -> Result<V, KGDataError>,
    deser_key: PhantomData<fn() -> K>,
}

impl<K: AsRef<[u8]>, V> ReadonlyRocksDBDict<K, V> {
    pub fn new(db: rocksdb::DB, deser_value: fn(&[u8]) -> Result<V, KGDataError>) -> Self {
        Self {
            db,
            deser_value,
            deser_key: PhantomData,
        }
    }
}

impl<K: AsRef<[u8]> + Eq + Hash, V: Send + Sync> Map<K, V> for ReadonlyRocksDBDict<K, V> {
    #[inline]
    fn get<Q: ?Sized>(&self, key: &Q) -> Result<Option<V>, KGDataError>
    where
        Q: AsRef<[u8]> + Equivalent<K>,
    {
        match self.db.get_pinned(key.as_ref())? {
            None => Ok(None),
            Some(value) => (self.deser_value)(value.as_ref()).map(|v| Some(v)),
        }
        // match self.db.get(key.as_ref())? {
        //     None => Ok(None),
        //     Some(value) => (self.deser_value)(value.as_ref()).map(|v| Some(v)),
        // }
    }

    #[inline]
    fn contains_key<Q: ?Sized>(&self, key: &Q) -> Result<bool, KGDataError>
    where
        Q: AsRef<[u8]> + Equivalent<K>,
    {
        Ok(self.db.get_pinned(key.as_ref())?.is_some())
        // Ok(self.db.get(key.as_ref())?.is_some())
    }

    fn slice_get<Q>(&self, keys: &[Q]) -> Result<Vec<Option<V>>, KGDataError>
    where
        Q: AsRef<[u8]> + Equivalent<K>,
    {
        keys.into_iter()
            .map(|key| self.get(key))
            .collect::<Result<Vec<_>, KGDataError>>()
    }

    fn slice_get_exist<Q: AsRef<[u8]> + Equivalent<K>>(
        &self,
        keys: &[Q],
    ) -> Result<Vec<V>, KGDataError> {
        keys.into_iter()
            .map(|key| match self.get(key)? {
                None => Err(KGDataError::KeyError("Key not found".to_owned())),
                Some(value) => Ok(value),
            })
            .collect::<Result<Vec<_>, KGDataError>>()
    }

    fn slice_get_exist_as_map<Q>(&self, keys: &[Q]) -> Result<HashMap<K, V>, KGDataError>
    where
        Q: AsRef<[u8]> + Into<K> + Equivalent<K> + Clone,
    {
        keys.into_iter()
            .map(|key| match self.get(key)? {
                None => Err(KGDataError::KeyError("Key not found".to_owned())),
                Some(value) => Ok((key.clone().into(), value)),
            })
            .collect::<Result<HashMap<_, _>, KGDataError>>()
    }

    fn iter_get<I: IntoIterator<Item = Q>, Q>(&self, keys: I) -> Result<Vec<Option<V>>, KGDataError>
    where
        Q: AsRef<[u8]> + Equivalent<K>,
    {
        keys.into_iter()
            .map(|key| self.get(&key))
            .collect::<Result<Vec<_>, KGDataError>>()
    }

    fn iter_get_exist<I: IntoIterator<Item = Q>, Q>(&self, keys: I) -> Result<Vec<V>, KGDataError>
    where
        Q: AsRef<[u8]> + Equivalent<K>,
    {
        keys.into_iter()
            .map(|key| match self.get(&key)? {
                None => Err(KGDataError::KeyError("Key not found".to_owned())),
                Some(value) => Ok(value),
            })
            .collect::<Result<Vec<_>, KGDataError>>()
    }

    fn iter_get_exist_as_map<I: IntoIterator<Item = Q>, Q>(
        &self,
        keys: I,
    ) -> Result<HashMap<K, V>, KGDataError>
    where
        Q: AsRef<[u8]> + Equivalent<K> + Into<K> + Clone,
    {
        keys.into_iter()
            .map(|key| match self.get(&key)? {
                None => Err(KGDataError::KeyError("Key not found".to_owned())),
                Some(value) => Ok((key.clone().into(), value)),
            })
            .collect::<Result<HashMap<_, _>, KGDataError>>()
    }

    fn par_slice_get<Q: AsRef<[u8]> + Sync + Send + Equivalent<K>>(
        &self,
        keys: &[Q],
    ) -> Result<Vec<Option<V>>, KGDataError> {
        keys.into_par_iter()
            .map(|key| self.get(key))
            .collect::<Result<Vec<_>, KGDataError>>()
    }

    fn par_slice_get_exist<Q: AsRef<[u8]> + Sync + Send + Equivalent<K>>(
        &self,
        keys: &[Q],
    ) -> Result<Vec<V>, KGDataError> {
        keys.into_par_iter()
            .map(|key| {
                self.get(key)?
                    .ok_or_else(|| KGDataError::KeyError("Key not found".to_owned()))
            })
            .collect::<Result<Vec<_>, KGDataError>>()
    }

    fn par_slice_get_exist_as_map<Q>(&self, keys: &[Q]) -> Result<HashMap<K, V>, KGDataError>
    where
        K: Sync + Send,
        Q: AsRef<[u8]> + Into<K> + Sync + Send + Equivalent<K> + Clone,
    {
        keys.into_par_iter()
            .map(|key| match self.get(key)? {
                None => Err(KGDataError::KeyError("Key not found".to_owned())),
                Some(value) => Ok((key.clone().into(), value)),
            })
            .collect::<Result<HashMap<_, _>, KGDataError>>()
    }
}