Struct Wire 

pub struct Wire { /* private fields */ }

A half-declared graph.

Implementations

impl Wire

pub fn on(self, device: Device) -> Wire

This whole piece on one device. The innermost one wins: (a.on(Cuda(0)) >> b).on(Cuda(1)) leaves a on 0 and b on 1.

pub fn at(self, host: impl Into<Host>) -> Wire

This whole piece on one host, likewise, and independent of the device: the two can be written in any order.

pub fn frozen(self) -> Wire

This whole piece settled: its state does not change while the graph runs, innermost first. Only the half the core can hold — whoever knows what a gradient is says it again with the digest. See Memory::freeze.

pub fn cached(self) -> Wire

This whole piece worth keeping: what each node produces is looked up before being computed and kept after. Whether it can honestly be kept is cacheable’s question, asked before running.

pub fn mapped(self) -> Wire

This whole piece maps over the items of its input: a list in, a list as long out. What gives a cache the grain of an item.

pub fn somatize(self) -> Result<(Graph, Catalog, Placement, Memory), GraphError>

Materializes what was declared: the structure, the store, the placement and what is remembered, none containing the others. Fails on a repeated id, above all.

Trait Implementations

impl BitOr for Wire

fn bitor(self, other: Wire) -> Wire

a | b: two branches that do not touch. Whatever comes in reaches both, and whatever leaves either one leaves here.

type Output = Wire

The resulting type after applying the | operator.

impl Shr for Wire

fn shr(self, next: Wire) -> Wire

a >> b: everything leaving a enters everything starting b.

type Output = Wire

The resulting type after applying the >> operator.