empty_like(prototype, dtype=None, order='K', subok=True, shape=None)

Notes

This function does not initialize the returned array; to do that use zeros_like or ones_like instead. It may be marginally faster than the functions that do set the array values.

Parameters

prototype : array_like

The shape and data-type of :None:None:`prototype` define these same attributes of the returned array.

dtype : data-type, optional

Overrides the data type of the result.

versionadded

order : {'C', 'F', 'A', or 'K'}, optional

Overrides the memory layout of the result. 'C' means C-order, 'F' means F-order, 'A' means 'F' if :None:None:`prototype` is Fortran contiguous, 'C' otherwise. 'K' means match the layout of :None:None:`prototype` as closely as possible.

versionadded

subok : bool, optional.

If True, then the newly created array will use the sub-class type of :None:None:`prototype`, otherwise it will be a base-class array. Defaults to True.

shape : int or sequence of ints, optional.

Overrides the shape of the result. If order='K' and the number of dimensions is unchanged, will try to keep order, otherwise, order='C' is implied.

versionadded

Returns

out : ndarray

Array of uninitialized (arbitrary) data with the same shape and type as :None:None:`prototype`.

Return a new array with the same shape and type as a given array.

See Also

empty

Return a new uninitialized array.

full_like

Return a new array with shape of input filled with value.

ones_like

Return an array of ones with shape and type of input.

zeros_like

Return an array of zeros with shape and type of input.

Examples

>>> a = ([1,2,3], [4,5,6])                         # a is array-like
... np.empty_like(a)
array([[-1073741821, -1073741821,           3],    # uninitialized
       [          0,           0, -1073741821]])

>>> a = np.array([[1., 2., 3.],[4.,5.,6.]])
... np.empty_like(a)
array([[ -2.00000715e+000,   1.48219694e-323,  -2.00000572e+000], # uninitialized
       [  4.38791518e-305,  -2.00000715e+000,   4.17269252e-309]])

See :

Local connectivity graph

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

---

GitHub : None#None
type: <class 'builtin_function_or_method'>
Commit: