bitwise_or(x1, x2, /, out=None, *, where=True, casting='same_kind', order='K', dtype=None, subok=True[, signature, extobj])
Some inconsistencies with the Dask version may exist.
Compute the bit-wise OR of two arrays element-wise.
Computes the bit-wise OR of the underlying binary representation of the integers in the input arrays. This ufunc implements the C/Python operator |
.
Only integer and boolean types are handled. If x1.shape != x2.shape
, they must be broadcastable to a common shape (which becomes the shape of the output).
A location into which the result is stored. If provided, it must have a shape that the inputs broadcast to. If not provided or None, a freshly-allocated array is returned. A tuple (possible only as a keyword argument) must have length equal to the number of outputs.
This condition is broadcast over the input. At locations where the condition is True, the :None:None:`out`
array will be set to the ufunc result. Elsewhere, the :None:None:`out`
array will retain its original value. Note that if an uninitialized :None:None:`out`
array is created via the default out=None
, locations within it where the condition is False will remain uninitialized.
For other keyword-only arguments, see the ufunc docs <ufuncs.kwargs>
.
Result. This is a scalar if both :None:None:`x1`
and :None:None:`x2`
are scalars.
This docstring was copied from numpy.bitwise_or.
binary_repr
Return the binary representation of the input number as a string.
The number 13 has the binary representation 00001101
. Likewise, 16 is represented by 00010000
. The bit-wise OR of 13 and 16 is then 000111011
, or 29:
>>> np.bitwise_or(13, 16) # doctest: +SKIP 29This example is valid syntax, but we were not able to check execution
>>> np.binary_repr(29) # doctest: +SKIP '11101'This example is valid syntax, but we were not able to check execution
>>> np.bitwise_or(32, 2) # doctest: +SKIP 34This example is valid syntax, but we were not able to check execution
>>> np.bitwise_or([33, 4], 1) # doctest: +SKIP array([33, 5])This example is valid syntax, but we were not able to check execution
>>> np.bitwise_or([33, 4], [1, 2]) # doctest: +SKIP array([33, 6])This example is valid syntax, but we were not able to check execution
>>> np.bitwise_or(np.array([2, 5, 255]), np.array([4, 4, 4])) # doctest: +SKIP array([ 6, 5, 255])This example is valid syntax, but we were not able to check execution
>>> np.array([2, 5, 255]) | np.array([4, 4, 4]) # doctest: +SKIP array([ 6, 5, 255])This example is valid syntax, but we were not able to check execution
>>> np.bitwise_or(np.array([2, 5, 255, 2147483647], dtype=np.int32), # doctest: +SKIPThis example is valid syntax, but we were not able to check execution
... np.array([4, 4, 4, 2147483647], dtype=np.int32)) array([ 6, 5, 255, 2147483647])
>>> np.bitwise_or([True, True], [False, True]) # doctest: +SKIP array([ True, True])
The |
operator can be used as a shorthand for np.bitwise_or
on ndarrays.
>>> x1 = np.array([2, 5, 255]) # doctest: +SKIPSee :
... x2 = np.array([4, 4, 4]) # doctest: +SKIP
... x1 | x2 # doctest: +SKIP array([ 6, 5, 255])
The following pages refer to to this document either explicitly or contain code examples using this.
dask.array.ufunc.invert
dask.array.ufunc.bitwise_xor
dask.array.ufunc.bitwise_and
dask.array.ufunc.logical_or
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