Struct arrow::ipc::gen::SparseTensor::SparseTensorIndexCOO [−][src]
pub struct SparseTensorIndexCOO<'a> { pub _tab: Table<'a>, }
Expand description
EXPERIMENTAL: Data structures for sparse tensors Coordinate (COO) format of sparse tensor index.
COO’s index list are represented as a NxM matrix, where N is the number of non-zero values, and M is the number of dimensions of a sparse tensor.
indicesBuffer stores the location and size of the data of this indices matrix. The value type and the stride of the indices matrix is specified in indicesType and indicesStrides fields.
For example, let X be a 2x3x4x5 tensor, and it has the following 6 non-zero values:
X[0, 1, 2, 0] := 1
X[1, 1, 2, 3] := 2
X[0, 2, 1, 0] := 3
X[0, 1, 3, 0] := 4
X[0, 1, 2, 1] := 5
X[1, 2, 0, 4] := 6
In COO format, the index matrix of X is the following 4x6 matrix:
[[0, 0, 0, 0, 1, 1],
[1, 1, 1, 2, 1, 2],
[2, 2, 3, 1, 2, 0],
[0, 1, 0, 0, 3, 4]]
When isCanonical is true, the indices is sorted in lexicographical order (row-major order), and it does not have duplicated entries. Otherwise, the indices may not be sorted, or may have duplicated entries.
Fields
_tab: Table<'a>
Implementations
impl<'a> SparseTensorIndexCOO<'a>
[src]
impl<'a> SparseTensorIndexCOO<'a>
[src]pub fn init_from_table(table: Table<'a>) -> Self
[src]
pub fn create<'bldr: 'args, 'args: 'mut_bldr, 'mut_bldr>(
_fbb: &'mut_bldr mut FlatBufferBuilder<'bldr>,
args: &'args SparseTensorIndexCOOArgs<'args>
) -> WIPOffset<SparseTensorIndexCOO<'bldr>>
[src]
_fbb: &'mut_bldr mut FlatBufferBuilder<'bldr>,
args: &'args SparseTensorIndexCOOArgs<'args>
) -> WIPOffset<SparseTensorIndexCOO<'bldr>>
pub const VT_INDICESTYPE: VOffsetT
[src]
pub const VT_INDICESSTRIDES: VOffsetT
[src]
pub const VT_INDICESBUFFER: VOffsetT
[src]
pub const VT_ISCANONICAL: VOffsetT
[src]
pub fn indicesType(&self) -> Int<'a>
[src]
pub fn indicesType(&self) -> Int<'a>
[src]The type of values in indicesBuffer
pub fn indicesStrides(&self) -> Option<Vector<'a, i64>>
[src]
pub fn indicesStrides(&self) -> Option<Vector<'a, i64>>
[src]Non-negative byte offsets to advance one value cell along each dimension If omitted, default to row-major order (C-like).
pub fn indicesBuffer(&self) -> &'a Buffer
[src]
pub fn indicesBuffer(&self) -> &'a Buffer
[src]The location and size of the indices matrix’s data
pub fn isCanonical(&self) -> bool
[src]
pub fn isCanonical(&self) -> bool
[src]This flag is true if and only if the indices matrix is sorted in row-major order, and does not have duplicated entries. This sort order is the same as of Tensorflow’s SparseTensor, but it is inverse order of SciPy’s canonical coo_matrix (SciPy employs column-major order for its coo_matrix).
Trait Implementations
impl<'a> Clone for SparseTensorIndexCOO<'a>
[src]
impl<'a> Clone for SparseTensorIndexCOO<'a>
[src]fn clone(&self) -> SparseTensorIndexCOO<'a>
[src]
fn clone(&self) -> SparseTensorIndexCOO<'a>
[src]Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]Performs copy-assignment from source
. Read more
impl Debug for SparseTensorIndexCOO<'_>
[src]
impl Debug for SparseTensorIndexCOO<'_>
[src]impl<'a> Follow<'a> for SparseTensorIndexCOO<'a>
[src]
impl<'a> Follow<'a> for SparseTensorIndexCOO<'a>
[src]impl<'a> PartialEq<SparseTensorIndexCOO<'a>> for SparseTensorIndexCOO<'a>
[src]
impl<'a> PartialEq<SparseTensorIndexCOO<'a>> for SparseTensorIndexCOO<'a>
[src]fn eq(&self, other: &SparseTensorIndexCOO<'a>) -> bool
[src]
fn eq(&self, other: &SparseTensorIndexCOO<'a>) -> bool
[src]This method tests for self
and other
values to be equal, and is used
by ==
. Read more
fn ne(&self, other: &SparseTensorIndexCOO<'a>) -> bool
[src]
fn ne(&self, other: &SparseTensorIndexCOO<'a>) -> bool
[src]This method tests for !=
.
impl Verifiable for SparseTensorIndexCOO<'_>
[src]
impl Verifiable for SparseTensorIndexCOO<'_>
[src]fn run_verifier(
v: &mut Verifier<'_, '_>,
pos: usize
) -> Result<(), InvalidFlatbuffer>
[src]
fn run_verifier(
v: &mut Verifier<'_, '_>,
pos: usize
) -> Result<(), InvalidFlatbuffer>
[src]Runs the verifier for this type, assuming its at position pos
in the verifier’s buffer.
Should not need to be called directly. Read more
impl<'a> Copy for SparseTensorIndexCOO<'a>
[src]
impl<'a> StructuralPartialEq for SparseTensorIndexCOO<'a>
[src]
Auto Trait Implementations
impl<'a> RefUnwindSafe for SparseTensorIndexCOO<'a>
impl<'a> Send for SparseTensorIndexCOO<'a>
impl<'a> Sync for SparseTensorIndexCOO<'a>
impl<'a> Unpin for SparseTensorIndexCOO<'a>
impl<'a> UnwindSafe for SparseTensorIndexCOO<'a>
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,