autograd 0.8.0

Tensors and differentiable operations in Rust
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

extern crate ndarray;

pub mod adam;
#[allow(dead_code)]
pub mod sgd;

pub use self::adam::Adam;
pub use self::sgd::SGD;

use std::cmp::{Eq, Ordering, PartialEq};
use tensor::Tensor;

/// Key to access a state tensor.
/// Stateful optimizers use this.
pub struct StateKey<'a>(pub &'a Tensor);

impl<'a> Eq for StateKey<'a> {}

impl<'a> PartialEq for StateKey<'a> {
    #[inline]
    /// Compares addresses of the two tensors.
    /// This can be used for ordering-based data structures (e.g. BinaryTree).
    fn eq(&self, other: &StateKey<'a>) -> bool {
        (self.0 as *const _) == (other.0 as *const _)
    }
}

impl<'a> Ord for StateKey<'a> {
    #[inline]
    /// Compares addresses of the two tensors.
    /// This can be used for ordering-based data structures (e.g. BinaryTree).
    fn cmp(&self, other: &Self) -> Ordering {
        let a = self.0 as *const Tensor;
        let b = other.0 as *const Tensor;
        a.cmp(&b)
    }
}

impl<'a> PartialOrd for StateKey<'a> {
    #[inline]
    /// Compares addresses of the two tensors.
    /// This can be used for ordering-based data structures (e.g. BinaryTree).
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}