ravel(array_like)
This docstring was copied from numpy.ravel.
Some inconsistencies with the Dask version may exist.
A 1-D array, containing the elements of the input, is returned. A copy is made only if needed.
As of NumPy 1.10, the returned array will have the same type as the input array. (for example, a masked array will be returned for a masked array input)
In row-major, C-style order, in two dimensions, the row index varies the slowest, and the column index the quickest. This can be generalized to multiple dimensions, where row-major order implies that the index along the first axis varies slowest, and the index along the last quickest. The opposite holds for column-major, Fortran-style index ordering.
When a view is desired in as many cases as possible, arr.reshape(-1)
may be preferable.
Input array. The elements in a are read in the order specified by order
, and packed as a 1-D array.
The elements of a are read using this index order. 'C' means to index the elements in row-major, C-style order, with the last axis index changing fastest, back to the first axis index changing slowest. 'F' means to index the elements in column-major, Fortran-style order, with the first index changing fastest, and the last index changing slowest. Note that the 'C' and 'F' options take no account of the memory layout of the underlying array, and only refer to the order of axis indexing. 'A' means to read the elements in Fortran-like index order if a is Fortran contiguous in memory, C-like order otherwise. 'K' means to read the elements in the order they occur in memory, except for reversing the data when strides are negative. By default, 'C' index order is used.
y is an array of the same subtype as a, with shape (a.size,)
. Note that matrices are special cased for backward compatibility, if a is a matrix, then y is a 1-D ndarray.
Return a contiguous flattened array.
ndarray.flat
1-D iterator over an array.
ndarray.flatten
1-D array copy of the elements of an array in row-major order.
ndarray.reshape
Change the shape of an array without changing its data.
It is equivalent to reshape(-1, order=order)
.
>>> x = np.array([[1, 2, 3], [4, 5, 6]]) # doctest: +SKIPThis example is valid syntax, but we were not able to check execution
... np.ravel(x) # doctest: +SKIP array([1, 2, 3, 4, 5, 6])
>>> x.reshape(-1) # doctest: +SKIP array([1, 2, 3, 4, 5, 6])This example is valid syntax, but we were not able to check execution
>>> np.ravel(x, order='F') # doctest: +SKIP array([1, 4, 2, 5, 3, 6])
When order
is 'A', it will preserve the array's 'C' or 'F' ordering:
>>> np.ravel(x.T) # doctest: +SKIP array([1, 4, 2, 5, 3, 6])This example is valid syntax, but we were not able to check execution
>>> np.ravel(x.T, order='A') # doctest: +SKIP array([1, 2, 3, 4, 5, 6])
When order
is 'K', it will preserve orderings that are neither 'C' nor 'F', but won't reverse axes:
>>> a = np.arange(3)[::-1]; a # doctest: +SKIP array([2, 1, 0])This example is valid syntax, but we were not able to check execution
>>> a.ravel(order='C') # doctest: +SKIP array([2, 1, 0])This example is valid syntax, but we were not able to check execution
>>> a.ravel(order='K') # doctest: +SKIP array([2, 1, 0])This example is valid syntax, but we were not able to check execution
>>> a = np.arange(12).reshape(2,3,2).swapaxes(1,2); a # doctest: +SKIP array([[[ 0, 2, 4], [ 1, 3, 5]], [[ 6, 8, 10], [ 7, 9, 11]]])This example is valid syntax, but we were not able to check execution
>>> a.ravel(order='C') # doctest: +SKIP array([ 0, 2, 4, 1, 3, 5, 6, 8, 10, 7, 9, 11])This example is valid syntax, but we were not able to check execution
>>> a.ravel(order='K') # doctest: +SKIP array([ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11])See :
The following pages refer to to this document either explicitly or contain code examples using this.
dask.array.routines.flatnonzero
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them