Struct Node

pub struct Node { /* private fields */ }

Node wrapper.

Implementations

impl Node

pub fn from_proto(inner: NodeProto) -> Self

Creates new node from proto.

pub fn name(&self) -> String

Returns node name.

pub fn with_name<N: Into<String>>(self, name: N) -> Self

Renames output names accordingly.

Examples found in repository

examples/stddev.rs (line 9)

fn main() {
    let mut graph = builder::Graph::new("stddev");
    let x = graph.input("X").typed(DataType::Float).dim(1).dim(6).node();
    let two = graph.constant("two", 2.0f32);
    let std = (&x - x.mean(1, true)).abs().pow(two).mean(1, true).sqrt();
    let graph = graph.outputs_typed(std.with_name("stddev"), DataType::Float);
    let model = graph.model().build();
    save_model("stddev.onnx", &model).unwrap();
}

examples/add.rs (line 20)

fn main() {
    let mut graph = builder::Graph::new("add");

    let x = graph
        .input("X")
        .typed(DataType::Float)
        .dim(1)
        .dim(10)
        .node();
    let y = graph
        .input("Y")
        .typed(DataType::Float)
        .dim(1)
        .dim(10)
        .node();

    let z = (x + y).with_name("Z");

    let model = graph.outputs(z).model().build();

    save_model("add.onnx", &model).unwrap();
}

examples/concat.rs (line 9)

fn main() {
    let mut graph = builder::Graph::new("concat");
    let x = graph.input("X").typed(DataType::Float).dim(1).dim(6).node();
    let two = graph.constant("two", 2.0f32);
    let mean_reverse = -(&x - x.mean(1, true)) * two + &x;
    let concat = graph.concat(0, vec![x, mean_reverse]).with_name("concat");
    let graph = graph.outputs_typed(concat, DataType::Float);
    let model = graph.model().build();
    save_model("concat.onnx", &model).unwrap();
}

examples/ensemble.rs (line 10)

fn main() {
    let mut graph = builder::Graph::new("stddev");
    let x = graph.input("X").typed(DataType::Float).dim(1).dim(6).node();
    let std = stddev(&mut graph, &x);
    let mrev = mean_reverse(&mut graph, &x);
    let graph = graph
        .outputs_typed(std.with_name("stddev"), DataType::Float)
        .outputs_typed(mrev.with_name("mean_reverse"), DataType::Float);
    let model = graph.model().build();
    save_model("ensemble.onnx", &model).unwrap();
}

pub fn abs(&self) -> Node

Creates new absolute operation.

Examples found in repository

examples/ensemble.rs (line 18)

fn stddev(graph: &mut builder::Graph, x: &Node) -> Node {
    let two = graph.constant("two", 2.0f32);
    (x - x.mean(1, true)).abs().pow(two).mean(1, true).sqrt()
}

examples/stddev.rs (line 8)

fn main() {
    let mut graph = builder::Graph::new("stddev");
    let x = graph.input("X").typed(DataType::Float).dim(1).dim(6).node();
    let two = graph.constant("two", 2.0f32);
    let std = (&x - x.mean(1, true)).abs().pow(two).mean(1, true).sqrt();
    let graph = graph.outputs_typed(std.with_name("stddev"), DataType::Float);
    let model = graph.model().build();
    save_model("stddev.onnx", &model).unwrap();
}

pub fn sqrt(&self) -> Node

Creates new square root operation.

Examples found in repository

examples/ensemble.rs (line 18)

fn stddev(graph: &mut builder::Graph, x: &Node) -> Node {
    let two = graph.constant("two", 2.0f32);
    (x - x.mean(1, true)).abs().pow(two).mean(1, true).sqrt()
}

examples/stddev.rs (line 8)

fn main() {
    let mut graph = builder::Graph::new("stddev");
    let x = graph.input("X").typed(DataType::Float).dim(1).dim(6).node();
    let two = graph.constant("two", 2.0f32);
    let std = (&x - x.mean(1, true)).abs().pow(two).mean(1, true).sqrt();
    let graph = graph.outputs_typed(std.with_name("stddev"), DataType::Float);
    let model = graph.model().build();
    save_model("stddev.onnx", &model).unwrap();
}

pub fn pow<T: Into<String>>(&self, power: T) -> Node

Creates new power operation.

Examples found in repository

examples/ensemble.rs (line 18)

fn stddev(graph: &mut builder::Graph, x: &Node) -> Node {
    let two = graph.constant("two", 2.0f32);
    (x - x.mean(1, true)).abs().pow(two).mean(1, true).sqrt()
}

examples/stddev.rs (line 8)

fn main() {
    let mut graph = builder::Graph::new("stddev");
    let x = graph.input("X").typed(DataType::Float).dim(1).dim(6).node();
    let two = graph.constant("two", 2.0f32);
    let std = (&x - x.mean(1, true)).abs().pow(two).mean(1, true).sqrt();
    let graph = graph.outputs_typed(std.with_name("stddev"), DataType::Float);
    let model = graph.model().build();
    save_model("stddev.onnx", &model).unwrap();
}

pub fn sum<A: Into<Axes>>(&self, axes: A, keepdims: bool) -> Node

Creates new reduce sum operation.

pub fn max<A: Into<Axes>>(&self, axes: A, keepdims: bool) -> Node

Creates new reduce max operation.

pub fn mean<A: Into<Axes>>(&self, axes: A, keepdims: bool) -> Node

Creates new reduce mean operation.

Examples found in repository

examples/ensemble.rs (line 18)

fn stddev(graph: &mut builder::Graph, x: &Node) -> Node {
    let two = graph.constant("two", 2.0f32);
    (x - x.mean(1, true)).abs().pow(two).mean(1, true).sqrt()
}

fn mean_reverse(graph: &mut builder::Graph, x: &Node) -> Node {
    let two = graph.constant("two", 2.0f32);
    -(x - x.mean(1, true)) * two + x
}

examples/mean_reverse.rs (line 8)

fn main() {
    let mut graph = builder::Graph::new("reverse");
    let x = graph.input("X").typed(DataType::Float).dim(1).dim(6).node();
    let two = graph.constant("two", 2.0f32);
    let out = -(&x - x.mean(1, true)) * two + x;
    let graph = graph.outputs_typed(out, DataType::Float);
    let model = graph.model().build();
    save_model("mean-reverse.onnx", &model).unwrap();
}

examples/stddev.rs (line 8)

fn main() {
    let mut graph = builder::Graph::new("stddev");
    let x = graph.input("X").typed(DataType::Float).dim(1).dim(6).node();
    let two = graph.constant("two", 2.0f32);
    let std = (&x - x.mean(1, true)).abs().pow(two).mean(1, true).sqrt();
    let graph = graph.outputs_typed(std.with_name("stddev"), DataType::Float);
    let model = graph.model().build();
    save_model("stddev.onnx", &model).unwrap();
}

examples/concat.rs (line 8)

fn main() {
    let mut graph = builder::Graph::new("concat");
    let x = graph.input("X").typed(DataType::Float).dim(1).dim(6).node();
    let two = graph.constant("two", 2.0f32);
    let mean_reverse = -(&x - x.mean(1, true)) * two + &x;
    let concat = graph.concat(0, vec![x, mean_reverse]).with_name("concat");
    let graph = graph.outputs_typed(concat, DataType::Float);
    let model = graph.model().build();
    save_model("concat.onnx", &model).unwrap();
}

pub fn min<A: Into<Axes>>(&self, axes: A, keepdims: bool) -> Node

Creates new reduce min operation.

pub fn equal<Rhs: Into<String>>(&self, right: Rhs) -> Node

Creates new equal comparison operation.

pub fn greater<Rhs: Into<String>>(&self, right: Rhs) -> Node

Creates new greater comparison operation.

pub fn less<Rhs: Into<String>>(&self, right: Rhs) -> Node

Creates new less comparison operation.

pub fn and<Rhs: Into<String>>(&self, right: Rhs) -> Node

Creates new logical and operation.

pub fn or<Rhs: Into<String>>(&self, right: Rhs) -> Node

Creates new logical or operation.

pub fn relu(&self) -> Node

Creates new relu activation operation.

pub fn tanh(&self) -> Node

Creates new tanh activation operation.

pub fn size(&self) -> Node

Creates new size operation.

Trait Implementations

impl<Rhs: AsRef<Node>> Add<Rhs> for &Node

type Output = Node

The resulting type after applying the + operator.

fn add(self, rhs: Rhs) -> Self::Output

Performs the + operation.

impl<Rhs: AsRef<Node>> Add<Rhs> for Node

type Output = Node

The resulting type after applying the + operator.

fn add(self, rhs: Rhs) -> Self::Output

Performs the + operation.

impl AsRef<Node> for Abs

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for Add

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for And

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for Concat

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for Constant

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for Div

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for Equal

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for Greater

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for Less

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for Mul

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for Neg

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for Node

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for Not

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for Or

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for Pow

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for ReduceMax

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for ReduceMean

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for ReduceMin

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for ReduceSum

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for Relu

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for Size

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for Sqrt

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for Sub

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Node> for Tanh

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl Clone for Node

fn clone(&self) -> Node

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<Rhs: AsRef<Node>> Div<Rhs> for &Node

type Output = Node

The resulting type after applying the / operator.

fn div(self, rhs: Rhs) -> Self::Output

Performs the / operation.

impl<Rhs: AsRef<Node>> Div<Rhs> for Node

type Output = Node

The resulting type after applying the / operator.

fn div(self, rhs: Rhs) -> Self::Output

Performs the / operation.

impl From<&Node> for String

fn from(node: &Node) -> String

Converts to this type from the input type.

impl From<Node> for String

fn from(node: Node) -> String

Converts to this type from the input type.

impl From<NodeProto> for Node

fn from(inner: NodeProto) -> Self

Converts to this type from the input type.

impl Into<Node> for Abs

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for Add

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for And

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for Concat

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for Constant

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for Div

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for Equal

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for Greater

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for Less

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for Mul

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for Neg

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for Node

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for Not

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for Or

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for Pow

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for ReduceMax

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for ReduceMean

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for ReduceMin

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for ReduceSum

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for Relu

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for Size

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for Sqrt

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for Sub

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<Node> for Tanh

fn into(self) -> Node

Converts this type into the (usually inferred) input type.

impl Into<NodeProto> for Node

fn into(self) -> NodeProto

Converts this type into the (usually inferred) input type.

impl<Rhs: AsRef<Node>> Mul<Rhs> for &Node

type Output = Node

The resulting type after applying the * operator.

fn mul(self, rhs: Rhs) -> Self::Output

Performs the * operation.

impl<Rhs: AsRef<Node>> Mul<Rhs> for Node

type Output = Node

The resulting type after applying the * operator.

fn mul(self, rhs: Rhs) -> Self::Output

Performs the * operation.

impl Neg for &Node

type Output = Node

The resulting type after applying the - operator.

fn neg(self) -> Self::Output

Performs the unary - operation.

impl Neg for Node

type Output = Node

The resulting type after applying the - operator.

fn neg(self) -> Self::Output

Performs the unary - operation.

impl Not for &Node

type Output = Node

The resulting type after applying the ! operator.

fn not(self) -> Self::Output

Performs the unary ! operation.

impl Not for Node

type Output = Node

The resulting type after applying the ! operator.

fn not(self) -> Self::Output

Performs the unary ! operation.

impl<Rhs: AsRef<Node>> Sub<Rhs> for &Node

type Output = Node

The resulting type after applying the - operator.

fn sub(self, rhs: Rhs) -> Self::Output

Performs the - operation.

impl<Rhs: AsRef<Node>> Sub<Rhs> for Node

type Output = Node

The resulting type after applying the - operator.

fn sub(self, rhs: Rhs) -> Self::Output

Performs the - operation.