custos 0.7.0

A minimal OpenCL, WGPU, CUDA and host CPU array manipulation engine.
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

use crate::{shape::Shape, Buffer, Device, Graph, NodeIdx};

use super::node::Node;

/// Trait for adding a node to a graph.
pub trait AddGraph {
    /// Returns the indices of the node's parents.
    #[inline]
    fn idxs(&self) -> (usize, usize) {
        (0, 0)
    }

    /// Adds a node to the graph.
    #[inline]
    fn add<IdxFrom: NodeIdx>(&self, graph: &mut Graph<IdxFrom>, len: usize) -> Node {
        let (lhs_idx, rhs_idx) = self.idxs();
        graph.add_node(len, lhs_idx, rhs_idx)
    }
}

impl AddGraph for () {
    #[inline]
    fn add<IdxFrom: NodeIdx>(&self, graph: &mut Graph<IdxFrom>, len: usize) -> Node {
        graph.add_leaf(len)
    }
}

// Unary operation
impl AddGraph for usize {
    #[inline]
    fn idxs(&self) -> (usize, usize) {
        (*self, *self)
    }
}

impl AddGraph for (usize, usize) {
    #[inline]
    fn idxs(&self) -> (usize, usize) {
        *self
    }
}

impl<'a, T, D: Device, S: Shape> AddGraph for Buffer<'a, T, D, S> {
    #[inline]
    fn idxs(&self) -> (usize, usize) {
        (self.id().idx, self.id().idx)
    }
}

impl<'a, T, D: Device, S: Shape> AddGraph for &Buffer<'a, T, D, S> {
    #[inline]
    fn idxs(&self) -> (usize, usize) {
        (self.id().idx, self.id().idx)
    }
}

impl<'a, T, D: Device, LS: Shape, RS: Shape> AddGraph
    for (&Buffer<'a, T, D, LS>, &Buffer<'a, T, D, RS>)
{
    #[inline]
    fn idxs(&self) -> (usize, usize) {
        (self.0.id().idx, self.1.id().idx)
    }
}