Struct ndarray::ArrayBase [−][src]
pub struct ArrayBase<S, D> where
S: Data, { /* fields omitted */ }
Expand description
An n-dimensional array.
The array is a general container of elements. It cannot grow or shrink, but can be sliced into subsets of its data. The array supports arithmetic operations by applying them elementwise.
In n-dimensional we include for example 1-dimensional rows or columns, 2-dimensional matrices, and higher dimensional arrays. If the array has n dimensions, then an element is accessed by using that many indices.
The ArrayBase<S, D>
is parameterized by S
for the data container and
D
for the dimensionality.
Type aliases Array
, RcArray
, ArrayView
, and ArrayViewMut
refer
to ArrayBase
with different types for the data container.
Contents
- Array
- RcArray
- Array Views
- Indexing and Dimension
- Loops, Producers and Iterators
- Slicing
- Subviews
- Arithmetic Operations
- Broadcasting
- Constructor Methods for Owned Arrays
- Methods For All Array Types
Array
Array
is an owned array that ows the underlying array
elements directly (just like a Vec
) and it is the default way to create and
store n-dimensional data. Array<A, D>
has two type parameters: A
for
the element type, and D
for the dimensionality. A particular
dimensionality’s type alias like Array3<A>
just has the type parameter
A
for element type.
An example:
// Create a three-dimensional f64 array, initialized with zeros use ndarray::Array3; let mut temperature = Array3::<f64>::zeros((3, 4, 5)); // Increase the temperature in this location temperature[[2, 2, 2]] += 0.5;
RcArray
RcArray
is an owned array with reference counted
data (shared ownership).
Sharing requires that it uses copy-on-write for mutable operations.
Calling a method for mutating elements on RcArray
, for example
view_mut()
or get_mut()
,
will break sharing and require a clone of the data (if it is not uniquely held).
Array Views
ArrayView
and ArrayViewMut
are read-only and read-write array views
respectively. They use dimensionality, indexing, and almost all other
methods the same was as the other array types.
Methods for ArrayBase
apply to array views too, when the trait bounds
allow.
Please see the documentation for the respective array view for an overview
of methods specific to array views: ArrayView
, ArrayViewMut
.
A view is created from an array using .view()
, .view_mut()
, using
slicing (.slice()
, .slice_mut()
) or from one of the many iterators
that yield array views.
You can also create an array view from a regular slice of data not
allocated with Array
— see array view methods or their From
impls.
Note that all ArrayBase
variants can change their view (slicing) of the
data freely, even when their data can’t be mutated.
Indexing and Dimension
The dimensionality of the array determines the number of axes, for example a 2D array has two axes. These are listed in “big endian” order, so that the greatest dimension is listed first, the lowest dimension with the most rapidly varying index is the last.
In a 2D array the index of each element is [row, column]
as seen in this
4 × 3 example:
[[ [0, 0], [0, 1], [0, 2] ], // row 0 [ [1, 0], [1, 1], [1, 2] ], // row 1 [ [2, 0], [2, 1], [2, 2] ], // row 2 [ [3, 0], [3, 1], [3, 2] ]] // row 3 // \ \ \ // column 0 \ column 2 // column 1
The number of axes for an array is fixed by its D
type parameter: Ix1
for a 1D array, Ix2
for a 2D array etc. The dimension type IxDyn
allows
a dynamic number of axes.
A fixed size array ([usize; N]
) of the corresponding dimensionality is
used to index the Array
, making the syntax array[[
i, j, …]]
use ndarray::Array2; let mut array = Array2::zeros((4, 3)); array[[1, 1]] = 7;
Important traits and types for dimension and indexing:
- A
Dim
value represents a dimensionality or index. - Trait
Dimension
is implemented by all dimensionalities. It defines many operations for dimensions and indices. - Trait
IntoDimension
is used to convert into aDim
value. - Trait
ShapeBuilder
is an extension ofIntoDimension
and is used when constructing an array. A shape describes not just the extent of each axis but also their strides. - Trait
NdIndex
is an extension ofDimension
and is for values that can be used with indexing syntax.
The default memory order of an array is row major order (a.k.a “c” order), where each row is contiguous in memory. A column major (a.k.a. “f” or fortran) memory order array has columns (or, in general, the outermost axis) with contiguous elements.
The logical order of any array’s elements is the row major order
(the rightmost index is varying the fastest).
The iterators .iter(), .iter_mut()
always adhere to this order, for example.
Loops, Producers and Iterators
Using Zip
is the most general way to apply a procedure
across one or several arrays or producers.
NdProducer
is like an iterable but for
multidimensional data. All producers have dimensions and axes, like an
array view, and they can be split and used with parallelization using Zip
.
For example, ArrayView<A, D>
is a producer, it has the same dimensions
as the array view and for each iteration it produces a reference to
the array element (&A
in this case).
Another example, if we have a 10 × 10 array and use .exact_chunks((2, 2))
we get a producer of chunks which has the dimensions 5 × 5 (because
there are 10 / 2 = 5 chunks in either direction). The 5 × 5 chunks producer
can be paired with any other producers of the same dimension with Zip
, for
example 5 × 5 arrays.
.iter()
and .iter_mut()
These are the element iterators of arrays and they produce an element sequence in the logical order of the array, that means that the elements will be visited in the sequence that corresponds to increasing the last index first: 0, …, 0, 0; 0, …, 0, 1; 0, …0, 2 and so on.
.outer_iter()
and .axis_iter()
These iterators produce array views of one smaller dimension.
For example, for a 2D array, .outer_iter()
will produce the 1D rows.
For a 3D array, .outer_iter()
produces 2D subviews.
.axis_iter()
is like outer_iter()
but allows you to pick which
axis to traverse.
The outer_iter
and axis_iter
are one dimensional producers.
.genrows()
, .gencolumns()
and .lanes()
.genrows()
is a producer (and iterable) of all rows in an array.
use ndarray::Array; // 1. Loop over the rows of a 2D array let mut a = Array::zeros((10, 10)); for mut row in a.genrows_mut() { row.fill(1.); } // 2. Use Zip to pair each row in 2D `a` with elements in 1D `b` use ndarray::Zip; let mut b = Array::zeros(a.rows()); Zip::from(a.genrows()) .and(&mut b) .apply(|a_row, b_elt| { *b_elt = a_row[a.cols() - 1] - a_row[0]; });
The lanes of an array are 1D segments along an axis and when pointed along the last axis they are rows, when pointed along the first axis they are columns.
A m × n array has m rows each of length n and conversely n columns each of length m.
To generalize this, we say that an array of dimension a × m × n has a m rows. It’s composed of a times the previous array, so it has a times as many rows.
All methods: .genrows()
, .genrows_mut()
,
.gencolumns()
, .gencolumns_mut()
,
.lanes(axis)
, .lanes_mut(axis)
.
Yes, for 2D arrays .genrows()
and .outer_iter()
have about the same
effect:
genrows()
is a producer with n - 1 dimensions of 1 dimensional itemsouter_iter()
is a producer with 1 dimension of n - 1 dimensional items
Slicing
You can use slicing to create a view of a subset of the data in
the array. Slicing methods include .slice()
, .islice()
,
.slice_mut()
.
The slicing argument can be passed using the macro s![]
,
which will be used in all examples. (The explicit form is a reference
to a fixed size array of Si
; see its docs for more information.)
// import the s![] macro #[macro_use(s)] extern crate ndarray; use ndarray::arr3; fn main() { // 2 submatrices of 2 rows with 3 elements per row, means a shape of `[2, 2, 3]`. let a = arr3(&[[[ 1, 2, 3], // -- 2 rows \_ [ 4, 5, 6]], // -- / [[ 7, 8, 9], // \_ 2 submatrices [10, 11, 12]]]); // / // 3 columns ..../.../.../ assert_eq!(a.shape(), &[2, 2, 3]); // Let’s create a slice with // // - Both of the submatrices of the greatest dimension: `..` // - Only the first row in each submatrix: `0..1` // - Every element in each row: `..` let b = a.slice(s![.., 0..1, ..]); // without the macro, the explicit argument is `&[S, Si(0, Some(1), 1), S]` let c = arr3(&[[[ 1, 2, 3]], [[ 7, 8, 9]]]); assert_eq!(b, c); assert_eq!(b.shape(), &[2, 1, 3]); // Let’s create a slice with // // - Both submatrices of the greatest dimension: `..` // - The last row in each submatrix: `-1..` // - Row elements in reverse order: `..;-1` let d = a.slice(s![.., -1.., ..;-1]); let e = arr3(&[[[ 6, 5, 4]], [[12, 11, 10]]]); assert_eq!(d, e); }
Subviews
Subview methods allow you to restrict the array view while removing
one axis from the array. Subview methods include .subview()
,
.isubview()
, .subview_mut()
.
Subview takes two arguments: axis
and index
.
use ndarray::{arr3, aview2, Axis}; // 2 submatrices of 2 rows with 3 elements per row, means a shape of `[2, 2, 3]`. let a = arr3(&[[[ 1, 2, 3], // \ axis 0, submatrix 0 [ 4, 5, 6]], // / [[ 7, 8, 9], // \ axis 0, submatrix 1 [10, 11, 12]]]); // / // \ // axis 2, column 0 assert_eq!(a.shape(), &[2, 2, 3]); // Let’s take a subview along the greatest dimension (axis 0), // taking submatrix 0, then submatrix 1 let sub_0 = a.subview(Axis(0), 0); let sub_1 = a.subview(Axis(0), 1); assert_eq!(sub_0, aview2(&[[ 1, 2, 3], [ 4, 5, 6]])); assert_eq!(sub_1, aview2(&[[ 7, 8, 9], [10, 11, 12]])); assert_eq!(sub_0.shape(), &[2, 3]); // This is the subview picking only axis 2, column 0 let sub_col = a.subview(Axis(2), 0); assert_eq!(sub_col, aview2(&[[ 1, 4], [ 7, 10]]));
.isubview()
modifies the view in the same way as subview()
, but
since it is in place, it cannot remove the collapsed axis. It becomes
an axis of length 1.
.outer_iter()
is an iterator of every subview along the zeroth (outer)
axis, while .axis_iter()
is an iterator of every subview along a
specific axis.
Arithmetic Operations
Arrays support all arithmetic operations the same way: they apply elementwise.
Since the trait implementations are hard to overview, here is a summary.
Binary Operators with Two Arrays
Let A
be an array or view of any kind. Let B
be an array
with owned storage (either Array
or RcArray
).
Let C
be an array with mutable data (either Array
, RcArray
or ArrayViewMut
).
The following combinations of operands
are supported for an arbitrary binary operator denoted by @
(it can be
+
, -
, *
, /
and so on).
&A @ &A
which produces a newArray
B @ A
which consumesB
, updates it with the result, and returns itB @ &A
which consumesB
, updates it with the result, and returns itC @= &A
which performs an arithmetic operation in place
Binary Operators with Array and Scalar
The trait ScalarOperand
marks types that can be used in arithmetic
with arrays directly. For a scalar K
the following combinations of operands
are supported (scalar can be on either the left or right side, but
ScalarOperand
docs has the detailed condtions).
&A @ K
orK @ &A
which produces a newArray
B @ K
orK @ B
which consumesB
, updates it with the result and returns itC @= K
which performs an arithmetic operation in place
Unary Operators
Let A
be an array or view of any kind. Let B
be an array with owned
storage (either Array
or RcArray
). The following operands are supported
for an arbitrary unary operator denoted by @
(it can be -
or !
).
@&A
which produces a newArray
@B
which consumesB
, updates it with the result, and returns it
Broadcasting
Arrays support limited broadcasting, where arithmetic operations with
array operands of different sizes can be carried out by repeating the
elements of the smaller dimension array. See
.broadcast()
for a more detailed
description.
use ndarray::arr2; let a = arr2(&[[1., 1.], [1., 2.], [0., 3.], [0., 4.]]); let b = arr2(&[[0., 1.]]); let c = arr2(&[[1., 2.], [1., 3.], [0., 4.], [0., 5.]]); // We can add because the shapes are compatible even if not equal. // The `b` array is shape 1 × 2 but acts like a 4 × 2 array. assert!( c == a + b );
Implementations
Constructor Methods for Owned Arrays
Note that the constructor methods apply to Array
and RcArray
,
the two array types that have owned storage.
Constructor methods for one-dimensional arrays.
Create a one-dimensional array from a vector (no copying needed).
use ndarray::Array; let array = Array::from_vec(vec![1., 2., 3., 4.]);
Create a one-dimensional array from an iterable.
use ndarray::{Array, arr1}; let array = Array::from_iter((0..5).map(|x| x * x)); assert!(array == arr1(&[0, 1, 4, 9, 16]))
Create a one-dimensional array from the inclusive interval
[start, end]
with n
elements. A
must be a floating point type.
use ndarray::{Array, arr1}; let array = Array::linspace(0., 1., 5); assert!(array == arr1(&[0.0, 0.25, 0.5, 0.75, 1.0]))
Create a one-dimensional array from the half-open interval
[start, end)
with elements spaced by step
. A
must be a floating
point type.
use ndarray::{Array, arr1}; let array = Array::range(0., 5., 1.); assert!(array == arr1(&[0., 1., 2., 3., 4.]))
Constructor methods for n-dimensional arrays.
The shape
argument can be an integer or a tuple of integers to specify
a static size. For example 10
makes a length 10 one-dimensional array
(dimension type Ix1
) and (5, 6)
a 5 × 6 array (dimension type Ix2
).
With the trait ShapeBuilder
in scope, there is the method .f()
to select
column major (“f” order) memory layout instead of the default row major.
For example Array::zeros((5, 6).f())
makes a column major 5 × 6 array.
Use IxDyn
for the shape to create an array with dynamic
number of axes.
Finally, the few constructors that take a completely general
Into<StrideShape>
argument optionally support custom strides, for
example a shape given like (10, 2, 2).strides((1, 10, 20))
is valid.
Create an array with copies of elem
, shape shape
.
Panics if the number of elements in shape
would overflow usize.
use ndarray::{Array, arr3, ShapeBuilder}; let a = Array::from_elem((2, 2, 2), 1.); assert!( a == arr3(&[[[1., 1.], [1., 1.]], [[1., 1.], [1., 1.]]]) ); assert!(a.strides() == &[4, 2, 1]); let b = Array::from_elem((2, 2, 2).f(), 1.); assert!(b.strides() == &[1, 2, 4]);
Create an array with zeros, shape shape
.
Panics if the number of elements in shape
would overflow usize.
Create an array with default values, shape shape
Panics if the number of elements in shape
would overflow usize.
pub fn from_shape_fn<Sh, F>(shape: Sh, f: F) -> Self where
Sh: ShapeBuilder<Dim = D>,
F: FnMut(D::Pattern) -> A,
[src]
pub fn from_shape_fn<Sh, F>(shape: Sh, f: F) -> Self where
Sh: ShapeBuilder<Dim = D>,
F: FnMut(D::Pattern) -> A,
[src]Create an array with values created by the function f
.
f
is called with the index of the element to create; the elements are
visited in arbitirary order.
Panics if the number of elements in shape
would overflow usize.
pub fn from_shape_vec<Sh>(shape: Sh, v: Vec<A>) -> Result<Self, ShapeError> where
Sh: Into<StrideShape<D>>,
[src]
pub fn from_shape_vec<Sh>(shape: Sh, v: Vec<A>) -> Result<Self, ShapeError> where
Sh: Into<StrideShape<D>>,
[src]Create an array with the given shape from a vector. (No cloning of elements needed.)
For a contiguous c- or f-order shape, the following applies:
Errors if shape
does not correspond to the number of elements in v
.
For custom strides, the following applies:
Errors if strides and dimensions can point out of bounds of v
.
Errors if strides allow multiple indices to point to the same element.
use ndarray::Array; use ndarray::ShapeBuilder; // Needed for .strides() method use ndarray::arr2; let a = Array::from_shape_vec((2, 2), vec![1., 2., 3., 4.]); assert!(a.is_ok()); let b = Array::from_shape_vec((2, 2).strides((1, 2)), vec![1., 2., 3., 4.]).unwrap(); assert!( b == arr2(&[[1., 3.], [2., 4.]]) );
pub unsafe fn from_shape_vec_unchecked<Sh>(shape: Sh, v: Vec<A>) -> Self where
Sh: Into<StrideShape<D>>,
[src]
pub unsafe fn from_shape_vec_unchecked<Sh>(shape: Sh, v: Vec<A>) -> Self where
Sh: Into<StrideShape<D>>,
[src]Create an array from a vector and interpret it according to the provided dimensions and strides. (No cloning of elements needed.)
Unsafe because dimension and strides are unchecked.
Create an array with uninitalized elements, shape shape
.
Panics if the number of elements in shape
would overflow usize.
Safety
Accessing uninitalized values is undefined behaviour. You must
overwrite all the elements in the array after it is created; for
example using the methods .fill()
or .assign()
.
The contents of the array is indeterminate before initialization and it
is an error to perform operations that use the previous values. For
example it would not be legal to use a += 1.;
on such an array.
This constructor is limited to elements where A: Copy
(no destructors)
to avoid users shooting themselves too hard in the foot; it is not
a problem to drop an array created with this method even before elements
are initialized. (Note that constructors from_shape_vec
and
from_shape_vec_unchecked
allow the user yet more control).
Examples
#[macro_use(s)] extern crate ndarray; use ndarray::Array2; // Example Task: Let's create a column shifted copy of a in b fn shift_by_two(a: &Array2<f32>) -> Array2<f32> { let mut b = unsafe { Array2::uninitialized(a.dim()) }; // two first columns in b are two last in a // rest of columns in b are the initial columns in a b.slice_mut(s![.., ..2]).assign(&a.slice(s![.., -2..])); b.slice_mut(s![.., 2..]).assign(&a.slice(s![.., ..-2])); // `b` is safe to use with all operations at this point b }
Return the length of axis
.
The axis should be in the range Axis(
0 .. n )
where n is the
number of dimensions (axes) of the array.
Panics if the axis is out of bounds.
Return the shape of the array in its “pattern” form, an integer in the one-dimensional case, tuple in the n-dimensional cases and so on.
Return a read-write view of the array
Return an uniquely owned copy of the array
Return a shared ownership (copy on write) array.
Turn the array into a uniquely owned array, cloning the array elements to unshare them if necessary.
Turn the array into a shared ownership (copy on write) array, without any copying.
Return an iterator of references to the elements of the array.
Elements are visited in the logical order of the array, which is where the rightmost index is varying the fastest.
Iterator element type is &A
.
Return an iterator of mutable references to the elements of the array.
Elements are visited in the logical order of the array, which is where the rightmost index is varying the fastest.
Iterator element type is &mut A
.
pub fn indexed_iter(&self) -> IndexedIter<'_, A, D>ⓘNotable traits for IndexedIter<'a, A, D>impl<'a, A, D: Dimension> Iterator for IndexedIter<'a, A, D> type Item = (D::Pattern, &'a A);
[src]
pub fn indexed_iter(&self) -> IndexedIter<'_, A, D>ⓘNotable traits for IndexedIter<'a, A, D>impl<'a, A, D: Dimension> Iterator for IndexedIter<'a, A, D> type Item = (D::Pattern, &'a A);
[src]impl<'a, A, D: Dimension> Iterator for IndexedIter<'a, A, D> type Item = (D::Pattern, &'a A);
Return an iterator of indexes and references to the elements of the array.
Elements are visited in the logical order of the array, which is where the rightmost index is varying the fastest.
Iterator element type is (D::Pattern, &A)
.
See also Zip::indexed
pub fn indexed_iter_mut(&mut self) -> IndexedIterMut<'_, A, D>ⓘNotable traits for IndexedIterMut<'a, A, D>impl<'a, A, D: Dimension> Iterator for IndexedIterMut<'a, A, D> type Item = (D::Pattern, &'a mut A);
where
S: DataMut,
[src]
pub fn indexed_iter_mut(&mut self) -> IndexedIterMut<'_, A, D>ⓘNotable traits for IndexedIterMut<'a, A, D>impl<'a, A, D: Dimension> Iterator for IndexedIterMut<'a, A, D> type Item = (D::Pattern, &'a mut A);
where
S: DataMut,
[src]impl<'a, A, D: Dimension> Iterator for IndexedIterMut<'a, A, D> type Item = (D::Pattern, &'a mut A);
Return an iterator of indexes and mutable references to the elements of the array.
Elements are visited in the logical order of the array, which is where the rightmost index is varying the fastest.
Iterator element type is (D::Pattern, &mut A)
.
Return a sliced array.
See Slicing for full documentation.
See also D::SliceArg
.
Panics if an index is out of bounds or stride is zero.
(Panics if D
is IxDyn
and indexes
does not match the number of array axes.)
pub fn slice_mut(&mut self, indexes: &D::SliceArg) -> ArrayViewMut<'_, A, D> where
S: DataMut,
[src]
pub fn slice_mut(&mut self, indexes: &D::SliceArg) -> ArrayViewMut<'_, A, D> where
S: DataMut,
[src]Return a sliced read-write view of the array.
See also D::SliceArg
.
Panics if an index is out of bounds or stride is zero.
(Panics if D
is IxDyn
and indexes
does not match the number of array axes.)
Slice the array’s view in place.
See also D::SliceArg
.
Panics if an index is out of bounds or stride is zero.
(Panics if D
is IxDyn
and indexes
does not match the number of array axes.)
Return a reference to the element at index
, or return None
if the index is out of bounds.
Arrays also support indexing syntax: array[index]
.
use ndarray::arr2; let a = arr2(&[[1., 2.], [3., 4.]]); assert!( a.get((0, 1)) == Some(&2.) && a.get((0, 2)) == None && a[(0, 1)] == 2. && a[[0, 1]] == 2. );
Return a mutable reference to the element at index
, or return None
if the index is out of bounds.
Perform unchecked array indexing.
Return a reference to the element at index
.
Note: only unchecked for non-debug builds of ndarray.
Perform unchecked array indexing.
Return a mutable reference to the element at index
.
Note: Only unchecked for non-debug builds of ndarray.
Note: (For RcArray
) The array must be uniquely held when mutating it.
Swap elements at indices index1
and index2
.
Indices may be equal.
Panics if an index is out of bounds.
Swap elements unchecked at indices index1
and index2
.
Indices may be equal.
Note: only unchecked for non-debug builds of ndarray.
Note: (For RcArray
) The array must be uniquely held.
Along axis
, select the subview index
and return a
view with that axis removed.
See Subviews for full documentation.
Panics if axis
or index
is out of bounds.
use ndarray::{arr2, ArrayView, Axis}; let a = arr2(&[[1., 2. ], // ... axis 0, row 0 [3., 4. ], // --- axis 0, row 1 [5., 6. ]]); // ... axis 0, row 2 // . \ // . axis 1, column 1 // axis 1, column 0 assert!( a.subview(Axis(0), 1) == ArrayView::from(&[3., 4.]) && a.subview(Axis(1), 1) == ArrayView::from(&[2., 4., 6.]) );
pub fn subview_mut(
&mut self,
axis: Axis,
index: Ix
) -> ArrayViewMut<'_, A, D::Smaller> where
S: DataMut,
D: RemoveAxis,
[src]
pub fn subview_mut(
&mut self,
axis: Axis,
index: Ix
) -> ArrayViewMut<'_, A, D::Smaller> where
S: DataMut,
D: RemoveAxis,
[src]Along axis
, select the subview index
and return a read-write view
with the axis removed.
Panics if axis
or index
is out of bounds.
use ndarray::{arr2, aview2, Axis}; let mut a = arr2(&[[1., 2. ], [3., 4. ]]); // . \ // . axis 1, column 1 // axis 1, column 0 { let mut column1 = a.subview_mut(Axis(1), 1); column1 += 10.; } assert!( a == aview2(&[[1., 12.], [3., 14.]]) );
Collapse dimension axis
into length one,
and select the subview of index
along that axis.
Panics if index
is past the length of the axis.
pub fn into_subview(self, axis: Axis, index: Ix) -> ArrayBase<S, D::Smaller> where
D: RemoveAxis,
[src]
pub fn into_subview(self, axis: Axis, index: Ix) -> ArrayBase<S, D::Smaller> where
D: RemoveAxis,
[src]Along axis
, select the subview index
and return self
with that axis removed.
See .subview()
and Subviews for full documentation.
Along axis
, select arbitrary subviews corresponding to indices
and and copy them into a new array.
Panics if axis
or an element of indices
is out of bounds.
use ndarray::{arr2, Axis}; let x = arr2(&[[0., 1.], [2., 3.], [4., 5.], [6., 7.], [8., 9.]]); let r = x.select(Axis(0), &[0, 4, 3]); assert!( r == arr2(&[[0., 1.], [8., 9.], [6., 7.]]) );
Return a producer and iterable that traverses over the generalized rows of the array. For a 2D array these are the regular rows.
This is equivalent to .lanes(Axis(n - 1))
where n is self.ndim()
.
For an array of dimensions a × b × c × … × l × m it has a × b × c × … × l rows each of length m.
For example, in a 2 × 2 × 3 array, each row is 3 elements long and there are 2 × 2 = 4 rows in total.
Iterator element is ArrayView1<A>
(1D array view).
use ndarray::{arr3, Axis, arr1}; let a = arr3(&[[[ 0, 1, 2], // -- row 0, 0 [ 3, 4, 5]], // -- row 0, 1 [[ 6, 7, 8], // -- row 1, 0 [ 9, 10, 11]]]); // -- row 1, 1 // `genrows` will yield the four generalized rows of the array. for row in a.genrows() { /* loop body */ }
Return a producer and iterable that traverses over the generalized rows of the array and yields mutable array views.
Iterator element is ArrayView1<A>
(1D read-write array view).
Return a producer and iterable that traverses over the generalized columns of the array. For a 2D array these are the regular columns.
This is equivalent to .lanes(Axis(0))
.
For an array of dimensions a × b × c × … × l × m it has b × c × … × l × m columns each of length a.
For example, in a 2 × 2 × 3 array, each column is 2 elements long and there are 2 × 3 = 6 columns in total.
Iterator element is ArrayView1<A>
(1D array view).
use ndarray::{arr3, Axis, arr1}; // The generalized columns of a 3D array: // are directed along the 0th axis: 0 and 6, 1 and 7 and so on... let a = arr3(&[[[ 0, 1, 2], [ 3, 4, 5]], [[ 6, 7, 8], [ 9, 10, 11]]]); // Here `gencolumns` will yield the six generalized columns of the array. for row in a.gencolumns() { /* loop body */ }
Return a producer and iterable that traverses over the generalized columns of the array and yields mutable array views.
Iterator element is ArrayView1<A>
(1D read-write array view).
Return a producer and iterable that traverses over all 1D lanes
pointing in the direction of axis
.
When the pointing in the direction of the first axis, they are columns, in the direction of the last axis rows; in general they are all lanes and are one dimensional.
Iterator element is ArrayView1<A>
(1D array view).
use ndarray::{arr3, aview1, Axis}; let a = arr3(&[[[ 0, 1, 2], [ 3, 4, 5]], [[ 6, 7, 8], [ 9, 10, 11]]]); let inner0 = a.lanes(Axis(0)); let inner1 = a.lanes(Axis(1)); let inner2 = a.lanes(Axis(2)); // The first lane for axis 0 is [0, 6] assert_eq!(inner0.into_iter().next().unwrap(), aview1(&[0, 6])); // The first lane for axis 1 is [0, 3] assert_eq!(inner1.into_iter().next().unwrap(), aview1(&[0, 3])); // The first lane for axis 2 is [0, 1, 2] assert_eq!(inner2.into_iter().next().unwrap(), aview1(&[0, 1, 2]));
Return a producer and iterable that traverses over all 1D lanes
pointing in the direction of axis
.
Iterator element is ArrayViewMut1<A>
(1D read-write array view).
Return an iterator that traverses over the outermost dimension and yields each subview.
This is equivalent to .axis_iter(Axis(0))
.
Iterator element is ArrayView<A, D::Smaller>
(read-only array view).
pub fn outer_iter_mut(&mut self) -> AxisIterMut<'_, A, D::Smaller>ⓘNotable traits for AxisIterMut<'a, A, D>impl<'a, A, D> Iterator for AxisIterMut<'a, A, D> where
D: Dimension, type Item = ArrayViewMut<'a, A, D>;
where
S: DataMut,
D: RemoveAxis,
[src]
pub fn outer_iter_mut(&mut self) -> AxisIterMut<'_, A, D::Smaller>ⓘNotable traits for AxisIterMut<'a, A, D>impl<'a, A, D> Iterator for AxisIterMut<'a, A, D> where
D: Dimension, type Item = ArrayViewMut<'a, A, D>;
where
S: DataMut,
D: RemoveAxis,
[src]impl<'a, A, D> Iterator for AxisIterMut<'a, A, D> where
D: Dimension, type Item = ArrayViewMut<'a, A, D>;
Return an iterator that traverses over the outermost dimension and yields each subview.
This is equivalent to .axis_iter_mut(Axis(0))
.
Iterator element is ArrayViewMut<A, D::Smaller>
(read-write array view).
Return an iterator that traverses over axis
and yields each subview along it.
For example, in a 3 × 4 × 5 array, with axis
equal to Axis(2)
,
the iterator element
is a 3 × 4 subview (and there are 5 in total), as shown
in the picture below.
Iterator element is ArrayView<A, D::Smaller>
(read-only array view).
See Subviews for full documentation.
Panics if axis
is out of bounds.
pub fn axis_iter_mut(&mut self, axis: Axis) -> AxisIterMut<'_, A, D::Smaller>ⓘNotable traits for AxisIterMut<'a, A, D>impl<'a, A, D> Iterator for AxisIterMut<'a, A, D> where
D: Dimension, type Item = ArrayViewMut<'a, A, D>;
where
S: DataMut,
D: RemoveAxis,
[src]
pub fn axis_iter_mut(&mut self, axis: Axis) -> AxisIterMut<'_, A, D::Smaller>ⓘNotable traits for AxisIterMut<'a, A, D>impl<'a, A, D> Iterator for AxisIterMut<'a, A, D> where
D: Dimension, type Item = ArrayViewMut<'a, A, D>;
where
S: DataMut,
D: RemoveAxis,
[src]impl<'a, A, D> Iterator for AxisIterMut<'a, A, D> where
D: Dimension, type Item = ArrayViewMut<'a, A, D>;
Return an iterator that traverses over axis
and yields each mutable subview along it.
Iterator element is ArrayViewMut<A, D::Smaller>
(read-write array view).
Panics if axis
is out of bounds.
pub fn axis_chunks_iter(
&self,
axis: Axis,
size: usize
) -> AxisChunksIter<'_, A, D>ⓘNotable traits for AxisChunksIter<'a, A, D>impl<'a, A, D> Iterator for AxisChunksIter<'a, A, D> where
D: Dimension, type Item = ArrayView<'a, A, D>;
[src]
pub fn axis_chunks_iter(
&self,
axis: Axis,
size: usize
) -> AxisChunksIter<'_, A, D>ⓘNotable traits for AxisChunksIter<'a, A, D>impl<'a, A, D> Iterator for AxisChunksIter<'a, A, D> where
D: Dimension, type Item = ArrayView<'a, A, D>;
[src]impl<'a, A, D> Iterator for AxisChunksIter<'a, A, D> where
D: Dimension, type Item = ArrayView<'a, A, D>;
Return an iterator that traverses over axis
by chunks of size
,
yielding non-overlapping views along that axis.
Iterator element is ArrayView<A, D>
The last view may have less elements if size
does not divide
the axis’ dimension.
Panics if axis
is out of bounds.
use ndarray::Array; use ndarray::{arr3, Axis}; let a = Array::from_iter(0..28).into_shape((2, 7, 2)).unwrap(); let mut iter = a.axis_chunks_iter(Axis(1), 2); // first iteration yields a 2 × 2 × 2 view assert_eq!(iter.next().unwrap(), arr3(&[[[ 0, 1], [ 2, 3]], [[14, 15], [16, 17]]])); // however the last element is a 2 × 1 × 2 view since 7 % 2 == 1 assert_eq!(iter.next_back().unwrap(), arr3(&[[[12, 13]], [[26, 27]]]));
pub fn axis_chunks_iter_mut(
&mut self,
axis: Axis,
size: usize
) -> AxisChunksIterMut<'_, A, D>ⓘNotable traits for AxisChunksIterMut<'a, A, D>impl<'a, A, D> Iterator for AxisChunksIterMut<'a, A, D> where
D: Dimension, type Item = ArrayViewMut<'a, A, D>;
where
S: DataMut,
[src]
pub fn axis_chunks_iter_mut(
&mut self,
axis: Axis,
size: usize
) -> AxisChunksIterMut<'_, A, D>ⓘNotable traits for AxisChunksIterMut<'a, A, D>impl<'a, A, D> Iterator for AxisChunksIterMut<'a, A, D> where
D: Dimension, type Item = ArrayViewMut<'a, A, D>;
where
S: DataMut,
[src]impl<'a, A, D> Iterator for AxisChunksIterMut<'a, A, D> where
D: Dimension, type Item = ArrayViewMut<'a, A, D>;
Return an iterator that traverses over axis
by chunks of size
,
yielding non-overlapping read-write views along that axis.
Iterator element is ArrayViewMut<A, D>
Panics if axis
is out of bounds.
pub fn exact_chunks<E>(&self, chunk_size: E) -> ExactChunks<'_, A, D> where
E: IntoDimension<Dim = D>,
[src]
pub fn exact_chunks<E>(&self, chunk_size: E) -> ExactChunks<'_, A, D> where
E: IntoDimension<Dim = D>,
[src]Return an exact chunks producer (and iterable).
It produces the whole chunks of a given n-dimensional chunk size, skipping the remainder along each dimension that doesn’t fit evenly.
The produced element is a ArrayView<A, D>
with exactly the dimension
chunk_size
.
Panics if any dimension of chunk_size
is zero
(Panics if D
is IxDyn
and chunk_size
does not match the
number of array axes.)
pub fn exact_chunks_mut<E>(&mut self, chunk_size: E) -> ExactChunksMut<'_, A, D> where
E: IntoDimension<Dim = D>,
S: DataMut,
[src]
pub fn exact_chunks_mut<E>(&mut self, chunk_size: E) -> ExactChunksMut<'_, A, D> where
E: IntoDimension<Dim = D>,
S: DataMut,
[src]Return an exact chunks producer (and iterable).
It produces the whole chunks of a given n-dimensional chunk size, skipping the remainder along each dimension that doesn’t fit evenly.
The produced element is a ArrayViewMut<A, D>
with exactly
the dimension chunk_size
.
Panics if any dimension of chunk_size
is zero
(Panics if D
is IxDyn
and chunk_size
does not match the
number of array axes.)
use ndarray::Array; use ndarray::arr2; let mut a = Array::zeros((6, 7)); // Fill each 2 × 2 chunk with the index of where it appeared in iteration for (i, mut chunk) in a.exact_chunks_mut((2, 2)).into_iter().enumerate() { chunk.fill(i); } // The resulting array is: assert_eq!( a, arr2(&[[0, 0, 1, 1, 2, 2, 0], [0, 0, 1, 1, 2, 2, 0], [3, 3, 4, 4, 5, 5, 0], [3, 3, 4, 4, 5, 5, 0], [6, 6, 7, 7, 8, 8, 0], [6, 6, 7, 7, 8, 8, 0]]));
pub fn windows<E>(&self, window_size: E) -> Windows<'_, A, D> where
E: IntoDimension<Dim = D>,
[src]
pub fn windows<E>(&self, window_size: E) -> Windows<'_, A, D> where
E: IntoDimension<Dim = D>,
[src]Return a window producer and iterable.
The windows are all distinct overlapping views of size window_size
that fit into the array’s shape.
Will yield over no elements if window size is larger than the actual array size of any dimension.
The produced element is an ArrayView<A, D>
with exactly the dimension
window_size
.
Panics if any dimension of window_size
is zero.
(Panics if D
is IxDyn
and window_size
does not match the
number of array axes.)
Return an view of the diagonal elements of the array.
The diagonal is simply the sequence indexed by (0, 0, .., 0), (1, 1, …, 1) etc as long as all axes have elements.
Return a read-write view over the diagonal elements of the array.
Return true
if the array data is laid out in contiguous “C order” in
memory (where the last index is the most rapidly varying).
Return false
otherwise, i.e the array is possibly not
contiguous in memory, it has custom strides, etc.
Return a pointer to the first element in the array.
Raw access to array elements needs to follow the strided indexing scheme: an element at multi-index I in an array with strides S is located at offset
Σ0 ≤ k < d Ik × Sk
where d is self.ndim()
.
Return a mutable pointer to the first element in the array.
Return the array’s data as a slice, if it is contiguous and in standard order.
Return None
otherwise.
If this function returns Some(_)
, then the element order in the slice
corresponds to the logical order of the array’s elements.
Return the array’s data as a slice, if it is contiguous and in standard order.
Return None
otherwise.
Return the array’s data as a slice if it is contiguous,
return None
otherwise.
If this function returns Some(_)
, then the elements in the slice
have whatever order the elements have in memory.
Implementation notes: Does not yet support negatively strided arrays.
Return the array’s data as a slice if it is contiguous,
return None
otherwise.
pub fn into_shape<E>(self, shape: E) -> Result<ArrayBase<S, E::Dim>, ShapeError> where
E: IntoDimension,
[src]
pub fn into_shape<E>(self, shape: E) -> Result<ArrayBase<S, E::Dim>, ShapeError> where
E: IntoDimension,
[src]Transform the array into shape
; any shape with the same number of
elements is accepted, but the source array or view must be
contiguous, otherwise we cannot rearrange the dimension.
Errors if the shapes don’t have the same number of elements.
Errors if the input array is not c- or f-contiguous.
use ndarray::{aview1, aview2}; assert!( aview1(&[1., 2., 3., 4.]).into_shape((2, 2)).unwrap() == aview2(&[[1., 2.], [3., 4.]]) );
pub fn reshape<E>(&self, shape: E) -> ArrayBase<S, E::Dim> where
S: DataShared + DataOwned,
A: Clone,
E: IntoDimension,
[src]
pub fn reshape<E>(&self, shape: E) -> ArrayBase<S, E::Dim> where
S: DataShared + DataOwned,
A: Clone,
E: IntoDimension,
[src]Note: Reshape is for RcArray
only. Use .into_shape()
for
other arrays and array views.
Transform the array into shape
; any shape with the same number of
elements is accepted.
May clone all elements if needed to arrange elements in standard layout (and break sharing).
Panics if shapes are incompatible.
use ndarray::{rcarr1, rcarr2}; assert!( rcarr1(&[1., 2., 3., 4.]).reshape((2, 2)) == rcarr2(&[[1., 2.], [3., 4.]]) );
Convert any array or array view to a dynamic dimensional array or array view (respectively).
use ndarray::{arr2, ArrayD}; let array: ArrayD<i32> = arr2(&[[1, 2], [3, 4]]).into_dyn();
pub fn into_dimensionality<D2>(self) -> Result<ArrayBase<S, D2>, ShapeError> where
D2: Dimension,
[src]
pub fn into_dimensionality<D2>(self) -> Result<ArrayBase<S, D2>, ShapeError> where
D2: Dimension,
[src]Convert an array or array view to another with the same type, but different dimensionality type. Errors if the dimensions don’t agree.
use ndarray::{ArrayD, Ix2, IxDyn}; // Create a dynamic dimensionality array and convert it to an Array2 // (Ix2 dimension type). let array = ArrayD::<f64>::zeros(IxDyn(&[10, 10])); assert!(array.into_dimensionality::<Ix2>().is_ok());
Act like a larger size and/or shape array by broadcasting into a larger shape, if possible.
Return None
if shapes can not be broadcast together.
Background
- Two axes are compatible if they are equal, or one of them is 1.
- In this instance, only the axes of the smaller side (self) can be 1.
Compare axes beginning with the last axis of each shape.
For example (1, 2, 4) can be broadcast into (7, 6, 2, 4) because its axes are either equal or 1 (or missing); while (2, 2) can not be broadcast into (2, 4).
The implementation creates a view with strides set to zero for the axes that are to be repeated.
The broadcasting documentation for Numpy has more information.
use ndarray::{aview1, aview2}; assert!( aview1(&[1., 0.]).broadcast((10, 2)).unwrap() == aview2(&[[1., 0.]; 10]) );
Swap axes ax
and bx
.
This does not move any data, it just adjusts the array’s dimensions and strides.
Panics if the axes are out of bounds.
use ndarray::arr2; let mut a = arr2(&[[1., 2., 3.]]); a.swap_axes(0, 1); assert!( a == arr2(&[[1.], [2.], [3.]]) );
Transpose the array by reversing axes.
Transposition reverses the order of the axes (dimensions and strides) while retaining the same data.
Return a transposed view of the array.
This is a shorthand for self.view().reversed_axes()
.
See also the more general methods .reversed_axes()
and .swap_axes()
.
Return an iterator over the length and stride of each axis.
Return the axis with the greatest stride (by absolute value), preferring axes with len > 1.
Reverse the stride of axis
.
Panics if the axis is out of bounds.
If possible, merge in the axis take
to into
.
use ndarray::Array3; use ndarray::Axis; let mut a = Array3::<f64>::zeros((2, 3, 4)); a.merge_axes(Axis(1), Axis(2)); assert_eq!(a.shape(), &[2, 1, 12]);
Panics if an axis is out of bounds.
Insert new array axis at axis
and return the result.
use ndarray::{Array3, Axis, arr1, arr2}; // Convert a 1-D array into a row vector (2-D). let a = arr1(&[1, 2, 3]); let row = a.insert_axis(Axis(0)); assert_eq!(row, arr2(&[[1, 2, 3]])); // Convert a 1-D array into a column vector (2-D). let b = arr1(&[1, 2, 3]); let col = b.insert_axis(Axis(1)); assert_eq!(col, arr2(&[[1], [2], [3]])); // The new axis always has length 1. let b = Array3::<f64>::zeros((3, 4, 5)); assert_eq!(b.insert_axis(Axis(2)).shape(), &[3, 4, 1, 5]);
Panics if the axis is out of bounds.
Remove array axis axis
and return the result.
Perform an elementwise assigment to self
from rhs
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform an elementwise assigment to self
from element x
.
Traverse two arrays in unspecified order, in lock step,
calling the closure f
on each element pair.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Traverse the array elements and apply a fold, returning the resulting value.
Elements are visited in arbitrary order.
Call f
by reference on each element and create a new array
with the new values.
Elements are visited in arbitrary order.
Return an array with the same shape as self
.
use ndarray::arr2; let a = arr2(&[[ 0., 1.], [-1., 2.]]); assert!( a.map(|x| *x >= 1.0) == arr2(&[[false, true], [false, true]]) );
Call f
by value on each element and create a new array
with the new values.
Elements are visited in arbitrary order.
Return an array with the same shape as self
.
use ndarray::arr2; let a = arr2(&[[ 0., 1.], [-1., 2.]]); assert!( a.mapv(f32::abs) == arr2(&[[0., 1.], [1., 2.]]) );
Call f
by value on each element, update the array with the new values
and return it.
Elements are visited in arbitrary order.
Modify the array in place by calling f
by mutable reference on each element.
Elements are visited in arbitrary order.
Modify the array in place by calling f
by value on each element.
The array is updated with the new values.
Elements are visited in arbitrary order.
use ndarray::arr2; let mut a = arr2(&[[ 0., 1.], [-1., 2.]]); a.mapv_inplace(f32::exp); assert!( a.all_close(&arr2(&[[1.00000, 2.71828], [0.36788, 7.38906]]), 1e-5) );
Visit each element in the array by calling f
by reference
on each element.
Elements are visited in arbitrary order.
Fold along an axis.
Combine the elements of each subview with the previous using the fold
function and initial value init
.
Return the result as an Array
.
pub fn map_axis<'a, B, F>(
&'a self,
axis: Axis,
mapping: F
) -> Array<B, D::Smaller> where
D: RemoveAxis,
F: FnMut(ArrayView1<'a, A>) -> B,
A: 'a,
[src]
pub fn map_axis<'a, B, F>(
&'a self,
axis: Axis,
mapping: F
) -> Array<B, D::Smaller> where
D: RemoveAxis,
F: FnMut(ArrayView1<'a, A>) -> B,
A: 'a,
[src]Reduce the values along an axis into just one value, producing a new array with one less dimension.
Elements are visited in arbitrary order.
Return the result as an Array
.
Panics if axis
is out of bounds.
Methods specific to Array
.
See also all methods for ArrayBase
Return a vector of the elements in the array, in the way they are stored internally.
If the array is in standard memory layout, the logical element order
of the array (.iter()
order) and of the returned vector will be the same.
Return an array view of row index
.
Panics if index
is out of bounds.
Return a mutable array view of row index
.
Panics if index
is out of bounds.
Return the number of rows (length of Axis(0)
) in the two-dimensional array.
Return an array view of column index
.
Panics if index
is out of bounds.
Return a mutable array view of column index
.
Panics if index
is out of bounds.
Return the number of columns (length of Axis(1)
) in the two-dimensional array.
Numerical methods for arrays.
Return the sum of all elements in the array.
use ndarray::arr2; let a = arr2(&[[1., 2.], [3., 4.]]); assert_eq!(a.scalar_sum(), 10.);
Return sum along axis
.
use ndarray::{aview0, aview1, arr2, Axis}; let a = arr2(&[[1., 2.], [3., 4.]]); assert!( a.sum_axis(Axis(0)) == aview1(&[4., 6.]) && a.sum_axis(Axis(1)) == aview1(&[3., 7.]) && a.sum_axis(Axis(0)).sum_axis(Axis(0)) == aview0(&10.) );
Panics if axis
is out of bounds.
pub fn sum(&self, axis: Axis) -> Array<A, D::Smaller> where
A: Clone + Zero + Add<Output = A>,
D: RemoveAxis,
[src]👎 Deprecated: Use new name .sum_axis()
pub fn sum(&self, axis: Axis) -> Array<A, D::Smaller> where
A: Clone + Zero + Add<Output = A>,
D: RemoveAxis,
[src]Use new name .sum_axis()
Old name for sum_axis
.
pub fn mean_axis(&self, axis: Axis) -> Array<A, D::Smaller> where
A: LinalgScalar,
D: RemoveAxis,
[src]
pub fn mean_axis(&self, axis: Axis) -> Array<A, D::Smaller> where
A: LinalgScalar,
D: RemoveAxis,
[src]Return mean along axis
.
Panics if axis
is out of bounds.
use ndarray::{aview1, arr2, Axis}; let a = arr2(&[[1., 2.], [3., 4.]]); assert!( a.mean_axis(Axis(0)) == aview1(&[2.0, 3.0]) && a.mean_axis(Axis(1)) == aview1(&[1.5, 3.5]) );
👎 Deprecated: Use new name .mean_axis()
Use new name .mean_axis()
Old name for mean_axis
.
Return true
if the arrays’ elementwise differences are all within
the given absolute tolerance, false
otherwise.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting to the same shape isn’t possible.
Perform dot product or matrix multiplication of arrays self
and rhs
.
Rhs
may be either a one-dimensional or a two-dimensional array.
If Rhs
is one-dimensional, then the operation is a vector dot
product, which is the sum of the elementwise products (no conjugation
of complex operands, and thus not their inner product). In this case,
self
and rhs
must be the same length.
If Rhs
is two-dimensional, then the operation is matrix
multiplication, where self
is treated as a row vector. In this case,
if self
is shape M, then rhs
is shape M × N and the result is
shape N.
Panics if the array shapes are incompatible.
Note: If enabled, uses blas dot
for elements of f32, f64
when memory
layout allows.
Perform matrix multiplication of rectangular arrays self
and rhs
.
Rhs
may be either a one-dimensional or a two-dimensional array.
If Rhs is two-dimensional, they array shapes must agree in the way that
if self
is M × N, then rhs
is N × K.
Return a result array with shape M × K.
Panics if shapes are incompatible.
Note: If enabled, uses blas gemv/gemm
for elements of f32, f64
when memory layout allows. The default matrixmultiply backend
is otherwise used for f32, f64
for all memory layouts.
use ndarray::arr2; let a = arr2(&[[1., 2.], [0., 1.]]); let b = arr2(&[[1., 2.], [2., 3.]]); assert!( a.dot(&b) == arr2(&[[5., 8.], [2., 3.]]) );
pub fn scaled_add<S2, E>(&mut self, alpha: A, rhs: &ArrayBase<S2, E>) where
S: DataMut,
S2: Data<Elem = A>,
A: LinalgScalar,
E: Dimension,
[src]
pub fn scaled_add<S2, E>(&mut self, alpha: A, rhs: &ArrayBase<S2, E>) where
S: DataMut,
S2: Data<Elem = A>,
A: LinalgScalar,
E: Dimension,
[src]Perform the operation self += alpha * rhs
efficiently, where
alpha
is a scalar and rhs
is another array. This operation is
also known as axpy
in BLAS.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Methods for read-only array views.
pub fn from_shape<Sh>(shape: Sh, xs: &'a [A]) -> Result<Self, ShapeError> where
Sh: Into<StrideShape<D>>,
[src]
pub fn from_shape<Sh>(shape: Sh, xs: &'a [A]) -> Result<Self, ShapeError> where
Sh: Into<StrideShape<D>>,
[src]Create a read-only array view borrowing its data from a slice.
Checks whether shape
are compatible with the slice’s
length, returning an Err
if not compatible.
use ndarray::ArrayView; use ndarray::arr3; use ndarray::ShapeBuilder; let s = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]; let a = ArrayView::from_shape((2, 3, 2).strides((1, 4, 2)), &s).unwrap(); assert!( a == arr3(&[[[0, 2], [4, 6], [8, 10]], [[1, 3], [5, 7], [9, 11]]]) ); assert!(a.strides() == &[1, 4, 2]);
pub unsafe fn from_shape_ptr<Sh>(shape: Sh, ptr: *const A) -> Self where
Sh: Into<StrideShape<D>>,
[src]
pub unsafe fn from_shape_ptr<Sh>(shape: Sh, ptr: *const A) -> Self where
Sh: Into<StrideShape<D>>,
[src]Create an ArrayView<A, D>
from shape information and a
raw pointer to the elements.
Unsafe because caller is responsible for ensuring that the pointer is valid, not mutably aliased and coherent with the dimension and stride information.
Split the array view along axis
and return one view strictly before the
split and one view after the split.
Panics if axis
or index
is out of bounds.
Below, an illustration of .split_at(Axis(2), 2)
on
an array with shape 3 × 5 × 5.
Return the array’s data as a slice, if it is contiguous and in standard order.
Return None
otherwise.
Methods for read-write array views.
pub fn from_shape<Sh>(shape: Sh, xs: &'a mut [A]) -> Result<Self, ShapeError> where
Sh: Into<StrideShape<D>>,
[src]
pub fn from_shape<Sh>(shape: Sh, xs: &'a mut [A]) -> Result<Self, ShapeError> where
Sh: Into<StrideShape<D>>,
[src]Create a read-write array view borrowing its data from a slice.
Checks whether dim
and strides
are compatible with the slice’s
length, returning an Err
if not compatible.
use ndarray::ArrayViewMut; use ndarray::arr3; use ndarray::ShapeBuilder; let mut s = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]; let mut a = ArrayViewMut::from_shape((2, 3, 2).strides((1, 4, 2)), &mut s).unwrap(); a[[0, 0, 0]] = 1; assert!( a == arr3(&[[[1, 2], [4, 6], [8, 10]], [[1, 3], [5, 7], [9, 11]]]) ); assert!(a.strides() == &[1, 4, 2]);
pub unsafe fn from_shape_ptr<Sh>(shape: Sh, ptr: *mut A) -> Self where
Sh: Into<StrideShape<D>>,
[src]
pub unsafe fn from_shape_ptr<Sh>(shape: Sh, ptr: *mut A) -> Self where
Sh: Into<StrideShape<D>>,
[src]Create an ArrayViewMut<A, D>
from shape information and a
raw pointer to the elements.
Unsafe because caller is responsible for ensuring that the pointer is valid, not aliased and coherent with the dimension and stride information.
Split the array view along axis
and return one mutable view strictly
before the split and one mutable view after the split.
Panics if axis
or index
is out of bounds.
Return the array’s data as a slice, if it is contiguous and in standard order.
Return None
otherwise.
Trait Implementations
Perform elementwise
addition
between self
and reference rhs
,
and return the result (based on self
).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
addition
between references self
and rhs
,
and return the result as a new Array
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
addition
between self
and rhs
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
addition
between self
and the scalar x
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
Perform elementwise
addition
between the reference self
and the scalar x
,
and return the result as a new Array
.
Perform self += rhs
as elementwise addition (in place).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Performs the +=
operation. Read more
Format the array using Binary
and apply the formatting parameters used
to each element.
The array is shown in multiline style.
Perform elementwise
bit and
between self
and reference rhs
,
and return the result (based on self
).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
bit and
between references self
and rhs
,
and return the result as a new Array
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
bit and
between self
and rhs
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
bit and
between self
and the scalar x
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
Perform elementwise
bit and
between the reference self
and the scalar x
,
and return the result as a new Array
.
impl<'a, A, S, S2, D, E> BitAndAssign<&'a ArrayBase<S2, E>> for ArrayBase<S, D> where
A: Clone + BitAndAssign<A>,
S: DataMut<Elem = A>,
S2: Data<Elem = A>,
D: Dimension,
E: Dimension,
[src]
impl<'a, A, S, S2, D, E> BitAndAssign<&'a ArrayBase<S2, E>> for ArrayBase<S, D> where
A: Clone + BitAndAssign<A>,
S: DataMut<Elem = A>,
S2: Data<Elem = A>,
D: Dimension,
E: Dimension,
[src]Perform self &= rhs
as elementwise bit and (in place).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Performs the &=
operation. Read more
impl<A, S, D> BitAndAssign<A> for ArrayBase<S, D> where
A: ScalarOperand + BitAndAssign<A>,
S: DataMut<Elem = A>,
D: Dimension,
[src]
impl<A, S, D> BitAndAssign<A> for ArrayBase<S, D> where
A: ScalarOperand + BitAndAssign<A>,
S: DataMut<Elem = A>,
D: Dimension,
[src]Perform self &= rhs
as elementwise bit and (in place).
Performs the &=
operation. Read more
Perform elementwise
bit or
between self
and reference rhs
,
and return the result (based on self
).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
bit or
between references self
and rhs
,
and return the result as a new Array
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
bit or
between self
and rhs
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
bit or
between self
and the scalar x
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
Perform elementwise
bit or
between the reference self
and the scalar x
,
and return the result as a new Array
.
impl<'a, A, S, S2, D, E> BitOrAssign<&'a ArrayBase<S2, E>> for ArrayBase<S, D> where
A: Clone + BitOrAssign<A>,
S: DataMut<Elem = A>,
S2: Data<Elem = A>,
D: Dimension,
E: Dimension,
[src]
impl<'a, A, S, S2, D, E> BitOrAssign<&'a ArrayBase<S2, E>> for ArrayBase<S, D> where
A: Clone + BitOrAssign<A>,
S: DataMut<Elem = A>,
S2: Data<Elem = A>,
D: Dimension,
E: Dimension,
[src]Perform self |= rhs
as elementwise bit or (in place).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Performs the |=
operation. Read more
impl<A, S, D> BitOrAssign<A> for ArrayBase<S, D> where
A: ScalarOperand + BitOrAssign<A>,
S: DataMut<Elem = A>,
D: Dimension,
[src]
impl<A, S, D> BitOrAssign<A> for ArrayBase<S, D> where
A: ScalarOperand + BitOrAssign<A>,
S: DataMut<Elem = A>,
D: Dimension,
[src]Perform self |= rhs
as elementwise bit or (in place).
Performs the |=
operation. Read more
Perform elementwise
bit xor
between self
and reference rhs
,
and return the result (based on self
).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
bit xor
between references self
and rhs
,
and return the result as a new Array
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
bit xor
between self
and rhs
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
bit xor
between self
and the scalar x
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
Perform elementwise
bit xor
between the reference self
and the scalar x
,
and return the result as a new Array
.
impl<'a, A, S, S2, D, E> BitXorAssign<&'a ArrayBase<S2, E>> for ArrayBase<S, D> where
A: Clone + BitXorAssign<A>,
S: DataMut<Elem = A>,
S2: Data<Elem = A>,
D: Dimension,
E: Dimension,
[src]
impl<'a, A, S, S2, D, E> BitXorAssign<&'a ArrayBase<S2, E>> for ArrayBase<S, D> where
A: Clone + BitXorAssign<A>,
S: DataMut<Elem = A>,
S2: Data<Elem = A>,
D: Dimension,
E: Dimension,
[src]Perform self ^= rhs
as elementwise bit xor (in place).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Performs the ^=
operation. Read more
impl<A, S, D> BitXorAssign<A> for ArrayBase<S, D> where
A: ScalarOperand + BitXorAssign<A>,
S: DataMut<Elem = A>,
D: Dimension,
[src]
impl<A, S, D> BitXorAssign<A> for ArrayBase<S, D> where
A: ScalarOperand + BitXorAssign<A>,
S: DataMut<Elem = A>,
D: Dimension,
[src]Perform self ^= rhs
as elementwise bit xor (in place).
Performs the ^=
operation. Read more
Format the array using Debug
and apply the formatting parameters used
to each element.
The array is shown in multiline style.
Create an owned array with a default state.
The array is created with dimension D::default()
, which results
in for example dimensions 0
and (0, 0)
with zero elements for the
one-dimensional and two-dimensional cases respectively.
The default dimension for IxDyn
is IxDyn(&[0])
(array has zero
elements). And the default for the dimension ()
is ()
(array has
one element).
Since arrays cannot grow, the intention is to use the default value as placeholder.
Format the array using Display
and apply the formatting parameters used
to each element.
The array is shown in multiline style.
Perform elementwise
division
between self
and reference rhs
,
and return the result (based on self
).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
division
between references self
and rhs
,
and return the result as a new Array
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
division
between self
and rhs
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
division
between self
and the scalar x
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
Perform elementwise
division
between the reference self
and the scalar x
,
and return the result as a new Array
.
Perform self /= rhs
as elementwise division (in place).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Performs the /=
operation. Read more
Compute the dot product of one-dimensional arrays.
The dot product is a sum of the elementwise products (no conjugation of complex operands, and thus not their inner product).
Panics if the arrays are not of the same length.
Note: If enabled, uses blas dot
for elements of f32, f64
when memory
layout allows.
Perform the matrix multiplication of the rectangular array self
and
column vector rhs
.
The array shapes must agree in the way that
if self
is M × N, then rhs
is N.
Return a result array with shape M.
Panics if shapes are incompatible.
Perform the matrix multiplication of the row vector self
and
rectangular matrix rhs
.
The array shapes must agree in the way that
if self
is M, then rhs
is M × N.
Return a result array with shape N.
Panics if shapes are incompatible.
Implementation of ArrayView::from(&A)
where A
is an array.
Create a read-only array view of the array.
Implementation of ArrayViewMut::from(&mut A)
where A
is an array.
Create a read-write array view of the array.
Access the element at index.
Panics if index is out of bounds.
Access the element at index mutably.
Panics if index is out of bounds.
impl<'a, A: 'a, S, D> IntoNdProducer for &'a ArrayBase<S, D> where
D: Dimension,
S: Data<Elem = A>,
[src]
impl<'a, A: 'a, S, D> IntoNdProducer for &'a ArrayBase<S, D> where
D: Dimension,
S: Data<Elem = A>,
[src]An array reference is an n-dimensional producer of element references (like ArrayView).
impl<'a, A: 'a, S, D> IntoNdProducer for &'a mut ArrayBase<S, D> where
D: Dimension,
S: DataMut<Elem = A>,
[src]
impl<'a, A: 'a, S, D> IntoNdProducer for &'a mut ArrayBase<S, D> where
D: Dimension,
S: DataMut<Elem = A>,
[src]A mutable array reference is an n-dimensional producer of mutable element references (like ArrayViewMut).
type Dim = D
type Dim = D
Dimension type of the producer
type Output = ArrayViewMut<'a, A, D>
Convert the value into an NdProducer
.
Format the array using LowerExp
and apply the formatting parameters used
to each element.
The array is shown in multiline style.
Format the array using LowerHex
and apply the formatting parameters used
to each element.
The array is shown in multiline style.
Perform elementwise
multiplication
between self
and reference rhs
,
and return the result (based on self
).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
multiplication
between references self
and rhs
,
and return the result as a new Array
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
multiplication
between self
and rhs
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
multiplication
between self
and the scalar x
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
Perform elementwise
multiplication
between the reference self
and the scalar x
,
and return the result as a new Array
.
Perform self *= rhs
as elementwise multiplication (in place).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Performs the *=
operation. Read more
Return true
if the array shapes and all elements of self
and
rhs
are equal. Return false
otherwise.
Perform elementwise
remainder
between self
and reference rhs
,
and return the result (based on self
).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
remainder
between references self
and rhs
,
and return the result as a new Array
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
remainder
between self
and rhs
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
remainder
between self
and the scalar x
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
Perform elementwise
remainder
between the reference self
and the scalar x
,
and return the result as a new Array
.
Perform self %= rhs
as elementwise remainder (in place).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Performs the %=
operation. Read more
Perform elementwise
left shift
between self
and reference rhs
,
and return the result (based on self
).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
left shift
between references self
and rhs
,
and return the result as a new Array
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
left shift
between self
and rhs
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
left shift
between self
and the scalar x
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
Perform elementwise
left shift
between the reference self
and the scalar x
,
and return the result as a new Array
.
Perform self <<= rhs
as elementwise left shift (in place).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Performs the <<=
operation. Read more
Perform elementwise
right shift
between self
and reference rhs
,
and return the result (based on self
).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
right shift
between references self
and rhs
,
and return the result as a new Array
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
right shift
between self
and rhs
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
right shift
between self
and the scalar x
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
Perform elementwise
right shift
between the reference self
and the scalar x
,
and return the result as a new Array
.
Perform self >>= rhs
as elementwise right shift (in place).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Performs the >>=
operation. Read more
Perform elementwise
subtraction
between self
and reference rhs
,
and return the result (based on self
).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
subtraction
between references self
and rhs
,
and return the result as a new Array
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
subtraction
between self
and rhs
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Perform elementwise
subtraction
between self
and the scalar x
,
and return the result (based on self
).
self
must be an Array
or RcArray
.
Perform elementwise
subtraction
between the reference self
and the scalar x
,
and return the result as a new Array
.
Perform self -= rhs
as elementwise subtraction (in place).
If their shapes disagree, rhs
is broadcast to the shape of self
.
Panics if broadcasting isn’t possible.
Performs the -=
operation. Read more
Format the array using UpperExp
and apply the formatting parameters used
to each element.
The array is shown in multiline style.
ArrayBase
is Send
when the storage type is.
ArrayBase
is Sync
when the storage type is.
Auto Trait Implementations
impl<S, D> RefUnwindSafe for ArrayBase<S, D> where
D: RefUnwindSafe,
S: RefUnwindSafe,
<S as Data>::Elem: RefUnwindSafe,
impl<S, D> UnwindSafe for ArrayBase<S, D> where
D: UnwindSafe,
S: UnwindSafe,
<S as Data>::Elem: RefUnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more