onnx_graph 0.1.2

ONNX graph parser and execution engine for deep neural networks
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

use std::collections::HashMap;

use crate::typed_array::TypedArray;

#[derive(Default)]
pub struct TensorMap {
    inner: HashMap<String, TypedArray>,
}

impl TensorMap {
    pub fn new() -> Self {
        Self::default()
    }

    pub fn len(&self) -> usize {
        self.inner.len()
    }

    #[inline]
    pub fn insert(&mut self, key: String, val: TypedArray) {
        self.inner.insert(key, val.ensure_contiguous());
    }

    #[inline]
    pub fn get_disjoint_mut<const N: usize>(
        &mut self,
        key: [&str; N],
    ) -> [Option<&mut TypedArray>; N] {
        self.inner.get_disjoint_mut(key)
    }

    #[inline]
    pub fn get(&self, key: &str) -> Option<&TypedArray> {
        self.inner.get(key)
    }

    #[inline]
    pub fn get_mut(&mut self, key: &str) -> Option<&mut TypedArray> {
        self.inner.get_mut(key)
    }

    #[inline]
    pub fn remove(&mut self, key: &str) -> Option<TypedArray> {
        self.inner.remove(key)
    }

    #[inline]
    pub fn contains_key(&self, key: &str) -> bool {
        self.inner.contains_key(key)
    }

    #[inline]
    pub fn iter(&self) -> impl Iterator<Item = (&String, &TypedArray)> {
        self.inner.iter()
    }
}

pub struct UnsafeSendMut<T>(pub *mut T);
unsafe impl<T> Send for UnsafeSendMut<T> {}
unsafe impl<T> Sync for UnsafeSendMut<T> {}

impl<T> UnsafeSendMut<T> {
    pub unsafe fn as_mut(&self) -> &mut T {
        unsafe { &mut *self.0 }
    }
    pub unsafe fn as_ref(&self) -> &T {
        unsafe { &*self.0 }
    }
}