Docs.rs
custos-math-0.6.3
custos-math 0.6.3
Permalink
Docs.rs crate page
MIT
Links
Repository
crates.io
Source
Owners
elftausend
Dependencies
custos ^0.6.3
normal
fastrand ^1.8.0
normal
optional
matrixmultiply ^0.3.2
normal
optional
Versions
12.78%
of the crate is documented
Platform
i686-pc-windows-msvc
i686-unknown-linux-gnu
x86_64-apple-darwin
x86_64-pc-windows-msvc
x86_64-unknown-linux-gnu
Feature flags
docs.rs
About docs.rs
Badges
Builds
Metadata
Shorthand URLs
Download
Rustdoc JSON
Build queue
Privacy policy
Rust
Rust website
The Book
Standard Library API Reference
Rust by Example
The Cargo Guide
Clippy Documentation
AddGraph
custos_
math
0.6.3
AddGraph
Required Methods
add
Implementations on Foreign Types
(&Buffer<'a, T, D, S>, &Buffer<'a, T, D, S>)
()
(isize, isize)
(usize, usize)
[&Buffer<'a, T, D, S>; 2]
[isize; 2]
[usize; 1]
[usize; 2]
isize
usize
Implementors
In custos_
math::
custos
custos_math
::
custos
Trait
AddGraph
Copy item path
Source
pub trait AddGraph { // Required method fn
add
(&self, graph: &mut
Graph
, len:
usize
) ->
Node
; }
Required Methods
§
Source
fn
add
(&self, graph: &mut
Graph
, len:
usize
) ->
Node
Implementations on Foreign Types
§
Source
§
impl
AddGraph
for (
isize
,
isize
)
Source
§
fn
add
(&self, graph: &mut
Graph
, len:
usize
) ->
Node
Source
§
impl
AddGraph
for (
usize
,
usize
)
Source
§
fn
add
(&self, graph: &mut
Graph
, len:
usize
) ->
Node
Source
§
impl
AddGraph
for
isize
Source
§
fn
add
(&self, graph: &mut
Graph
, len:
usize
) ->
Node
Source
§
impl
AddGraph
for
()
Source
§
fn
add
(&self, graph: &mut
Graph
, len:
usize
) ->
Node
Source
§
impl
AddGraph
for
usize
Source
§
fn
add
(&self, graph: &mut
Graph
, len:
usize
) ->
Node
Source
§
impl
AddGraph
for [
isize
;
2
]
Source
§
fn
add
(&self, graph: &mut
Graph
, len:
usize
) ->
Node
Source
§
impl
AddGraph
for [
usize
;
1
]
Source
§
fn
add
(&self, graph: &mut
Graph
, len:
usize
) ->
Node
Source
§
impl
AddGraph
for [
usize
;
2
]
Source
§
fn
add
(&self, graph: &mut
Graph
, len:
usize
) ->
Node
Source
§
impl<'a, T, D, S>
AddGraph
for (&
Buffer
<'a, T, D, S>, &
Buffer
<'a, T, D, S>)
where D:
Device
, S:
Shape
,
Source
§
fn
add
(&self, graph: &mut
Graph
, len:
usize
) ->
Node
Source
§
impl<'a, T, D, S>
AddGraph
for [&
Buffer
<'a, T, D, S>;
2
]
where D:
Device
, S:
Shape
,
Source
§
fn
add
(&self, graph: &mut
Graph
, len:
usize
) ->
Node
Implementors
§
Source
§
impl
AddGraph
for
CachedLeaf
Source
§
impl<'a, T, D, S>
AddGraph
for &
Buffer
<'a, T, D, S>
where D:
Device
, S:
Shape
,
Source
§
impl<'a, T, D, S>
AddGraph
for
Buffer
<'a, T, D, S>
where D:
Device
, S:
Shape
,