pyopencl 2025.2.5__cp312-cp312-manylinux_2_27_x86_64.manylinux_2_28_x86_64.whl

pyopencl/array.py

@@ -0,0 +1,3441 @@
+"""CL device arrays."""
+
+# NOTE: for elwise_kernel_runner which adds keyword arguments
+# pylint:disable=unexpected-keyword-arg
+from __future__ import annotations
+
+
+__copyright__ = "Copyright (C) 2009 Andreas Kloeckner"
+
+__license__ = """
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
+"""
+
+import builtins
+from dataclasses import dataclass
+from functools import reduce
+from numbers import Number
+from typing import (
+    TYPE_CHECKING,
+    Any,
+    ClassVar,
+    Concatenate,
+    Literal,
+    ParamSpec,
+    cast,
+)
+from warnings import warn
+
+import numpy as np
+from typing_extensions import Self, override
+
+import pyopencl as cl
+import pyopencl.elementwise as elementwise
+from pyopencl import cltypes
+from pyopencl.characterize import has_double_support
+from pyopencl.compyte.array import (
+    ArrayFlags as _ArrayFlags,
+    as_strided as _as_strided,
+    c_contiguous_strides as _c_contiguous_strides,
+    equal_strides as _equal_strides,
+    f_contiguous_strides as _f_contiguous_strides,
+)
+from pyopencl.typing import Allocator
+
+
+if TYPE_CHECKING:
+    from collections.abc import Callable, Hashable
+
+    from numpy.typing import DTypeLike, NDArray
+
+
+SCALAR_CLASSES = (Number, np.bool_, bool)
+
+if cl.get_cl_header_version() >= (2, 0):
+    _SVMPointer_or_nothing = cl.SVMPointer
+else:
+    _SVMPointer_or_nothing = ()
+
+
+class _NoValue:
+    pass
+
+
+# {{{ _get_common_dtype
+
+class DoubleDowncastWarning(UserWarning):
+    pass
+
+
+_DOUBLE_DOWNCAST_WARNING = (
+        "The operation you requested would result in a double-precision "
+        "quantity according to numpy semantics. Since your device does not "
+        "support double precision, a single-precision quantity is being returned.")
+
+
+def _get_common_dtype(obj1, obj2, queue):
+    if queue is None:
+        raise ValueError("PyOpenCL array has no queue; call .with_queue() to "
+                "add one in order to be able to perform operations")
+
+    # Note: We are calling np.result_type with pyopencl arrays here.
+    # Luckily, np.result_type only looks at the dtype of input arrays up until
+    # at least numpy v2.1.
+    result = np.result_type(obj1, obj2)
+
+    if not has_double_support(queue.device):
+        if result == np.float64:
+            result = np.dtype(np.float32)
+            warn(_DOUBLE_DOWNCAST_WARNING, DoubleDowncastWarning, stacklevel=3)
+        elif result == np.complex128:
+            result = np.dtype(np.complex64)
+            warn(_DOUBLE_DOWNCAST_WARNING, DoubleDowncastWarning, stacklevel=3)
+
+    return result
+
+# }}}
+
+
+# {{{ _get_truedivide_dtype
+
+def _get_truedivide_dtype(obj1, obj2, queue):
+    # the dtype of the division result obj1 / obj2
+
+    allow_double = has_double_support(queue.device)
+
+    x1 = obj1 if np.isscalar(obj1) else np.ones(1, obj1.dtype)
+    x2 = obj2 if np.isscalar(obj2) else np.ones(1, obj2.dtype)
+
+    result = (x1/x2).dtype
+
+    if not allow_double:
+        if result == np.float64:
+            result = np.dtype(np.float32)
+        elif result == np.complex128:
+            result = np.dtype(np.complex64)
+
+    return result
+
+# }}}
+
+
+# {{{ _get_broadcasted_binary_op_result
+
+def _get_broadcasted_binary_op_result(obj1, obj2, cq,
+                                      dtype_getter=_get_common_dtype):
+
+    if obj1.shape == obj2.shape:
+        return obj1._new_like_me(dtype_getter(obj1, obj2, cq),
+                                 cq)
+    elif obj1.shape == ():
+        return obj2._new_like_me(dtype_getter(obj1, obj2, cq),
+                                 cq)
+    elif obj2.shape == ():
+        return obj1._new_like_me(dtype_getter(obj1, obj2, cq),
+                                 cq)
+    else:
+        raise NotImplementedError("Broadcasting binary operator with shapes:"
+                                  f" {obj1.shape}, {obj2.shape}.")
+
+# }}}
+
+
+# {{{ VecLookupWarner
+
+class VecLookupWarner:
+    def __getattr__(self, name):
+        warn("pyopencl.array.vec is deprecated. "
+             "Please use pyopencl.cltypes for OpenCL vector and scalar types",
+             DeprecationWarning, stacklevel=2)
+
+        if name == "types":
+            name = "vec_types"
+        elif name == "type_to_scalar_and_count":
+            name = "vec_type_to_scalar_and_count"
+
+        return getattr(cltypes, name)
+
+
+vec = VecLookupWarner()
+
+# }}}
+
+
+# {{{ helper functionality
+
+def _splay(
+            device: cl.Device,
+            n: int,
+            kernel_specific_max_wg_size: int | None = None,
+        ):
+    max_work_items = builtins.min(128, device.max_work_group_size)
+
+    if kernel_specific_max_wg_size is not None:
+        max_work_items = builtins.min(max_work_items, kernel_specific_max_wg_size)
+
+    min_work_items = builtins.min(32, max_work_items)
+    max_groups = device.max_compute_units * 4 * 8
+    # 4 to overfill the device
+    # 8 is an Nvidia constant--that's how many
+    # groups fit onto one compute device
+
+    if n < min_work_items:
+        group_count = 1
+        work_items_per_group = min_work_items
+    elif n < (max_groups * min_work_items):
+        group_count = (n + min_work_items - 1) // min_work_items
+        work_items_per_group = min_work_items
+    elif n < (max_groups * max_work_items):
+        group_count = max_groups
+        grp = (n + min_work_items - 1) // min_work_items
+        work_items_per_group = (
+                (grp + max_groups - 1) // max_groups) * min_work_items
+    else:
+        group_count = max_groups
+        work_items_per_group = max_work_items
+
+    # print("n:%d gc:%d wipg:%d" % (n, group_count, work_items_per_group))
+    return (group_count*work_items_per_group,), (work_items_per_group,)
+
+
+# deliberately undocumented for now
+ARRAY_KERNEL_EXEC_HOOK = None
+
+
+P = ParamSpec("P")
+
+
+def elwise_kernel_runner(
+            kernel_getter: Callable[Concatenate[Array, P], cl.Kernel]
+        ) -> Callable[Concatenate[Array, P], cl.Event]:
+    """Take a kernel getter of the same signature as the kernel
+    and return a function that invokes that kernel.
+
+    Assumes that the zeroth entry in *args* is an :class:`Array`.
+    """
+    from functools import wraps
+
+    @wraps(kernel_getter)
+    def kernel_runner(out: Array, *args: P.args, **kwargs: P.kwargs) -> cl.Event:
+        assert isinstance(out, Array)
+
+        wait_for = cast("cl.WaitList", kwargs.pop("wait_for", None))
+        queue = cast("cl.CommandQueue | None", kwargs.pop("queue", None))
+        if queue is None:
+            queue = out.queue
+
+        assert queue is not None
+
+        knl = kernel_getter(out, *args, **kwargs)
+        work_group_info = cast("int", knl.get_work_group_info(
+            cl.kernel_work_group_info.WORK_GROUP_SIZE,
+            queue.device))
+        gs, ls = out._get_sizes(queue, work_group_info)
+
+        knl_args = (out, *args, out.size)
+        if ARRAY_KERNEL_EXEC_HOOK is not None:
+            return ARRAY_KERNEL_EXEC_HOOK(  # pylint: disable=not-callable
+                    knl, queue, gs, ls, *knl_args, wait_for=wait_for)
+        else:
+            return knl(queue, gs, ls, *knl_args, wait_for=wait_for)
+
+    return kernel_runner
+
+# }}}
+
+
+# {{{ array class
+
+class InconsistentOpenCLQueueWarning(UserWarning):
+    pass
+
+
+class ArrayHasOffsetError(ValueError):
+    """
+    .. versionadded:: 2013.1
+    """
+
+    def __init__(self, val="The operation you are attempting does not yet "
+                "support arrays that start at an offset from the beginning "
+                "of their buffer."):
+        ValueError.__init__(self, val)
+
+
+class _copy_queue:  # noqa: N801
+    pass
+
+
+_ARRAY_GET_SIZES_CACHE: \
+    dict[Hashable, tuple[tuple[int, ...], tuple[int, ...]]] = {}
+_BOOL_DTYPE = np.dtype(np.int8)
+_NOT_PRESENT = object()
+
+
+class Array:
+    """A :class:`numpy.ndarray` work-alike that stores its data and performs
+    its computations on the compute device. :attr:`shape` and :attr:`dtype` work
+    exactly as in :mod:`numpy`. Arithmetic methods in :class:`Array` support the
+    broadcasting of scalars. (e.g. ``array + 5``).
+
+    *cq* must be a :class:`~pyopencl.CommandQueue` or a :class:`~pyopencl.Context`.
+
+    If it is a queue, *cq* specifies the queue in which the array carries out
+    its computations by default. If a default queue (and thereby overloaded
+    operators and many other niceties) are not desired, pass a
+    :class:`~pyopencl.Context`.
+
+    *allocator* may be *None* or a callable that, upon being called with an
+    argument of the number of bytes to be allocated, returns a
+    :class:`pyopencl.Buffer` object. (A :class:`pyopencl.tools.MemoryPool`
+    instance is one useful example of an object to pass here.)
+
+    .. versionchanged:: 2011.1
+
+        Renamed *context* to *cqa*, made it general-purpose.
+
+        All arguments beyond *order* should be considered keyword-only.
+
+    .. versionchanged:: 2015.2
+
+        Renamed *context* to *cq*, disallowed passing allocators through it.
+
+    .. attribute :: data
+
+        The :class:`pyopencl.MemoryObject` instance created for the memory that
+        backs this :class:`Array`.
+
+        .. versionchanged:: 2013.1
+
+            If a non-zero :attr:`offset` has been specified for this array,
+            this will fail with :exc:`ArrayHasOffsetError`.
+
+    .. attribute :: base_data
+
+        The :class:`pyopencl.MemoryObject` instance created for the memory that
+        backs this :class:`Array`. Unlike :attr:`data`, the base address of
+        *base_data* is allowed to be different from the beginning of the array.
+        The actual beginning is the base address of *base_data* plus
+        :attr:`offset` bytes.
+
+        Unlike :attr:`data`, retrieving :attr:`base_data` always succeeds.
+
+        .. versionadded:: 2013.1
+
+    .. attribute :: offset
+
+        See :attr:`base_data`.
+
+        .. versionadded:: 2013.1
+
+    .. attribute :: shape
+
+        A tuple of lengths of each dimension in the array.
+
+    .. attribute :: ndim
+
+        The number of dimensions in :attr:`shape`.
+
+    .. attribute :: dtype
+
+        The :class:`numpy.dtype` of the items in the GPU array.
+
+    .. attribute :: size
+
+        The number of meaningful entries in the array. Can also be computed by
+        multiplying up the numbers in :attr:`shape`.
+
+    .. attribute :: nbytes
+
+        The size of the entire array in bytes. Computed as :attr:`size` times
+        ``dtype.itemsize``.
+
+    .. attribute :: strides
+
+        A tuple of bytes to step in each dimension when traversing an array.
+
+    .. attribute :: flags
+
+        An object with attributes ``c_contiguous``, ``f_contiguous`` and
+        ``forc``, which may be used to query contiguity properties in analogy to
+        :attr:`numpy.ndarray.flags`.
+
+    .. rubric:: Methods
+
+    .. automethod :: with_queue
+
+    .. automethod :: __len__
+    .. automethod :: reshape
+    .. automethod :: ravel
+    .. automethod :: view
+    .. automethod :: squeeze
+    .. automethod :: transpose
+    .. attribute :: T
+    .. automethod :: set
+    .. automethod :: get
+    .. automethod :: get_async
+    .. automethod :: copy
+
+    .. automethod :: __str__
+    .. automethod :: __repr__
+
+    .. automethod :: mul_add
+    .. automethod :: __add__
+    .. automethod :: __sub__
+    .. automethod :: __iadd__
+    .. automethod :: __isub__
+    .. automethod :: __pos__
+    .. automethod :: __neg__
+    .. automethod :: __mul__
+    .. automethod :: __div__
+    .. automethod :: __rdiv__
+    .. automethod :: __pow__
+
+    .. automethod :: __and__
+    .. automethod :: __xor__
+    .. automethod :: __or__
+    .. automethod :: __iand__
+    .. automethod :: __ixor__
+    .. automethod :: __ior__
+
+    .. automethod :: __abs__
+    .. automethod :: __invert__
+
+    .. UNDOC reverse()
+
+    .. automethod :: fill
+
+    .. automethod :: astype
+
+    .. autoattribute :: real
+    .. autoattribute :: imag
+    .. automethod :: conj
+    .. automethod :: conjugate
+
+    .. automethod :: __getitem__
+    .. automethod :: __setitem__
+
+    .. automethod :: setitem
+
+    .. automethod :: map_to_host
+
+    .. rubric:: Comparisons, conditionals, any, all
+
+    .. versionadded:: 2013.2
+
+    Boolean arrays are stored as :class:`numpy.int8` because ``bool``
+    has an unspecified size in the OpenCL spec.
+
+    .. automethod :: __bool__
+
+        Only works for device scalars. (i.e. "arrays" with ``shape == ()``)
+
+    .. automethod :: any
+    .. automethod :: all
+
+    .. automethod :: __eq__
+    .. automethod :: __ne__
+    .. automethod :: __lt__
+    .. automethod :: __le__
+    .. automethod :: __gt__
+    .. automethod :: __ge__
+
+    .. rubric:: Event management
+
+    If an array is used from within an out-of-order queue, it needs to take
+    care of its own operation ordering. The facilities in this section make
+    this possible.
+
+    .. versionadded:: 2014.1.1
+
+    .. attribute:: events
+
+        A list of :class:`pyopencl.Event` instances that the current content of
+        this array depends on. User code may read, but should never modify this
+        list directly. To update this list, instead use the following methods.
+
+    .. automethod:: add_event
+    .. automethod:: finish
+    """
+
+    __array_priority__: ClassVar[int] = 100
+
+    queue: cl.CommandQueue | None
+    shape: tuple[int, ...]
+    dtype: np.dtype[Any]
+    strides: tuple[int, ...]
+    events: list[cl.Event]
+    nbytes: int
+    size: int
+    allocator: Allocator | None
+    base_data: cl.MemoryObjectHolder | cl.SVMPointer | None
+
+    def __init__(
+            self,
+            cq: cl.Context | cl.CommandQueue | None,
+            shape: tuple[int, ...] | int,
+            dtype: DTypeLike,
+            order: str = "C",
+            allocator: Allocator | None = None,
+            data: Any = None,
+            offset: int = 0,
+            strides: tuple[int, ...] | None = None,
+            events: list[cl.Event] | None = None,
+
+            # NOTE: following args are used for the fast constructor
+            _flags: Any = None,
+            _fast: bool = False,
+            _size: int | None = None,
+            _context: cl.Context | None = None,
+            _queue: cl.CommandQueue | None = None) -> None:
+        if _fast:
+            # Assumptions, should be disabled if not testing
+            if TYPE_CHECKING:
+                assert cq is None
+                assert isinstance(_context, cl.Context)
+                assert _queue is None or isinstance(_queue, cl.CommandQueue)
+                assert isinstance(shape, tuple)
+                assert isinstance(strides, tuple)
+                assert isinstance(dtype, np.dtype)
+                assert _size is not None
+
+            size = _size
+            context = _context
+            queue = _queue
+            alloc_nbytes = dtype.itemsize * size
+
+        else:
+            # {{{ backward compatibility
+
+            if cq is None:
+                context = _context
+                queue = _queue
+
+            elif isinstance(cq, cl.CommandQueue):
+                queue = cq
+                context = queue.context
+
+            elif isinstance(cq, cl.Context):
+                context = cq
+                queue = None
+
+            else:
+                raise TypeError(
+                    f"cq may be a queue or a context, not '{type(cq).__name__}'")
+
+            if allocator is not None:
+                # "is" would be wrong because two Python objects are allowed
+                # to hold handles to the same context.
+
+                # FIXME It would be nice to check this. But it would require
+                # changing the allocator interface. Trust the user for now.
+
+                # assert allocator.context == context
+                pass
+
+            # Queue-less arrays do have a purpose in life.
+            # They don't do very much, but at least they don't run kernels
+            # in random queues.
+            #
+            # See also :meth:`with_queue`.
+
+            del cq
+
+            # }}}
+
+            # invariant here: allocator, queue set
+
+            # {{{ determine shape, size, and strides
+
+            dtype = np.dtype(dtype)
+
+            try:
+                shape = tuple(shape)        # type: ignore[arg-type]
+            except TypeError as err:
+                if not isinstance(shape, (int, np.integer)):
+                    raise TypeError(
+                        "shape must either be iterable or castable to an integer: "
+                        f"got a '{type(shape).__name__}'") from err
+
+                shape = (shape,)
+
+            shape_array = np.array(shape)
+
+            # Previously, the size was computed as
+            #   "size = 1; size *= dim for dim in shape"
+            # However this can fail when using certain data types,
+            # eg numpy.uint64(1) * 2 returns 2.0 !
+            if np.any(shape_array < 0):
+                raise ValueError(f"negative dimensions are not allowed: {shape}")
+            if np.any([np.array([s]).dtype.kind not in ["u", "i"] for s in shape]):
+                raise ValueError(
+                    "Invalid shape %s ; dimensions, must be integer" % (str(shape)))
+            size = np.prod(shape_array, dtype=np.uint64).item()
+
+            if strides is None:
+                if order in "cC":
+                    # inlined from compyte.array.c_contiguous_strides
+                    if shape:
+                        strides_tmp = [dtype.itemsize]
+                        for s in shape[:0:-1]:
+                            # NOTE: https://github.com/inducer/compyte/pull/36
+                            strides_tmp.append(strides_tmp[-1]*builtins.max(1, s))
+                        strides = tuple(strides_tmp[::-1])
+                    else:
+                        strides = ()
+                elif order in "fF":
+                    strides = _f_contiguous_strides(dtype.itemsize, shape)
+                else:
+                    raise ValueError(f"invalid order: {order}")
+
+            else:
+                # FIXME: We should possibly perform some plausibility
+                # checking on 'strides' here.
+
+                strides = tuple(strides)
+
+            # }}}
+
+            assert dtype != object, \
+                    "object arrays on the compute device are not allowed"  # noqa: E721
+            assert isinstance(shape, tuple)
+            assert isinstance(strides, tuple)
+
+            alloc_nbytes = dtype.itemsize * size
+
+            if alloc_nbytes < 0:
+                raise ValueError("cannot allocate CL buffer with negative size")
+
+        self.queue = queue
+        self.shape = shape
+        self.dtype = dtype
+        self.strides = strides
+        self.events = [] if events is None else events
+        self.nbytes = alloc_nbytes
+        self.size = size
+        self.allocator = allocator
+
+        if data is None:
+            if alloc_nbytes == 0:
+                self.base_data = None
+
+            else:
+                if self.allocator is None:
+                    if context is None and queue is not None:
+                        context = queue.context
+
+                    self.base_data = cl.Buffer(
+                            context, cl.mem_flags.READ_WRITE, alloc_nbytes)
+                else:
+                    self.base_data = self.allocator(alloc_nbytes)
+        else:
+            self.base_data = data
+
+        self.offset = offset
+        self.context = context
+        self._flags = _flags
+
+        if __debug__:
+            if queue is not None and isinstance(
+                    self.base_data, _SVMPointer_or_nothing):
+                mem_queue = getattr(self.base_data, "_queue", _NOT_PRESENT)
+                if mem_queue is not _NOT_PRESENT and mem_queue != queue:
+                    warn("Array has different queue from backing SVM memory. "
+                         "This may lead to the array getting deallocated sooner "
+                         "than expected, potentially leading to crashes.",
+                         InconsistentOpenCLQueueWarning, stacklevel=2)
+
+    @property
+    def ndim(self):
+        return len(self.shape)
+
+    @property
+    def data(self):
+        if self.offset:
+            raise ArrayHasOffsetError()
+        else:
+            return self.base_data
+
+    @property
+    def flags(self):
+        f = self._flags
+        if f is None:
+            self._flags = f = _ArrayFlags(self)
+        return f
+
+    def _new_with_changes(self,
+                data: cl.MemoryObjectHolder | cl.SVMPointer | None,
+                offset: int | None,
+                shape: tuple[int, ...] | None = None,
+                dtype: np.dtype[Any] | None = None,
+                strides: tuple[int, ...] | None = None,
+                queue: cl.CommandQueue | type[_copy_queue] | None = _copy_queue,
+                allocator: Allocator | None = None,
+            ) -> Self:
+        """
+        :arg data: *None* means allocate a new array.
+        """
+        fast = True
+        size = self.size
+        if shape is None:
+            shape = self.shape
+        else:
+            fast = False
+            size = None
+
+        if dtype is None:
+            dtype = self.dtype
+        if strides is None:
+            strides = self.strides
+        if queue is _copy_queue:
+            queue = self.queue
+        if allocator is None:
+            allocator = self.allocator
+        if offset is None:
+            offset = self.offset
+
+        # If we're allocating new data, then there's not likely to be
+        # a data dependency. Otherwise, the two arrays should probably
+        # share the same events list.
+
+        if data is None:
+            events = None
+        else:
+            events = self.events
+
+        return self.__class__(None, shape, dtype, allocator=allocator,
+                strides=strides, data=data, offset=offset,
+                events=events,
+                _fast=fast, _context=self.context, _queue=queue, _size=size)
+
+    def with_queue(self, queue: cl.CommandQueue | None):
+        """Return a copy of *self* with the default queue set to *queue*.
+
+        *None* is allowed as a value for *queue*.
+
+        .. versionadded:: 2013.1
+        """
+
+        if queue is not None:
+            assert queue.context == self.context
+
+        return self._new_with_changes(self.base_data, self.offset,
+                queue=queue)
+
+    def _get_sizes(self,
+                queue: cl.CommandQueue,
+                kernel_specific_max_wg_size: int | None = None
+            ) -> tuple[tuple[int, ...], tuple[int, ...]]:
+        if not self.flags.forc:
+            raise NotImplementedError("cannot operate on non-contiguous array")
+        cache_key = (queue.device.int_ptr, self.size, kernel_specific_max_wg_size)
+        try:
+            return _ARRAY_GET_SIZES_CACHE[cache_key]
+        except KeyError:
+            sizes = _splay(queue.device, self.size,
+                    kernel_specific_max_wg_size=kernel_specific_max_wg_size)
+            _ARRAY_GET_SIZES_CACHE[cache_key] = sizes
+            return sizes
+
+    def set(self,
+                ary: NDArray[Any],
+                queue: cl.CommandQueue | None = None,
+                async_: bool = False,
+            ):
+        """Transfer the contents the :class:`numpy.ndarray` object *ary*
+        onto the device.
+
+        *ary* must have the same dtype and size (not necessarily shape) as
+        *self*.
+
+        *async_* is a Boolean indicating whether the function is allowed
+        to return before the transfer completes. To avoid synchronization
+        bugs, this defaults to *False*.
+        """
+
+        assert ary.size == self.size
+        assert ary.dtype == self.dtype
+
+        if not ary.flags.forc:
+            raise RuntimeError("cannot set from non-contiguous array")
+
+        if not _equal_strides(ary.strides, self.strides, self.shape):
+            raise RuntimeError("Setting array from one with different "
+                    "strides/storage order.")
+
+        if self.size:
+            queue = queue or self.queue
+            assert queue is not None
+            event1 = cl.enqueue_copy(queue or self.queue, self.base_data, ary,
+                    dst_offset=self.offset,
+                    is_blocking=not async_)
+
+            self.add_event(event1)
+
+    def _get(self,
+             queue: cl.CommandQueue | None = None,
+             ary: NDArray[Any] | None = None,
+             async_: bool = False,
+             ):
+        if ary is None:
+            ary = np.empty(self.shape, self.dtype)
+
+            if self.strides != ary.strides:
+                ary = _as_strided(ary, strides=self.strides)
+        else:
+            if ary.size != self.size:
+                raise TypeError("'ary' has non-matching size")
+            if ary.dtype != self.dtype:
+                raise TypeError("'ary' has non-matching type")
+
+            if self.shape != ary.shape:
+                warn("get() between arrays of different shape is deprecated "
+                        "and will be removed in PyCUDA 2017.x",
+                        DeprecationWarning, stacklevel=2)
+
+        assert self.flags.forc, "Array in get() must be contiguous"
+
+        queue = queue or self.queue
+        if queue is None:
+            raise ValueError("Cannot copy array to host. "
+                    "Array has no queue. Use "
+                    "'new_array = array.with_queue(queue)' "
+                    "to associate one.")
+
+        if self.size:
+            assert self.base_data is not None
+            event1 = cast("cl.Event", cl.enqueue_copy(queue, ary, self.base_data,
+                    src_offset=self.offset,
+                    wait_for=self.events, is_blocking=not async_))
+
+            self.add_event(event1)
+        else:
+            event1 = cl.enqueue_marker(queue, wait_for=self.events)
+            if not async_:
+                event1.wait()
+
+        return ary, event1
+
+    def get(self,
+                queue: cl.CommandQueue | None = None,
+                ary: NDArray[Any] | None = None,
+            ) -> NDArray[Any]:
+        """Transfer the contents of *self* into *ary* or a newly allocated
+        :class:`numpy.ndarray`. If *ary* is given, it must have the same
+        shape and dtype.
+        """
+
+        ary, _event1 = self._get(queue=queue, ary=ary)
+
+        return ary
+
+    def get_async(self,
+                queue: cl.CommandQueue | None = None,
+                ary: NDArray[Any] | None = None,
+            ) -> tuple[NDArray[Any], cl.Event]:
+        """
+        Asynchronous version of :meth:`get` which returns a tuple ``(ary, event)``
+        containing the host array ``ary``
+        and the :class:`pyopencl.NannyEvent` ``event`` returned by
+        :meth:`pyopencl.enqueue_copy`.
+
+        .. versionadded:: 2019.1.2
+        """
+
+        return self._get(queue=queue, ary=ary, async_=True)
+
+    def copy(self, queue: cl.CommandQueue | type[_copy_queue] | None = _copy_queue):
+        """
+        :arg queue: The :class:`~pyopencl.CommandQueue` for the returned array.
+
+        .. versionchanged:: 2017.1.2
+
+            Updates the queue of the returned array.
+
+        .. versionadded:: 2013.1
+        """
+
+        if queue is _copy_queue:
+            queue_san = self.queue
+        else:
+            queue_san = cast("cl.CommandQueue | None", queue)
+
+        result = self._new_like_me(queue=queue_san)
+
+        # result.queue won't be the same as queue if queue is None.
+        # We force them to be the same here.
+        if result.queue is not queue:
+            result = result.with_queue(queue_san)
+
+        if not self.flags.forc:
+            raise RuntimeError("cannot copy non-contiguous array")
+
+        if self.nbytes:
+            queue_san = queue_san or self.queue
+            assert queue_san is not None
+            event1 = cl.enqueue_copy(queue_san,
+                    result.base_data, self.base_data,
+                    src_offset=self.offset, byte_count=self.nbytes,
+                    wait_for=self.events)
+            result.add_event(event1)
+
+        return result
+
+    def __str__(self):
+        if self.queue is None:
+            return (f"<cl.{type(self).__name__} {self.shape} of {self.dtype} "
+                    "without queue, call with_queue()>")
+
+        return str(self.get())
+
+    def __repr__(self):
+        if self.queue is None:
+            return (f"<cl.{type(self).__name__} {self.shape} of {self.dtype} "
+                    f"at {id(self):x} without queue, call with_queue()>")
+
+        result = repr(self.get())
+        if result[:5] == "array":
+            result = f"cl.{type(self).__name__}" + result[5:]
+        else:
+            warn(
+                f"{type(result).__name__}.__repr__ was expected to return a "
+                f"string starting with 'array', got '{result[:10]!r}'",
+                stacklevel=2)
+
+        return result
+
+    def safely_stringify_for_pudb(self):
+        return f"cl.{type(self).__name__} {self.dtype} {self.shape}"
+
+    def __hash__(self):
+        raise TypeError("pyopencl arrays are not hashable.")
+
+    # {{{ kernel invocation wrappers
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _axpbyz(out, afac, a, bfac, b, queue: cl.CommandQueue | None = None):
+        """Compute ``out = selffac * self + otherfac*other``,
+        where *other* is an array."""
+        a_shape = a.shape
+        b_shape = b.shape
+        out_shape = out.shape
+        assert (a_shape == b_shape == out_shape
+                or (a_shape == () and b_shape == out_shape)
+                or (b_shape == () and a_shape == out_shape))
+        return elementwise.get_axpbyz_kernel(
+                out.context, a.dtype, b.dtype, out.dtype,
+                x_is_scalar=(a_shape == ()),
+                y_is_scalar=(b_shape == ()))
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _axpbz(out, a, x, b, queue: cl.CommandQueue | None = None):
+        """Compute ``z = a * x + b``, where *b* is a scalar."""
+        a = np.array(a)
+        b = np.array(b)
+        assert out.shape == x.shape
+        return elementwise.get_axpbz_kernel(out.context,
+                a.dtype, x.dtype, b.dtype, out.dtype)
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _elwise_multiply(out, a, b, queue: cl.CommandQueue | None = None):
+        a_shape = a.shape
+        b_shape = b.shape
+        out_shape = out.shape
+        assert (a_shape == b_shape == out_shape
+                or (a_shape == () and b_shape == out_shape)
+                or (b_shape == () and a_shape == out_shape))
+        return elementwise.get_multiply_kernel(
+                a.context, a.dtype, b.dtype, out.dtype,
+                x_is_scalar=(a_shape == ()),
+                y_is_scalar=(b_shape == ())
+        )
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _rdiv_scalar(out, ary, other, queue: cl.CommandQueue | None = None):
+        other = np.array(other)
+        assert out.shape == ary.shape
+        return elementwise.get_rdivide_elwise_kernel(
+                out.context, ary.dtype, other.dtype, out.dtype)
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _div(out, self, other, queue: cl.CommandQueue | None = None):
+        """Divides an array by another array."""
+        assert (self.shape == other.shape == out.shape
+                or (self.shape == () and other.shape == out.shape)
+                or (other.shape == () and self.shape == out.shape))
+
+        return elementwise.get_divide_kernel(self.context,
+                self.dtype, other.dtype, out.dtype,
+                x_is_scalar=(self.shape == ()),
+                y_is_scalar=(other.shape == ()))
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _fill(result, scalar):
+        return elementwise.get_fill_kernel(result.context, result.dtype)
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _abs(result, arg):
+        if arg.dtype.kind == "c":
+            from pyopencl.elementwise import complex_dtype_to_name
+            fname = "%s_abs" % complex_dtype_to_name(arg.dtype)
+        elif arg.dtype.kind == "f":
+            fname = "fabs"
+        elif arg.dtype.kind in ["u", "i"]:
+            fname = "abs"
+        else:
+            raise TypeError("unsupported dtype in _abs()")
+
+        return elementwise.get_unary_func_kernel(
+                arg.context, fname, arg.dtype, out_dtype=result.dtype)
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _real(result, arg):
+        from pyopencl.elementwise import complex_dtype_to_name
+        fname = "%s_real" % complex_dtype_to_name(arg.dtype)
+        return elementwise.get_unary_func_kernel(
+                arg.context, fname, arg.dtype, out_dtype=result.dtype)
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _imag(result, arg):
+        from pyopencl.elementwise import complex_dtype_to_name
+        fname = "%s_imag" % complex_dtype_to_name(arg.dtype)
+        return elementwise.get_unary_func_kernel(
+                arg.context, fname, arg.dtype, out_dtype=result.dtype)
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _conj(result, arg):
+        from pyopencl.elementwise import complex_dtype_to_name
+        fname = "%s_conj" % complex_dtype_to_name(arg.dtype)
+        return elementwise.get_unary_func_kernel(
+                arg.context, fname, arg.dtype, out_dtype=result.dtype)
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _pow_scalar(result, ary, exponent):
+        exponent = np.array(exponent)
+        return elementwise.get_pow_kernel(result.context,
+                ary.dtype, exponent.dtype, result.dtype,
+                is_base_array=True, is_exp_array=False)
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _rpow_scalar(result, base, exponent):
+        base = np.array(base)
+        return elementwise.get_pow_kernel(result.context,
+                base.dtype, exponent.dtype, result.dtype,
+                is_base_array=False, is_exp_array=True)
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _pow_array(result, base, exponent):
+        return elementwise.get_pow_kernel(
+                result.context, base.dtype, exponent.dtype, result.dtype,
+                is_base_array=True, is_exp_array=True)
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _reverse(result, ary):
+        return elementwise.get_reverse_kernel(result.context, ary.dtype)
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _copy(dest, src):
+        return elementwise.get_copy_kernel(
+                dest.context, dest.dtype, src.dtype)
+
+    def _new_like_me(self, dtype=None, queue: cl.CommandQueue | None = None):
+        if dtype is None:
+            dtype = self.dtype
+            strides = self.strides
+            flags = self.flags
+            fast = True
+        else:
+            strides = None
+            flags = None
+            if dtype == self.dtype:
+                strides = self.strides
+                flags = self.flags
+                fast = True
+            else:
+                fast = False
+
+        queue = queue or self.queue
+        return self.__class__(None, self.shape, dtype,
+                allocator=self.allocator, strides=strides, _flags=flags,
+                _fast=fast,
+                _size=self.size, _queue=queue, _context=self.context)
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _scalar_binop(out, a, b, queue: cl.CommandQueue | None = None, op=None):
+        return elementwise.get_array_scalar_binop_kernel(
+                out.context, op, out.dtype, a.dtype,
+                np.array(b).dtype)
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _array_binop(out, a, b, queue: cl.CommandQueue | None = None, op=None):
+        a_shape = a.shape
+        b_shape = b.shape
+        out_shape = out.shape
+        assert (a_shape == b_shape == out_shape
+                or (a_shape == () and b_shape == out_shape)
+                or (b_shape == () and a_shape == out_shape))
+        return elementwise.get_array_binop_kernel(
+                out.context, op, out.dtype, a.dtype, b.dtype,
+                a_is_scalar=(a_shape == ()),
+                b_is_scalar=(b_shape == ()))
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _unop(out, a, queue: cl.CommandQueue | None = None, op=None):
+        if out.shape != a.shape:
+            raise ValueError("shapes of arguments do not match")
+        return elementwise.get_unop_kernel(
+                out.context, op, a.dtype, out.dtype)
+
+    # }}}
+
+    # {{{ operators
+
+    def mul_add(self, selffac, other, otherfac, queue: cl.CommandQueue | None = None):
+        """Return ``selffac * self + otherfac * other``.
+        """
+        queue = queue or self.queue
+
+        if isinstance(other, Array):
+            result = _get_broadcasted_binary_op_result(self, other, queue)
+            result.add_event(
+                    self._axpbyz(
+                        result, selffac, self, otherfac, other,
+                        queue=queue))
+            return result
+        elif np.isscalar(other):
+            common_dtype = _get_common_dtype(self, other, queue)
+            result = self._new_like_me(common_dtype, queue=queue)
+            result.add_event(
+                    self._axpbz(result, selffac,
+                        self, common_dtype.type(otherfac * other),
+                        queue=queue))
+            return result
+        else:
+            raise NotImplementedError
+
+    def __add__(self, other) -> Self:
+        """Add an array with an array or an array with a scalar."""
+
+        if isinstance(other, Array):
+            result = _get_broadcasted_binary_op_result(self, other, self.queue)
+            result.add_event(
+                    self._axpbyz(result,
+                        self.dtype.type(1), self,
+                        other.dtype.type(1), other))
+
+            return result
+        elif np.isscalar(other):
+            if other == 0:
+                return self.copy()
+            else:
+                common_dtype = _get_common_dtype(self, other, self.queue)
+                result = self._new_like_me(common_dtype)
+                result.add_event(
+                        self._axpbz(result, self.dtype.type(1),
+                            self, common_dtype.type(other)))
+                return result
+        else:
+            return NotImplemented
+
+    __radd__ = __add__
+
+    def __sub__(self, other) -> Self:
+        """Subtract an array from an array or a scalar from an array."""
+
+        if isinstance(other, Array):
+            result = _get_broadcasted_binary_op_result(self, other, self.queue)
+            result.add_event(
+                    self._axpbyz(result,
+                        self.dtype.type(1), self,
+                        result.dtype.type(-1), other))
+
+            return result
+        elif np.isscalar(other):
+            if other == 0:
+                return self.copy()
+            else:
+                result = self._new_like_me(
+                        _get_common_dtype(self, other, self.queue))
+                result.add_event(
+                        self._axpbz(result, self.dtype.type(1), self, -other))
+                return result
+        else:
+            return NotImplemented
+
+    def __rsub__(self, other) -> Self:
+        """Subtracts an array by a scalar or an array::
+
+           x = n - self
+        """
+        if np.isscalar(other):
+            common_dtype = _get_common_dtype(self, other, self.queue)
+            result = self._new_like_me(common_dtype)
+            result.add_event(
+                    self._axpbz(result, result.dtype.type(-1), self,
+                        common_dtype.type(other)))
+
+            return result
+        else:
+            return NotImplemented
+
+    def __iadd__(self, other) -> Self:
+        if isinstance(other, Array):
+            if other.shape != self.shape and other.shape != ():
+                raise NotImplementedError("Broadcasting binary op with shapes:"
+                                          f" {self.shape}, {other.shape}.")
+            self.add_event(
+                    self._axpbyz(self,
+                        self.dtype.type(1), self,
+                        other.dtype.type(1), other))
+
+            return self
+        elif np.isscalar(other):
+            self.add_event(
+                    self._axpbz(self, self.dtype.type(1), self, other))
+            return self
+        else:
+            return NotImplemented
+
+    def __isub__(self, other) -> Self:
+        if isinstance(other, Array):
+            if other.shape != self.shape and other.shape != ():
+                raise NotImplementedError("Broadcasting binary op with shapes:"
+                                          f" {self.shape}, {other.shape}.")
+            self.add_event(
+                    self._axpbyz(self, self.dtype.type(1), self,
+                        other.dtype.type(-1), other))
+            return self
+        elif np.isscalar(other):
+            self._axpbz(self, self.dtype.type(1), self, -other)
+            return self
+        else:
+            return NotImplemented
+
+    def __pos__(self) -> Self:
+        return self
+
+    def __neg__(self) -> Self:
+        result = self._new_like_me()
+        result.add_event(self._axpbz(result, -1, self, 0))
+        return result
+
+    def __mul__(self, other) -> Self:
+        if isinstance(other, Array):
+            result = _get_broadcasted_binary_op_result(self, other, self.queue)
+            result.add_event(
+                    self._elwise_multiply(result, self, other))
+            return result
+        elif np.isscalar(other):
+            common_dtype = _get_common_dtype(self, other, self.queue)
+            result = self._new_like_me(common_dtype)
+            result.add_event(
+                    self._axpbz(result,
+                        common_dtype.type(other), self, self.dtype.type(0)))
+            return result
+        else:
+            return NotImplemented
+
+    def __rmul__(self, other) -> Self:
+        if np.isscalar(other):
+            common_dtype = _get_common_dtype(self, other, self.queue)
+            result = self._new_like_me(common_dtype)
+            result.add_event(
+                    self._axpbz(result,
+                        common_dtype.type(other), self, self.dtype.type(0)))
+            return result
+        else:
+            return NotImplemented
+
+    def __imul__(self, other) -> Self:
+        if isinstance(other, Array):
+            if other.shape != self.shape and other.shape != ():
+                raise NotImplementedError("Broadcasting binary op with shapes:"
+                                          f" {self.shape}, {other.shape}.")
+            self.add_event(
+                    self._elwise_multiply(self, self, other))
+            return self
+        elif np.isscalar(other):
+            self.add_event(
+                    self._axpbz(self, other, self, self.dtype.type(0)))
+            return self
+        else:
+            return NotImplemented
+
+    def __div__(self, other) -> Self:
+        """Divides an array by an array or a scalar, i.e. ``self / other``.
+        """
+        if isinstance(other, Array):
+            result = _get_broadcasted_binary_op_result(
+                            self, other, self.queue,
+                            dtype_getter=_get_truedivide_dtype)
+            result.add_event(self._div(result, self, other))
+
+            return result
+        elif np.isscalar(other):
+            if other == 1:
+                return self.copy()
+            else:
+                common_dtype = _get_truedivide_dtype(self, other, self.queue)
+                result = self._new_like_me(common_dtype)
+                result.add_event(
+                        self._axpbz(result,
+                                    np.true_divide(common_dtype.type(1), other),
+                                    self, self.dtype.type(0)))
+                return result
+        else:
+            return NotImplemented
+
+    __truediv__ = __div__
+
+    def __rdiv__(self, other) -> Self:
+        """Divides an array by a scalar or an array, i.e. ``other / self``.
+        """
+        common_dtype = _get_truedivide_dtype(self, other, self.queue)
+
+        if isinstance(other, Array):
+            result = self._new_like_me(common_dtype)
+            result.add_event(other._div(result, self))
+            return result
+        elif np.isscalar(other):
+            result = self._new_like_me(common_dtype)
+            result.add_event(
+                    self._rdiv_scalar(result, self, common_dtype.type(other)))
+            return result
+        else:
+            return NotImplemented
+
+    __rtruediv__ = __rdiv__
+
+    def __itruediv__(self, other) -> Self:
+        # raise an error if the result cannot be cast to self
+        common_dtype = _get_truedivide_dtype(self, other, self.queue)
+        if not np.can_cast(common_dtype, self.dtype.type, "same_kind"):
+            raise TypeError(
+                "Cannot cast {!r} to {!r}".format(self.dtype, common_dtype))
+
+        if isinstance(other, Array):
+            if other.shape != self.shape and other.shape != ():
+                raise NotImplementedError("Broadcasting binary op with shapes:"
+                                          f" {self.shape}, {other.shape}.")
+            self.add_event(
+                self._div(self, self, other))
+            return self
+        elif np.isscalar(other):
+            if other == 1:
+                return self
+            else:
+                self.add_event(
+                    self._axpbz(self, common_dtype.type(np.true_divide(1, other)),
+                                self, self.dtype.type(0)))
+                return self
+        else:
+            return NotImplemented
+
+    def __and__(self, other) -> Self:
+        common_dtype = _get_common_dtype(self, other, self.queue)
+
+        if not np.issubdtype(common_dtype, np.integer):
+            raise TypeError(f"Integral types only: {common_dtype}")
+
+        if isinstance(other, Array):
+            result = _get_broadcasted_binary_op_result(self, other, self.queue)
+            result.add_event(self._array_binop(result, self, other, op="&"))
+            return result
+        elif np.isscalar(other):
+            result = self._new_like_me(common_dtype)
+            result.add_event(
+                    self._scalar_binop(result, self, other, op="&"))
+            return result
+        else:
+            return NotImplemented
+
+    __rand__ = __and__  # commutes
+
+    def __or__(self, other) -> Self:
+        common_dtype = _get_common_dtype(self, other, self.queue)
+
+        if not np.issubdtype(common_dtype, np.integer):
+            raise TypeError("Integral types only")
+
+        if isinstance(other, Array):
+            result = _get_broadcasted_binary_op_result(self, other,
+                                                       self.queue)
+            result.add_event(self._array_binop(result, self, other, op="|"))
+            return result
+        elif np.isscalar(other):
+            result = self._new_like_me(common_dtype)
+            result.add_event(
+                    self._scalar_binop(result, self, other, op="|"))
+            return result
+        else:
+            return NotImplemented
+
+    __ror__ = __or__  # commutes
+
+    def __xor__(self, other) -> Self:
+        common_dtype = _get_common_dtype(self, other, self.queue)
+
+        if not np.issubdtype(common_dtype, np.integer):
+            raise TypeError(f"Integral types only: {common_dtype}")
+
+        if isinstance(other, Array):
+            result = _get_broadcasted_binary_op_result(self, other, self.queue)
+            result.add_event(self._array_binop(result, self, other, op="^"))
+            return result
+        elif np.isscalar(other):
+            result = self._new_like_me(common_dtype)
+            result.add_event(
+                    self._scalar_binop(result, self, other, op="^"))
+            return result
+        else:
+            return NotImplemented
+
+    __rxor__ = __xor__  # commutes
+
+    def __iand__(self, other) -> Self:
+        common_dtype = _get_common_dtype(self, other, self.queue)
+
+        if not np.issubdtype(common_dtype, np.integer):
+            raise TypeError(f"Integral types only: {common_dtype}")
+
+        if isinstance(other, Array):
+            if other.shape != self.shape and other.shape != ():
+                raise NotImplementedError("Broadcasting binary op with shapes:"
+                                          f" {self.shape}, {other.shape}.")
+            self.add_event(self._array_binop(self, self, other, op="&"))
+            return self
+        elif np.isscalar(other):
+            self.add_event(
+                    self._scalar_binop(self, self, other, op="&"))
+            return self
+        else:
+            return NotImplemented
+
+    def __ior__(self, other) -> Self:
+        common_dtype = _get_common_dtype(self, other, self.queue)
+
+        if not np.issubdtype(common_dtype, np.integer):
+            raise TypeError(f"Integral types only: {common_dtype}")
+
+        if isinstance(other, Array):
+            if other.shape != self.shape and other.shape != ():
+                raise NotImplementedError("Broadcasting binary op with shapes:"
+                                          f" {self.shape}, {other.shape}.")
+            self.add_event(self._array_binop(self, self, other, op="|"))
+            return self
+        elif np.isscalar(other):
+            self.add_event(
+                    self._scalar_binop(self, self, other, op="|"))
+            return self
+        else:
+            return NotImplemented
+
+    def __ixor__(self, other) -> Self:
+        common_dtype = _get_common_dtype(self, other, self.queue)
+
+        if not np.issubdtype(common_dtype, np.integer):
+            raise TypeError(f"Integral types only: {common_dtype}")
+
+        if isinstance(other, Array):
+            if other.shape != self.shape and other.shape != ():
+                raise NotImplementedError("Broadcasting binary op with shapes:"
+                                          f" {self.shape}, {other.shape}.")
+            self.add_event(self._array_binop(self, self, other, op="^"))
+            return self
+        elif np.isscalar(other):
+            self.add_event(
+                    self._scalar_binop(self, self, other, op="^"))
+            return self
+        else:
+            return NotImplemented
+
+    def _zero_fill(self,
+                queue: cl.CommandQueue | None = None,
+                wait_for: cl.WaitList = None) -> None:
+        queue = queue or self.queue
+
+        if not self.size:
+            return
+
+        cl_version_gtr_1_2 = (
+            queue._get_cl_version() >= (1, 2)
+            and cl.get_cl_header_version() >= (1, 2)
+        )
+        on_nvidia = queue.device.vendor.startswith("NVIDIA")
+
+        # circumvent bug with large buffers on NVIDIA
+        # https://github.com/inducer/pyopencl/issues/395
+        if cl_version_gtr_1_2 and not (on_nvidia and self.nbytes >= 2**31):
+            self.add_event(
+                    cl.enqueue_fill(queue, self.base_data, np.int8(0),
+                        self.nbytes, offset=self.offset, wait_for=wait_for))
+        else:
+            zero = np.zeros((), self.dtype)
+            self.fill(zero, queue=queue)
+
+    def fill(self,
+                value: object,
+                queue: cl.CommandQueue | None = None,
+                wait_for: cl.WaitList = None) -> Self:
+        """Fill the array with *scalar*.
+
+        :returns: *self*.
+        """
+
+        self.add_event(
+                self._fill(self, value, queue=queue, wait_for=wait_for))
+
+        return self
+
+    def __len__(self) -> int:
+        """Returns the size of the leading dimension of *self*."""
+        if len(self.shape):
+            return self.shape[0]
+        else:
+            return TypeError("len() of unsized object")
+
+    def __abs__(self) -> Self:
+        """Return an ``Array`` of the absolute values of the elements
+        of *self*.
+        """
+
+        result = self._new_like_me(self.dtype.type(0).real.dtype)
+        result.add_event(self._abs(result, self))
+        return result
+
+    def __pow__(self, other) -> Self:
+        """Exponentiation by a scalar or elementwise by another
+        :class:`Array`.
+        """
+
+        if isinstance(other, Array):
+            assert self.shape == other.shape
+
+            result = self._new_like_me(
+                    _get_common_dtype(self, other, self.queue))
+            result.add_event(
+                    self._pow_array(result, self, other))
+            return result
+        elif np.isscalar(other):
+            result = self._new_like_me(
+                    _get_common_dtype(self, other, self.queue))
+            result.add_event(self._pow_scalar(result, self, other))
+            return result
+        else:
+            return NotImplemented
+
+    def __rpow__(self, other) -> Self:
+        if np.isscalar(other):
+            common_dtype = _get_common_dtype(self, other, self.queue)
+            result = self._new_like_me(common_dtype)
+            result.add_event(
+                    self._rpow_scalar(result, common_dtype.type(other), self))
+            return result
+        else:
+            return NotImplemented
+
+    def __invert__(self):
+        if not np.issubdtype(self.dtype, np.integer):
+            raise TypeError(f"Integral types only: {self.dtype}")
+
+        result = self._new_like_me()
+        result.add_event(self._unop(result, self, op="~"))
+
+        return result
+
+    # }}}
+
+    def reverse(self, queue: cl.CommandQueue | None = None) -> Self:
+        """Return this array in reversed order. The array is treated
+        as one-dimensional.
+        """
+
+        result = self._new_like_me()
+        result.add_event(self._reverse(result, self))
+        return result
+
+    def astype(self, dtype, queue: cl.CommandQueue | None = None):
+        """Return a copy of *self*, cast to *dtype*."""
+        if dtype == self.dtype:
+            return self.copy()
+
+        result = self._new_like_me(dtype=dtype)
+        result.add_event(self._copy(result, self, queue=queue))
+        return result
+
+    # {{{ rich comparisons, any, all
+
+    def __bool__(self) -> bool:
+        if self.shape == ():
+            return bool(self.get())
+        else:
+            raise ValueError("The truth value of an array with "
+                    "more than one element is ambiguous. Use a.any() or a.all()")
+
+    def any(self,
+                queue: cl.CommandQueue | None = None,
+                wait_for: cl.WaitList = None
+            ) -> Self:
+        from pyopencl.reduction import get_any_kernel
+        krnl = get_any_kernel(self.context, self.dtype)
+        if wait_for is None:
+            wait_for = []
+        result, event1 = krnl(self, queue=queue,
+               wait_for=[*wait_for, *self.events], return_event=True)
+        result.add_event(event1)
+        return result
+
+    def all(self,
+                queue: cl.CommandQueue | None = None,
+                wait_for: cl.WaitList = None
+            ) -> Self:
+        from pyopencl.reduction import get_all_kernel
+        krnl = get_all_kernel(self.context, self.dtype)
+        if wait_for is None:
+            wait_for = []
+        result, event1 = krnl(self, queue=queue,
+               wait_for=[*wait_for, *self.events], return_event=True)
+        result.add_event(event1)
+        return result
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _scalar_comparison(out, a, b, queue: cl.CommandQueue | None = None, op=None):
+        return elementwise.get_array_scalar_comparison_kernel(
+                out.context, op, a.dtype)
+
+    @staticmethod
+    @elwise_kernel_runner
+    def _array_comparison(out, a, b, queue: cl.CommandQueue | None = None, op=None):
+        if a.shape != b.shape:
+            raise ValueError("shapes of comparison arguments do not match")
+        return elementwise.get_array_comparison_kernel(
+                out.context, op, a.dtype, b.dtype)
+
+    @override
+    def __eq__(self, other: object) -> Self:  # pyright: ignore[reportIncompatibleMethodOverride]
+        if isinstance(other, Array):
+            result = self._new_like_me(_BOOL_DTYPE)
+            result.add_event(
+                    self._array_comparison(result, self, other, op="=="))
+            return result
+        elif np.isscalar(other):
+            result = self._new_like_me(_BOOL_DTYPE)
+            result.add_event(
+                    self._scalar_comparison(result, self, other, op="=="))
+            return result
+        else:
+            return NotImplemented
+
+    @override
+    def __ne__(self, other: object) -> Self:  # pyright: ignore[reportIncompatibleMethodOverride]
+        if isinstance(other, Array):
+            result = self._new_like_me(_BOOL_DTYPE)
+            result.add_event(
+                    self._array_comparison(result, self, other, op="!="))
+            return result
+        elif np.isscalar(other):
+            result = self._new_like_me(_BOOL_DTYPE)
+            result.add_event(
+                    self._scalar_comparison(result, self, other, op="!="))
+            return result
+        else:
+            return NotImplemented
+
+    def __le__(self, other) -> Self:
+        if isinstance(other, Array):
+            result = self._new_like_me(_BOOL_DTYPE)
+            result.add_event(
+                    self._array_comparison(result, self, other, op="<="))
+            return result
+        elif np.isscalar(other):
+            result = self._new_like_me(_BOOL_DTYPE)
+            self._scalar_comparison(result, self, other, op="<=")
+            return result
+        else:
+            return NotImplemented
+
+    def __ge__(self, other) -> Self:
+        if isinstance(other, Array):
+            result = self._new_like_me(_BOOL_DTYPE)
+            result.add_event(
+                    self._array_comparison(result, self, other, op=">="))
+            return result
+        elif np.isscalar(other):
+            result = self._new_like_me(_BOOL_DTYPE)
+            result.add_event(
+                    self._scalar_comparison(result, self, other, op=">="))
+            return result
+        else:
+            return NotImplemented
+
+    def __lt__(self, other) -> Self:
+        if isinstance(other, Array):
+            result = self._new_like_me(_BOOL_DTYPE)
+            result.add_event(
+                    self._array_comparison(result, self, other, op="<"))
+            return result
+        elif np.isscalar(other):
+            result = self._new_like_me(_BOOL_DTYPE)
+            result.add_event(
+                    self._scalar_comparison(result, self, other, op="<"))
+            return result
+        else:
+            return NotImplemented
+
+    def __gt__(self, other) -> Self:
+        if isinstance(other, Array):
+            result = self._new_like_me(_BOOL_DTYPE)
+            result.add_event(
+                    self._array_comparison(result, self, other, op=">"))
+            return result
+        elif np.isscalar(other):
+            result = self._new_like_me(_BOOL_DTYPE)
+            result.add_event(
+                    self._scalar_comparison(result, self, other, op=">"))
+            return result
+        else:
+            return NotImplemented
+
+    # }}}
+
+    # {{{ complex-valued business
+
+    @property
+    def real(self) -> Self:
+        """
+        .. versionadded:: 2012.1
+        """
+        if self.dtype.kind == "c":
+            result = self._new_like_me(self.dtype.type(0).real.dtype)
+            result.add_event(
+                    self._real(result, self))
+            return result
+        else:
+            return self
+
+    @property
+    def imag(self) -> Self:
+        """
+        .. versionadded:: 2012.1
+        """
+        if self.dtype.kind == "c":
+            result = self._new_like_me(self.dtype.type(0).real.dtype)
+            result.add_event(
+                    self._imag(result, self))
+            return result
+        else:
+            return zeros_like(self)
+
+    def conj(self) -> Self:
+        """
+        .. versionadded:: 2012.1
+        """
+        if self.dtype.kind == "c":
+            result = self._new_like_me()
+            result.add_event(self._conj(result, self))
+            return result
+        else:
+            return self
+
+    conjugate = conj
+
+    # }}}
+
+    # {{{ event management
+
+    def add_event(self, evt: cl.Event) -> None:
+        """Add *evt* to :attr:`events`. If :attr:`events` is too long, this method
+        may implicitly wait for a subset of :attr:`events` and clear them from the
+        list.
+        """
+        n_wait = 4
+
+        self.events.append(evt)
+
+        if len(self.events) > 3*n_wait:
+            wait_events = self.events[:n_wait]
+            cl.wait_for_events(wait_events)
+            del self.events[:n_wait]
+
+    def finish(self) -> None:
+        """Wait for the entire contents of :attr:`events`, clear it."""
+
+        if self.events:
+            cl.wait_for_events(self.events)
+            del self.events[:]
+
+    # }}}
+
+    # {{{ views
+
+    def reshape(self, *shape, **kwargs):
+        """Returns an array containing the same data with a new shape."""
+
+        order = kwargs.pop("order", "C")
+        if kwargs:
+            raise TypeError("unexpected keyword arguments: %s"
+                    % list(kwargs.keys()))
+
+        if order not in "CF":
+            raise ValueError("order must be either 'C' or 'F'")
+
+        # TODO: add more error-checking, perhaps
+
+        # FIXME: The following is overly conservative. As long as we don't change
+        # our memory footprint, we're good.
+
+        # if not self.flags.forc:
+        #     raise RuntimeError("only contiguous arrays may "
+        #             "be used as arguments to this operation")
+
+        if isinstance(shape[0], tuple) or isinstance(shape[0], list):
+            shape = tuple(shape[0])
+
+        if -1 in shape:
+            shape = list(shape)
+            idx = shape.index(-1)
+            size = -reduce(lambda x, y: x * y, shape, 1)
+            if size == 0:
+                shape[idx] = 0
+            else:
+                shape[idx] = self.size // size
+            if builtins.any(s < 0 for s in shape):
+                raise ValueError("can only specify one unknown dimension")
+            shape = tuple(shape)
+
+        if shape == self.shape:
+            return self._new_with_changes(
+                    data=self.base_data, offset=self.offset, shape=shape,
+                    strides=self.strides)
+
+        import operator
+        size = reduce(operator.mul, shape, 1)
+        if size != self.size:
+            raise ValueError("total size of new array must be unchanged")
+
+        if self.size == 0:
+            return self._new_with_changes(
+                    data=None, offset=0, shape=shape,
+                    strides=(
+                        _f_contiguous_strides(self.dtype.itemsize, shape)
+                        if order == "F" else
+                        _c_contiguous_strides(self.dtype.itemsize, shape)
+                        ))
+
+        # {{{ determine reshaped strides
+
+        # copied and translated from
+        # https://github.com/numpy/numpy/blob/4083883228d61a3b571dec640185b5a5d983bf59/numpy/core/src/multiarray/shape.c  # noqa: E501
+
+        newdims = shape
+        newnd = len(newdims)
+
+        # Remove axes with dimension 1 from the old array. They have no effect
+        # but would need special cases since their strides do not matter.
+
+        olddims = []
+        oldstrides = []
+        for oi in range(len(self.shape)):
+            s = self.shape[oi]
+            if s != 1:
+                olddims.append(s)
+                oldstrides.append(self.strides[oi])
+
+        oldnd = len(olddims)
+
+        newstrides = [-1]*len(newdims)
+
+        # oi to oj and ni to nj give the axis ranges currently worked with
+        oi = 0
+        oj = 1
+        ni = 0
+        nj = 1
+        while ni < newnd and oi < oldnd:
+            np = newdims[ni]
+            op = olddims[oi]
+
+            while np != op:
+                if np < op:
+                    # Misses trailing 1s, these are handled later
+                    np *= newdims[nj]
+                    nj += 1
+                else:
+                    op *= olddims[oj]
+                    oj += 1
+
+            # Check whether the original axes can be combined
+            for ok in range(oi, oj-1):
+                if order == "F":
+                    if oldstrides[ok+1] != olddims[ok]*oldstrides[ok]:
+                        raise ValueError("cannot reshape without copy")
+                else:
+                    # C order
+                    if (oldstrides[ok] != olddims[ok+1]*oldstrides[ok+1]):
+                        raise ValueError("cannot reshape without copy")
+
+            # Calculate new strides for all axes currently worked with
+            if order == "F":
+                newstrides[ni] = oldstrides[oi]
+                for nk in range(ni+1, nj):
+                    newstrides[nk] = newstrides[nk - 1]*newdims[nk - 1]
+            else:
+                # C order
+                newstrides[nj - 1] = oldstrides[oj - 1]
+                for nk in range(nj-1, ni, -1):
+                    newstrides[nk - 1] = newstrides[nk]*newdims[nk]
+
+            ni = nj
+            nj += 1
+
+            oi = oj
+            oj += 1
+
+        # Set strides corresponding to trailing 1s of the new shape.
+        if ni >= 1:
+            last_stride = newstrides[ni - 1]
+        else:
+            last_stride = self.dtype.itemsize
+
+        if order == "F":
+            last_stride *= newdims[ni - 1]
+
+        for nk in range(ni, len(shape)):
+            newstrides[nk] = last_stride
+
+        # }}}
+
+        return self._new_with_changes(
+                data=self.base_data, offset=self.offset, shape=shape,
+                strides=tuple(newstrides))
+
+    def ravel(self, order="C"):
+        """Returns flattened array containing the same data."""
+        return self.reshape(self.size, order=order)
+
+    def view(self, dtype=None):
+        """Returns view of array with the same data. If *dtype* is different
+        from current dtype, the actual bytes of memory will be reinterpreted.
+        """
+
+        if dtype is None:
+            dtype = self.dtype
+
+        old_itemsize = self.dtype.itemsize
+        itemsize = np.dtype(dtype).itemsize
+
+        from pytools import argmin2
+        min_stride_axis = argmin2(
+                (axis, abs(stride))
+                for axis, stride in enumerate(self.strides))
+
+        if self.shape[min_stride_axis] * old_itemsize % itemsize != 0:
+            raise ValueError("new type not compatible with array")
+
+        new_shape = (
+                *self.shape[:min_stride_axis],
+                self.shape[min_stride_axis] * old_itemsize // itemsize,
+                *self.shape[min_stride_axis+1:])
+        new_strides = (
+                *self.strides[:min_stride_axis],
+                self.strides[min_stride_axis] * itemsize // old_itemsize,
+                *self.strides[min_stride_axis+1:])
+
+        return self._new_with_changes(
+                self.base_data, self.offset,
+                shape=new_shape, dtype=dtype,
+                strides=new_strides)
+
+    def squeeze(self):
+        """Returns a view of the array with dimensions of
+        length 1 removed.
+
+        .. versionadded:: 2015.2
+        """
+        new_shape = tuple(dim for dim in self.shape if dim > 1)
+        new_strides = tuple(
+            self.strides[i] for i, dim in enumerate(self.shape)
+            if dim > 1)
+
+        return self._new_with_changes(
+                self.base_data, self.offset,
+                shape=new_shape, strides=new_strides)
+
+    def transpose(self, axes=None):
+        """Permute the dimensions of an array.
+
+        :arg axes: list of ints, optional.
+            By default, reverse the dimensions, otherwise permute the axes
+            according to the values given.
+
+        :returns: :class:`Array` A view of the array with its axes permuted.
+
+        .. versionadded:: 2015.2
+        """
+
+        if axes is None:
+            axes = range(self.ndim-1, -1, -1)
+
+        if len(axes) != len(self.shape):
+            raise ValueError("axes don't match array")
+
+        new_shape = [self.shape[axes[i]] for i in range(len(axes))]
+        new_strides = [self.strides[axes[i]] for i in range(len(axes))]
+
+        return self._new_with_changes(
+                self.base_data, self.offset,
+                shape=tuple(new_shape),
+                strides=tuple(new_strides))
+
+    @property
+    def T(self):  # noqa: N802
+        """
+        .. versionadded:: 2015.2
+        """
+        return self.transpose()
+
+    # }}}
+
+    def map_to_host(self,
+                queue: cl.CommandQueue | None = None,
+                flags=None,
+                is_blocking: bool = True,
+                wait_for: cl.WaitList = None):
+        """If *is_blocking*, return a :class:`numpy.ndarray` corresponding to the
+        same memory as *self*.
+
+        If *is_blocking* is not true, return a tuple ``(ary, evt)``, where
+        *ary* is the above-mentioned array.
+
+        The host array is obtained using :func:`pyopencl.enqueue_map_buffer`.
+        See there for further details.
+
+        :arg flags: A combination of :class:`pyopencl.map_flags`.
+            Defaults to read-write.
+
+        .. versionadded :: 2013.2
+        """
+
+        if flags is None:
+            flags = cl.map_flags.READ | cl.map_flags.WRITE
+        if wait_for is None:
+            wait_for = []
+
+        ary, evt = cl.enqueue_map_buffer(
+                queue or self.queue, self.base_data, flags, self.offset,
+                self.shape, self.dtype, strides=self.strides,
+                wait_for=[*wait_for, *self.events], is_blocking=is_blocking)
+
+        if is_blocking:
+            return ary
+        else:
+            return ary, evt
+
+    # {{{ getitem/setitem
+
+    def __getitem__(self, index):
+        """
+        .. versionadded:: 2013.1
+        """
+
+        if isinstance(index, Array):
+            if index.dtype.kind not in ("i", "u"):
+                raise TypeError(
+                        "fancy indexing is only allowed with integers")
+            if len(index.shape) != 1:
+                raise NotImplementedError(
+                        "multidimensional fancy indexing is not supported")
+            if len(self.shape) != 1:
+                raise NotImplementedError(
+                        "fancy indexing into a multi-d array is not supported")
+
+            return take(self, index)
+
+        if not isinstance(index, tuple):
+            index = (index,)
+
+        new_shape = []
+        new_offset = self.offset
+        new_strides = []
+
+        seen_ellipsis = False
+
+        index_axis = 0
+        array_axis = 0
+        while index_axis < len(index):
+            index_entry = index[index_axis]
+
+            if array_axis > len(self.shape):
+                raise IndexError("too many axes in index")
+
+            if isinstance(index_entry, slice):
+                start, stop, idx_stride = index_entry.indices(
+                        self.shape[array_axis])
+
+                array_stride = self.strides[array_axis]
+
+                new_shape.append((abs(stop-start)-1)//abs(idx_stride)+1)
+                new_strides.append(idx_stride*array_stride)
+                new_offset += array_stride*start
+
+                index_axis += 1
+                array_axis += 1
+
+            elif isinstance(index_entry, (int, np.integer)):
+                array_shape = self.shape[array_axis]
+                if index_entry < 0:
+                    index_entry += array_shape
+
+                if not (0 <= index_entry < array_shape):
+                    raise IndexError(
+                            "subindex in axis %d out of range" % index_axis)
+
+                new_offset += self.strides[array_axis]*index_entry
+
+                index_axis += 1
+                array_axis += 1
+
+            elif index_entry is Ellipsis:
+                index_axis += 1
+
+                remaining_index_count = len(index) - index_axis
+                new_array_axis = len(self.shape) - remaining_index_count
+                if new_array_axis < array_axis:
+                    raise IndexError("invalid use of ellipsis in index")
+                while array_axis < new_array_axis:
+                    new_shape.append(self.shape[array_axis])
+                    new_strides.append(self.strides[array_axis])
+                    array_axis += 1
+
+                if seen_ellipsis:
+                    raise IndexError(
+                            "more than one ellipsis not allowed in index")
+                seen_ellipsis = True
+
+            elif index_entry is np.newaxis:
+                new_shape.append(1)
+                new_strides.append(0)
+                index_axis += 1
+
+            else:
+                raise IndexError("invalid subindex in axis %d" % index_axis)
+
+        while array_axis < len(self.shape):
+            new_shape.append(self.shape[array_axis])
+            new_strides.append(self.strides[array_axis])
+
+            array_axis += 1
+
+        return self._new_with_changes(
+                self.base_data, offset=new_offset,
+                shape=tuple(new_shape),
+                strides=tuple(new_strides))
+
+    def setitem(self,
+                subscript: Array | slice | int,
+                value: object,
+                queue: cl.CommandQueue | None = None,
+                wait_for: cl.WaitList = None
+            ):
+        """Like :meth:`__setitem__`, but with the ability to specify
+        a *queue* and *wait_for*.
+
+        .. versionadded:: 2013.1
+
+        .. versionchanged:: 2013.2
+
+            Added *wait_for*.
+        """
+
+        queue = queue or self.queue
+        assert queue is not None
+        if wait_for is None:
+            wait_for = []
+        wait_for = [*wait_for, *self.events]
+
+        if isinstance(subscript, Array):
+            if subscript.dtype.kind not in ("i", "u"):
+                raise TypeError(
+                        "fancy indexing is only allowed with integers")
+            if len(subscript.shape) != 1:
+                raise NotImplementedError(
+                        "multidimensional fancy indexing is not supported")
+            if len(self.shape) != 1:
+                raise NotImplementedError(
+                        "fancy indexing into a multi-d array is not supported")
+
+            multi_put([value], subscript, out=[self], queue=queue,
+                    wait_for=wait_for)
+            return
+
+        subarray = self[subscript]
+
+        if not subarray.size:
+            # This prevents errors about mismatched strides that neither we
+            # nor numpy worry about in the empty case.
+            return
+
+        if isinstance(value, np.ndarray):
+            if subarray.shape == value.shape and subarray.strides == value.strides:
+                assert subarray.base_data is not None
+                self.add_event(
+                        cl.enqueue_copy(queue, subarray.base_data,
+                            value, dst_offset=subarray.offset, wait_for=wait_for))
+                return
+            else:
+                value = to_device(queue, value, self.allocator)
+
+        if isinstance(value, Array):
+            if len(subarray.shape) != len(value.shape):
+                raise NotImplementedError("broadcasting is not "
+                        "supported in __setitem__")
+            if subarray.shape != value.shape:
+                raise ValueError("cannot assign between arrays of "
+                        "differing shapes")
+            if subarray.strides != value.strides:
+                raise NotImplementedError("cannot assign between arrays of "
+                        "differing strides")
+
+            self.add_event(
+                    self._copy(subarray, value, queue=queue, wait_for=wait_for))
+
+        else:
+            # Let's assume it's a scalar
+            subarray.fill(value, queue=queue, wait_for=wait_for)
+
+    def __setitem__(self, subscript, value):
+        """Set the slice of *self* identified *subscript* to *value*.
+
+        *value* is allowed to be:
+
+        * A :class:`Array` of the same :attr:`shape` and (for now) :attr:`strides`,
+          but with potentially different :attr:`dtype`.
+        * A :class:`numpy.ndarray` of the same :attr:`shape` and (for now)
+          :attr:`strides`, but with potentially different :attr:`dtype`.
+        * A scalar.
+
+        Non-scalar broadcasting is not currently supported.
+
+        .. versionadded:: 2013.1
+        """
+        self.setitem(subscript, value)
+
+    # }}}
+
+# }}}
+
+
+# {{{ creation helpers
+
+def as_strided(ary, shape=None, strides=None):
+    """Make an :class:`Array` from the given array with the given
+    shape and strides.
+    """
+
+    # undocumented for the moment
+
+    if shape is None:
+        shape = ary.shape
+    if strides is None:
+        strides = ary.strides
+
+    return Array(ary.queue, shape, ary.dtype, allocator=ary.allocator,
+            data=ary.data, strides=strides)
+
+
+class _same_as_transfer:  # noqa: N801
+    pass
+
+
+def to_device(
+            queue: cl.CommandQueue,
+            ary: NDArray[Any],
+            allocator: Allocator | None = None,
+            async_: bool = False,
+            array_queue=_same_as_transfer,
+        ) -> Array:
+    """Return a :class:`Array` that is an exact copy of the
+    :class:`numpy.ndarray` instance *ary*.
+
+    :arg array_queue: The :class:`~pyopencl.CommandQueue` which will
+        be stored in the resulting array. Useful
+        to make sure there is no implicit queue associated
+        with the array by passing *None*.
+
+    See :class:`Array` for the meaning of *allocator*.
+
+    .. versionchanged:: 2015.2
+        *array_queue* argument was added.
+    """
+
+    if ary.dtype == object:
+        raise RuntimeError("to_device does not work on object arrays.")
+
+    if array_queue is _same_as_transfer:
+        first_arg = queue
+    else:
+        first_arg = queue.context
+
+    result = Array(first_arg, ary.shape, ary.dtype,
+                    allocator=allocator, strides=ary.strides)
+    result.set(ary, async_=async_, queue=queue)
+    return result
+
+
+empty = Array
+
+
+def zeros(
+            queue: cl.CommandQueue,
+            shape: int | tuple[int, ...],
+            dtype: DTypeLike,
+            order: Literal["C"] | Literal["F"] = "C",
+            allocator: Allocator | None = None,
+        ) -> Array:
+    """Same as :func:`empty`, but the :class:`Array` is zero-initialized before
+    being returned.
+
+    .. versionchanged:: 2011.1
+        *context* argument was deprecated.
+    """
+
+    result = Array(None, shape, dtype,
+            order=order, allocator=allocator,
+            _context=queue.context, _queue=queue)
+    result._zero_fill()
+    return result
+
+
+def empty_like(
+            ary: Array,
+            queue: cl.CommandQueue | type[_copy_queue] | None = _copy_queue,
+            allocator: Allocator | None = None,
+        ):
+    """Make a new, uninitialized :class:`Array` having the same properties
+    as *other_ary*.
+    """
+
+    return ary._new_with_changes(data=None, offset=0, queue=queue,
+            allocator=allocator)
+
+
+def zeros_like(ary):
+    """Make a new, zero-initialized :class:`Array` having the same properties
+    as *other_ary*.
+    """
+
+    result = ary._new_like_me()
+    result._zero_fill()
+    return result
+
+
+@dataclass
+class _ArangeInfo:
+    start: int | None = None
+    stop: int | None = None
+    step: int | None = None
+    dtype: np.dtype | None = None
+    allocator: Any | None = None
+
+
+@elwise_kernel_runner
+def _arange_knl(result, start, step):
+    return elementwise.get_arange_kernel(
+            result.context, result.dtype)
+
+
+def arange(queue: cl.CommandQueue, *args: Any, **kwargs: Any) -> Array:
+    """arange(queue, [start, ] stop [, step], **kwargs)
+    Create a :class:`Array` filled with numbers spaced *step* apart,
+    starting from *start* and ending at *stop*. If not given, *start*
+    defaults to 0, *step* defaults to 1.
+
+    For floating point arguments, the length of the result is
+    ``ceil((stop - start)/step)``.  This rule may result in the last
+    element of the result being greater than *stop*.
+
+    *dtype* is a required keyword argument.
+
+    .. versionchanged:: 2011.1
+        *context* argument was deprecated.
+
+    .. versionchanged:: 2011.2
+        *allocator* keyword argument was added.
+    """
+
+    # {{{ argument processing
+
+    # Yuck. Thanks, numpy developers. ;)
+
+    explicit_dtype = False
+    inf = _ArangeInfo()
+
+    if isinstance(args[-1], np.dtype):
+        inf.dtype = args[-1]
+        args = args[:-1]
+        explicit_dtype = True
+
+    argc = len(args)
+    if argc == 0:
+        raise ValueError("stop argument required")
+    elif argc == 1:
+        inf.stop = args[0]
+    elif argc == 2:
+        inf.start = args[0]
+        inf.stop = args[1]
+    elif argc == 3:
+        inf.start = args[0]
+        inf.stop = args[1]
+        inf.step = args[2]
+    else:
+        raise ValueError("too many arguments")
+
+    admissible_names = ["start", "stop", "step", "dtype", "allocator"]
+    for k, v in kwargs.items():
+        if k in admissible_names:
+            if getattr(inf, k) is None:
+                setattr(inf, k, v)
+                if k == "dtype":
+                    explicit_dtype = True
+            else:
+                raise ValueError(f"may not specify '{k}' by position and keyword")
+        else:
+            raise ValueError(f"unexpected keyword argument '{k}'")
+
+    if inf.start is None:
+        inf.start = 0
+    if inf.step is None:
+        inf.step = 1
+    if inf.dtype is None:
+        inf.dtype = np.array([inf.start, inf.stop, inf.step]).dtype
+
+    # }}}
+
+    # {{{ actual functionality
+
+    dtype = np.dtype(inf.dtype)
+    start = dtype.type(inf.start)
+    step = dtype.type(inf.step)
+    stop = dtype.type(inf.stop)
+
+    if not explicit_dtype:
+        raise TypeError("arange requires a dtype argument")
+
+    from math import ceil
+    size = ceil((stop-start)/step)
+
+    result = Array(queue, (size,), dtype, allocator=inf.allocator)
+    result.add_event(_arange_knl(result, start, step, queue=queue))
+
+    # }}}
+
+    return result
+
+# }}}
+
+
+# {{{ take/put/concatenate/diff/(h?stack)
+
+@elwise_kernel_runner
+def _take(result, ary, indices):
+    return elementwise.get_take_kernel(
+            result.context, result.dtype, indices.dtype)
+
+
+def take(
+             a: Array,
+             indices: Array,
+             out: Array | None = None,
+             queue: cl.CommandQueue | None = None,
+             wait_for: cl.WaitList = None
+         ) -> Array:
+    """Return the :class:`Array` ``[a[indices[0]], ..., a[indices[n]]]``.
+    For the moment, *a* must be a type that can be bound to a texture.
+    """
+
+    queue = queue or a.queue
+    if out is None:
+        out = type(a)(queue, indices.shape, a.dtype, allocator=a.allocator)
+
+    assert len(indices.shape) == 1
+    out.add_event(
+            _take(out, a, indices, queue=queue, wait_for=wait_for))
+    return out
+
+
+def multi_take(arrays, indices, out=None, queue: cl.CommandQueue | None = None):
+    if not len(arrays):
+        return []
+
+    assert len(indices.shape) == 1
+
+    from pytools import single_valued
+    a_dtype = single_valued(a.dtype for a in arrays)
+    a_allocator = arrays[0].dtype
+    context = indices.context
+    queue = queue or indices.queue
+
+    vec_count = len(arrays)
+
+    if out is None:
+        out = [
+            type(arrays[i])(
+                context, queue, indices.shape, a_dtype,
+                allocator=a_allocator)
+            for i in range(vec_count)]
+    else:
+        if len(out) != len(arrays):
+            raise ValueError("out and arrays must have the same length")
+
+    chunk_size = builtins.min(vec_count, 10)
+
+    def make_func_for_chunk_size(chunk_size):
+        knl = elementwise.get_take_kernel(
+                indices.context, a_dtype, indices.dtype,
+                vec_count=chunk_size)
+        knl.set_block_shape(*indices._block)
+        return knl
+
+    knl = make_func_for_chunk_size(chunk_size)
+
+    for start_i in range(0, len(arrays), chunk_size):
+        chunk_slice = slice(start_i, start_i+chunk_size)
+
+        if start_i + chunk_size > vec_count:
+            knl = make_func_for_chunk_size(vec_count-start_i)
+
+        gs, ls = indices._get_sizes(queue,
+                knl.get_work_group_info(
+                    cl.kernel_work_group_info.WORK_GROUP_SIZE,
+                    queue.device))
+
+        wait_for_this = (
+            *indices.events,
+            *[evt for i in arrays[chunk_slice] for evt in i.events],
+            *[evt for o in out[chunk_slice] for evt in o.events])
+        evt = knl(queue, gs, ls,
+                indices.data,
+                *[o.data for o in out[chunk_slice]],
+                *[i.data for i in arrays[chunk_slice]],
+                *[indices.size],
+                wait_for=wait_for_this)
+        for o in out[chunk_slice]:
+            o.add_event(evt)
+
+    return out
+
+
+def multi_take_put(arrays, dest_indices, src_indices, dest_shape=None,
+        out=None, queue: cl.CommandQueue | None = None, src_offsets=None):
+    if not len(arrays):
+        return []
+
+    from pytools import single_valued
+    a_dtype = single_valued(a.dtype for a in arrays)
+    a_allocator = arrays[0].allocator
+    context = src_indices.context
+    queue = queue or src_indices.queue
+
+    vec_count = len(arrays)
+
+    if out is None:
+        out = [type(arrays[i])(queue, dest_shape, a_dtype, allocator=a_allocator)
+                for i in range(vec_count)]
+    else:
+        if a_dtype != single_valued(o.dtype for o in out):
+            raise TypeError("arrays and out must have the same dtype")
+        if len(out) != vec_count:
+            raise ValueError("out and arrays must have the same length")
+
+    if src_indices.dtype != dest_indices.dtype:
+        raise TypeError(
+                "src_indices and dest_indices must have the same dtype")
+
+    if len(src_indices.shape) != 1:
+        raise ValueError("src_indices must be 1D")
+
+    if src_indices.shape != dest_indices.shape:
+        raise ValueError(
+                "src_indices and dest_indices must have the same shape")
+
+    if src_offsets is None:
+        src_offsets_list = []
+    else:
+        src_offsets_list = src_offsets
+        if len(src_offsets) != vec_count:
+            raise ValueError(
+                    "src_indices and src_offsets must have the same length")
+
+    max_chunk_size = 10
+
+    chunk_size = builtins.min(vec_count, max_chunk_size)
+
+    def make_func_for_chunk_size(chunk_size):
+        return elementwise.get_take_put_kernel(context,
+                a_dtype, src_indices.dtype,
+                with_offsets=src_offsets is not None,
+                vec_count=chunk_size)
+
+    knl = make_func_for_chunk_size(chunk_size)
+
+    for start_i in range(0, len(arrays), chunk_size):
+        chunk_slice = slice(start_i, start_i+chunk_size)
+
+        if start_i + chunk_size > vec_count:
+            knl = make_func_for_chunk_size(vec_count-start_i)
+
+        gs, ls = src_indices._get_sizes(queue,
+                knl.get_work_group_info(
+                    cl.kernel_work_group_info.WORK_GROUP_SIZE,
+                    queue.device))
+
+        wait_for_this = (
+            *dest_indices.events,
+            *src_indices.events,
+            *[evt for i in arrays[chunk_slice] for evt in i.events],
+            *[evt for o in out[chunk_slice] for evt in o.events])
+        evt = knl(queue, gs, ls,
+                  *out[chunk_slice],
+                  dest_indices,
+                  src_indices,
+                  *arrays[chunk_slice],
+                  *src_offsets_list[chunk_slice],
+                  src_indices.size,
+                  wait_for=wait_for_this)
+        for o in out[chunk_slice]:
+            o.add_event(evt)
+
+    return out
+
+
+def multi_put(
+            arrays,
+            dest_indices: Array,
+            dest_shape=None,
+            out=None,
+            queue: cl.CommandQueue | None = None,
+            wait_for: cl.WaitList = None
+        ):
+    if not len(arrays):
+        return []
+
+    from pytools import single_valued
+    a_dtype = single_valued(a.dtype for a in arrays)
+    a_allocator = arrays[0].allocator
+    context = dest_indices.context
+    queue = queue or dest_indices.queue
+    assert queue is not None
+    if wait_for is None:
+        wait_for = []
+    wait_for = [*wait_for, *dest_indices.events]
+
+    vec_count = len(arrays)
+
+    if out is None:
+        out = [type(arrays[i])(queue, dest_shape, a_dtype, allocator=a_allocator)
+                for i in range(vec_count)]
+    else:
+        if a_dtype != single_valued(o.dtype for o in out):
+            raise TypeError("arrays and out must have the same dtype")
+        if len(out) != vec_count:
+            raise ValueError("out and arrays must have the same length")
+
+    if len(dest_indices.shape) != 1:
+        raise ValueError("dest_indices must be 1D")
+
+    chunk_size = builtins.min(vec_count, 10)
+
+    # array of bools to specify whether the array of same index in this chunk
+    # will be filled with a single value.
+    use_fill = np.ndarray((chunk_size,), dtype=np.uint8)
+    array_lengths = np.ndarray((chunk_size,), dtype=np.int64)
+
+    def make_func_for_chunk_size(chunk_size):
+        knl = elementwise.get_put_kernel(
+                context, a_dtype, dest_indices.dtype,
+                vec_count=chunk_size)
+        return knl
+
+    knl = make_func_for_chunk_size(chunk_size)
+
+    for start_i in range(0, len(arrays), chunk_size):
+        chunk_slice = slice(start_i, start_i+chunk_size)
+        for fill_idx, ary in enumerate(arrays[chunk_slice]):
+            # If there is only one value in the values array for this src array
+            # in the chunk then fill every index in `dest_idx` array with it.
+            use_fill[fill_idx] = 1 if ary.size == 1 else 0
+            array_lengths[fill_idx] = len(ary)
+        # Copy the populated `use_fill` array to a buffer on the device.
+        use_fill_cla = to_device(queue, use_fill)
+        array_lengths_cla = to_device(queue, array_lengths)
+
+        if start_i + chunk_size > vec_count:
+            knl = make_func_for_chunk_size(vec_count-start_i)
+
+        gs, ls = dest_indices._get_sizes(queue,
+                knl.get_work_group_info(
+                    cl.kernel_work_group_info.WORK_GROUP_SIZE,
+                    queue.device))
+
+        wait_for_this = (
+            *wait_for,
+            *[evt for i in arrays[chunk_slice] for evt in i.events],
+            *[evt for o in out[chunk_slice] for evt in o.events])
+        evt = knl(queue, gs, ls,
+                  *out[chunk_slice],
+                  dest_indices,
+                  *arrays[chunk_slice],
+                  use_fill_cla, array_lengths_cla, dest_indices.size,
+                  wait_for=wait_for_this)
+
+        for o in out[chunk_slice]:
+            o.add_event(evt)
+
+    return out
+
+
+def concatenate(arrays, axis=0, queue: cl.CommandQueue | None = None, allocator=None):
+    """
+    .. versionadded:: 2013.1
+
+    .. note::
+
+        The returned array is of the same type as the first array in the list.
+    """
+    if not arrays:
+        raise ValueError("need at least one array to concatenate")
+
+    # {{{ find properties of result array
+
+    shape = None
+
+    for i_ary, ary in enumerate(arrays):
+        queue = queue or ary.queue
+        allocator = allocator or ary.allocator
+
+        if shape is None:
+            # first array
+            shape = list(ary.shape)
+        else:
+            if len(ary.shape) != len(shape):
+                raise ValueError(
+                    f"{i_ary}-th array has different number of axes: "
+                    f"expected {len(ary.shape)}, got {len(shape)})")
+
+            ary_shape_list = list(ary.shape)
+            if (ary_shape_list[:axis] != shape[:axis]
+                    or ary_shape_list[axis+1:] != shape[axis+1:]):
+                raise ValueError(
+                    f"{i_ary}-th array has residual not matching other arrays")
+
+            # pylint: disable=unsupported-assignment-operation
+            shape[axis] += ary.shape[axis]
+
+    # }}}
+
+    shape = tuple(shape)
+    dtype = np.result_type(*[ary.dtype for ary in arrays])
+
+    if __debug__:
+        if builtins.any(type(ary) != type(arrays[0])  # noqa: E721
+                        for ary in arrays[1:]):
+            warn("Elements of 'arrays' not of the same type, returning "
+                 "an instance of the type of arrays[0]",
+                 stacklevel=2)
+
+    result = arrays[0].__class__(queue, shape, dtype, allocator=allocator)
+
+    full_slice = (slice(None),) * len(shape)
+
+    base_idx = 0
+    for ary in arrays:
+        my_len = ary.shape[axis]
+        result.setitem(
+                (*full_slice[:axis],
+                    slice(base_idx, base_idx+my_len),
+                    *full_slice[axis+1:]),
+                ary)
+
+        base_idx += my_len
+
+    return result
+
+
+@elwise_kernel_runner
+def _diff(result, array):
+    return elementwise.get_diff_kernel(array.context, array.dtype)
+
+
+def diff(array, queue: cl.CommandQueue | None = None, allocator=None):
+    """
+    .. versionadded:: 2013.2
+    """
+
+    if len(array.shape) != 1:
+        raise ValueError("multi-D arrays are not supported")
+
+    n, = array.shape
+
+    queue = queue or array.queue
+    allocator = allocator or array.allocator
+
+    result = array.__class__(queue, (n-1,), array.dtype, allocator=allocator)
+    event1 = _diff(result, array, queue=queue)
+    result.add_event(event1)
+    return result
+
+
+def hstack(arrays, queue: cl.CommandQueue | None = None):
+    if len(arrays) == 0:
+        raise ValueError("need at least one array to hstack")
+
+    if queue is None:
+        for ary in arrays:
+            if ary.queue is not None:
+                queue = ary.queue
+                break
+
+    from pytools import all_equal, single_valued
+    if not all_equal(len(ary.shape) for ary in arrays):
+        raise ValueError("arguments must all have the same number of axes")
+
+    lead_shape = single_valued(ary.shape[:-1] for ary in arrays)
+
+    w = builtins.sum(ary.shape[-1] for ary in arrays)
+
+    if __debug__:
+        if builtins.any(type(ary) != type(arrays[0])  # noqa: E721
+                        for ary in arrays[1:]):
+            warn("Elements of 'arrays' not of the same type, returning "
+                 "an instance of the type of arrays[0]",
+                 stacklevel=2)
+
+    result = arrays[0].__class__(queue, (*lead_shape, w), arrays[0].dtype,
+                                 allocator=arrays[0].allocator)
+    index = 0
+    for ary in arrays:
+        result[..., index:index+ary.shape[-1]] = ary
+        index += ary.shape[-1]
+
+    return result
+
+
+def stack(arrays, axis=0, queue: cl.CommandQueue | None = None):
+    """
+    Join a sequence of arrays along a new axis.
+
+    :arg arrays: A sequence of :class:`Array`.
+    :arg axis: Index of the dimension of the new axis in the result array.
+        Can be -1, for the new axis to be last dimension.
+
+    :returns: :class:`Array`
+    """
+    if not arrays:
+        raise ValueError("need at least one array to stack")
+
+    input_shape = arrays[0].shape
+    input_ndim = arrays[0].ndim
+    axis = input_ndim if axis == -1 else axis
+
+    if queue is None:
+        for ary in arrays:
+            if ary.queue is not None:
+                queue = ary.queue
+                break
+
+    if not builtins.all(ary.shape == input_shape for ary in arrays[1:]):
+        raise ValueError("arrays must have the same shape")
+
+    if not (0 <= axis <= input_ndim):
+        raise ValueError("invalid axis")
+
+    if (axis == 0 and not builtins.all(
+            ary.flags.c_contiguous for ary in arrays)):
+        # pyopencl.Array.__setitem__ does not support non-contiguous assignments
+        raise NotImplementedError
+
+    if (axis == input_ndim and not builtins.all(
+            ary.flags.f_contiguous for ary in arrays)):
+        # pyopencl.Array.__setitem__ does not support non-contiguous assignments
+        raise NotImplementedError
+
+    result_shape = (*input_shape[:axis], len(arrays), *input_shape[axis:])
+
+    if __debug__:
+        if builtins.any(type(ary) != type(arrays[0])  # noqa: E721
+                        for ary in arrays[1:]):
+            warn("Elements of 'arrays' not of the same type, returning "
+                 "an instance of the type of arrays[0]",
+                 stacklevel=2)
+
+    result = arrays[0].__class__(queue, result_shape,
+                                 np.result_type(*(ary.dtype
+                                                  for ary in arrays)),
+                                 # TODO: reconsider once arrays support
+                                 # non-contiguous assignments
+                                 order="C" if axis == 0 else "F",
+                                 allocator=arrays[0].allocator)
+    for i, ary in enumerate(arrays):
+        idx = (slice(None),)*axis + (i,) + (slice(None),)*(input_ndim-axis)
+        result[idx] = ary
+
+    return result
+
+# }}}
+
+
+# {{{ shape manipulation
+
+def transpose(a, axes=None):
+    """Permute the dimensions of an array.
+
+    :arg a: :class:`Array`
+    :arg axes: list of ints, optional.
+        By default, reverse the dimensions, otherwise permute the axes
+        according to the values given.
+
+    :returns: :class:`Array` A view of the array with its axes permuted.
+    """
+    return a.transpose(axes)
+
+
+def reshape(a, shape):
+    """Gives a new shape to an array without changing its data.
+
+    .. versionadded:: 2015.2
+    """
+
+    return a.reshape(shape)
+
+# }}}
+
+
+# {{{ conditionals
+
+@elwise_kernel_runner
+def _if_positive(result, criterion, then_, else_):
+    return elementwise.get_if_positive_kernel(
+            result.context, criterion.dtype, then_.dtype,
+            is_then_array=isinstance(then_, Array),
+            is_else_array=isinstance(else_, Array),
+            is_then_scalar=then_.shape == (),
+            is_else_scalar=else_.shape == (),
+            )
+
+
+def if_positive(
+            criterion,
+            then_,
+            else_,
+            out=None,
+            queue: cl.CommandQueue | None = None):
+    """Return an array like *then_*, which, for the element at index *i*,
+    contains *then_[i]* if *criterion[i]>0*, else *else_[i]*.
+    """
+
+    is_then_scalar = isinstance(then_, SCALAR_CLASSES)
+    is_else_scalar = isinstance(else_, SCALAR_CLASSES)
+    if isinstance(criterion, SCALAR_CLASSES) and is_then_scalar and is_else_scalar:
+        result = np.where(criterion, then_, else_)
+
+        if out is not None:
+            out[...] = result
+            return out
+
+        return result
+
+    if is_then_scalar:
+        then_ = np.array(then_)
+
+    if is_else_scalar:
+        else_ = np.array(else_)
+
+    if then_.dtype != else_.dtype:
+        raise ValueError(
+                f"dtypes do not match: then_ is '{then_.dtype}' and "
+                f"else_ is '{else_.dtype}'")
+
+    if then_.shape == () and else_.shape == ():
+        pass
+    elif then_.shape != () and else_.shape != ():
+        if not (criterion.shape == then_.shape == else_.shape):
+            raise ValueError(
+                    f"shapes do not match: 'criterion' has shape {criterion.shape}"
+                    f", 'then_' has shape {then_.shape} and 'else_' has shape "
+                    f"{else_.shape}")
+    elif then_.shape == ():
+        if criterion.shape != else_.shape:
+            raise ValueError(
+                    f"shapes do not match: 'criterion' has shape {criterion.shape}"
+                    f" and 'else_' has shape {else_.shape}")
+    elif else_.shape == ():
+        if criterion.shape != then_.shape:
+            raise ValueError(
+                    f"shapes do not match: 'criterion' has shape {criterion.shape}"
+                    f" and 'then_' has shape {then_.shape}")
+    else:
+        raise AssertionError()
+
+    if out is None:
+        if then_.shape != ():
+            out = empty_like(
+                then_, criterion.queue, allocator=criterion.allocator)
+        else:
+            # Use same strides as criterion
+            cr_byte_strides = np.array(criterion.strides, dtype=np.int64)
+            cr_item_strides = cr_byte_strides // criterion.dtype.itemsize
+            out_strides = tuple(cr_item_strides*then_.dtype.itemsize)
+
+            out = type(criterion)(
+                        criterion.queue, criterion.shape, then_.dtype,
+                        allocator=criterion.allocator,
+                        strides=out_strides)
+
+    event1 = _if_positive(out, criterion, then_, else_, queue=queue)
+    out.add_event(event1)
+
+    return out
+
+# }}}
+
+
+# {{{ minimum/maximum
+
+@elwise_kernel_runner
+def _minimum_maximum_backend(out, a, b, minmax):
+    from pyopencl.elementwise import get_minmaximum_kernel
+    return get_minmaximum_kernel(out.context, minmax,
+            out.dtype,
+            a.dtype if isinstance(a, Array) else np.dtype(type(a)),
+            b.dtype if isinstance(b, Array) else np.dtype(type(b)),
+            elementwise.get_argument_kind(a),
+            elementwise.get_argument_kind(b))
+
+
+def maximum(a, b, out=None, queue: cl.CommandQueue | None = None):
+    """Return the elementwise maximum of *a* and *b*."""
+
+    a_is_scalar = np.isscalar(a)
+    b_is_scalar = np.isscalar(b)
+    if a_is_scalar and b_is_scalar:
+        result = np.maximum(a, b)
+        if out is not None:
+            out[...] = result
+            return out
+
+        return result
+
+    queue = queue or a.queue or b.queue
+
+    if out is None:
+        out_dtype = _get_common_dtype(a, b, queue)
+        if not a_is_scalar:
+            out = a._new_like_me(out_dtype, queue)
+        elif not b_is_scalar:
+            out = b._new_like_me(out_dtype, queue)
+
+    out.add_event(_minimum_maximum_backend(out, a, b, queue=queue, minmax="max"))
+
+    return out
+
+
+def minimum(a, b, out=None, queue: cl.CommandQueue | None = None):
+    """Return the elementwise minimum of *a* and *b*."""
+    a_is_scalar = np.isscalar(a)
+    b_is_scalar = np.isscalar(b)
+    if a_is_scalar and b_is_scalar:
+        result = np.minimum(a, b)
+        if out is not None:
+            out[...] = result
+            return out
+
+        return result
+
+    queue = queue or a.queue or b.queue
+
+    if out is None:
+        out_dtype = _get_common_dtype(a, b, queue)
+        if not a_is_scalar:
+            out = a._new_like_me(out_dtype, queue)
+        elif not b_is_scalar:
+            out = b._new_like_me(out_dtype, queue)
+
+    out.add_event(_minimum_maximum_backend(out,  a, b, queue=queue, minmax="min"))
+
+    return out
+
+# }}}
+
+
+# {{{ logical ops
+
+def _logical_op(x1, x2, out, operator, queue: cl.CommandQueue | None = None):
+    # NOTE: Copied from pycuda.gpuarray
+    assert operator in ["&&", "||"]
+
+    if np.isscalar(x1) and np.isscalar(x2):
+        if out is None:
+            out = empty(queue, shape=(), dtype=np.int8)
+
+        if operator == "&&":
+            out[:] = np.logical_and(x1, x2)
+        else:
+            out[:] = np.logical_or(x1, x2)
+    elif np.isscalar(x1) or np.isscalar(x2):
+        scalar_arg, = (x for x in (x1, x2) if np.isscalar(x))
+        ary_arg, = (x for x in (x1, x2) if not np.isscalar(x))
+        queue = queue or ary_arg.queue
+        allocator = ary_arg.allocator
+
+        if not isinstance(ary_arg, Array):
+            raise ValueError("logical_and can take either scalar or Array"
+                             " as inputs")
+
+        out = out or ary_arg._new_like_me(dtype=np.int8)
+
+        assert out.shape == ary_arg.shape and out.dtype == np.int8
+
+        knl = elementwise.get_array_scalar_binop_kernel(
+            queue.context,
+            operator,
+            out.dtype,
+            ary_arg.dtype,
+            np.dtype(type(scalar_arg))
+        )
+        elwise_kernel_runner(lambda *args, **kwargs: knl)(out, ary_arg, scalar_arg)
+    else:
+        if not (isinstance(x1, Array) and isinstance(x2, Array)):
+            raise ValueError("logical_or/logical_and can take either scalar"
+                             " or Arrays as inputs")
+        if x1.shape != x2.shape:
+            raise NotImplementedError("Broadcasting not supported")
+
+        queue = queue or x1.queue or x2.queue
+        allocator = x1.allocator or x2.allocator
+
+        if out is None:
+            out = empty(queue, allocator=allocator,
+                        shape=x1.shape, dtype=np.int8)
+
+        assert out.shape == x1.shape and out.dtype == np.int8
+
+        knl = elementwise.get_array_binop_kernel(
+            queue.context,
+            operator,
+            out.dtype,
+            x1.dtype, x2.dtype)
+        elwise_kernel_runner(lambda *args, **kwargs: knl)(out, x1, x2)
+
+    return out
+
+
+def logical_and(x1, x2, /, out=None, queue: cl.CommandQueue | None = None):
+    """
+    Returns the element-wise logical AND of *x1* and *x2*.
+    """
+    return _logical_op(x1, x2, out, "&&", queue=queue)
+
+
+def logical_or(x1, x2, /, out=None, queue: cl.CommandQueue | None = None):
+    """
+    Returns the element-wise logical OR of *x1* and *x2*.
+    """
+    return _logical_op(x1, x2, out, "||", queue=queue)
+
+
+def logical_not(x, /, out=None, queue: cl.CommandQueue | None = None):
+    """
+    Returns the element-wise logical NOT of *x*.
+    """
+    if np.isscalar(x):
+        out = out or empty(queue, shape=(), dtype=np.int8)
+        out[:] = np.logical_not(x)
+    else:
+        queue = queue or x.queue
+        out = out or empty(queue, shape=x.shape, dtype=np.int8,
+                           allocator=x.allocator)
+        knl = elementwise.get_logical_not_kernel(queue.context,
+                                                 x.dtype)
+        elwise_kernel_runner(lambda *args, **kwargs: knl)(out, x)
+
+    return out
+
+# }}}
+
+
+# {{{ reductions
+
+def sum(
+        a,
+        dtype=None,
+        queue: cl.CommandQueue | None = None,
+        slice=None,
+        initial=_NoValue):
+    """
+    .. versionadded:: 2011.1
+    """
+    if initial is not _NoValue and not isinstance(initial, SCALAR_CLASSES):
+        raise ValueError("'initial' is not a scalar")
+
+    if dtype is not None:
+        dtype = np.dtype(dtype)
+
+    from pyopencl.reduction import get_sum_kernel
+    krnl = get_sum_kernel(a.context, dtype, a.dtype)
+    result, event1 = krnl(a, queue=queue, slice=slice, wait_for=a.events,
+            return_event=True)
+    result.add_event(event1)
+
+    # NOTE: neutral element in `get_sum_kernel` is 0 by default
+    if initial is not _NoValue:
+        result += a.dtype.type(initial)
+
+    return result
+
+
+def any(a, queue: cl.CommandQueue | None = None, wait_for: cl.WaitList = None):
+    if len(a) == 0:
+        return _BOOL_DTYPE.type(False)
+
+    return a.any(queue=queue, wait_for=wait_for)
+
+
+def all(a, queue: cl.CommandQueue | None = None, wait_for: cl.WaitList = None):
+    if len(a) == 0:
+        return _BOOL_DTYPE.type(True)
+
+    return a.all(queue=queue, wait_for=wait_for)
+
+
+def dot(a, b, dtype=None, queue: cl.CommandQueue | None = None, slice=None):
+    """
+    .. versionadded:: 2011.1
+    """
+    if dtype is not None:
+        dtype = np.dtype(dtype)
+
+    from pyopencl.reduction import get_dot_kernel
+    krnl = get_dot_kernel(a.context, dtype, a.dtype, b.dtype)
+
+    result, event1 = krnl(a, b, queue=queue, slice=slice,
+            wait_for=a.events + b.events, return_event=True)
+    result.add_event(event1)
+
+    return result
+
+
+def vdot(a, b, dtype=None, queue: cl.CommandQueue | None = None, slice=None):
+    """Like :func:`numpy.vdot`.
+
+    .. versionadded:: 2013.1
+    """
+    if dtype is not None:
+        dtype = np.dtype(dtype)
+
+    from pyopencl.reduction import get_dot_kernel
+    krnl = get_dot_kernel(a.context, dtype, a.dtype, b.dtype,
+            conjugate_first=True)
+
+    result, event1 = krnl(a, b, queue=queue, slice=slice,
+            wait_for=a.events + b.events, return_event=True)
+    result.add_event(event1)
+
+    return result
+
+
+def subset_dot(
+            subset,
+            a,
+            b,
+            dtype=None,
+            queue: cl.CommandQueue | None = None,
+            slice=None):
+    """
+    .. versionadded:: 2011.1
+    """
+    if dtype is not None:
+        dtype = np.dtype(dtype)
+
+    from pyopencl.reduction import get_subset_dot_kernel
+    krnl = get_subset_dot_kernel(
+            a.context, dtype, subset.dtype, a.dtype, b.dtype)
+
+    result, event1 = krnl(subset, a, b, queue=queue, slice=slice,
+            wait_for=subset.events + a.events + b.events, return_event=True)
+    result.add_event(event1)
+
+    return result
+
+
+def _make_minmax_kernel(what):
+    def f(a, queue: cl.CommandQueue | None = None, initial=_NoValue):
+        if isinstance(a, SCALAR_CLASSES):
+            return np.array(a).dtype.type(a)
+
+        if len(a) == 0:
+            if initial is _NoValue:
+                raise ValueError(
+                        f"zero-size array to reduction '{what}' "
+                        "which has no identity")
+            else:
+                return initial
+
+        if initial is not _NoValue and not isinstance(initial, SCALAR_CLASSES):
+            raise ValueError("'initial' is not a scalar")
+
+        from pyopencl.reduction import get_minmax_kernel
+        krnl = get_minmax_kernel(a.context, what, a.dtype)
+        result, event1 = krnl(a, queue=queue, wait_for=a.events,
+                return_event=True)
+        result.add_event(event1)
+
+        if initial is not _NoValue:
+            initial = a.dtype.type(initial)
+            if what == "min":
+                result = minimum(result, initial, queue=queue)
+            elif what == "max":
+                result = maximum(result, initial, queue=queue)
+            else:
+                raise ValueError(f"unknown minmax reduction type: '{what}'")
+
+        return result
+
+    return f
+
+
+min = _make_minmax_kernel("min")
+min.__name__ = "min"
+min.__doc__ = """
+    .. versionadded:: 2011.1
+    """
+
+max = _make_minmax_kernel("max")
+max.__name__ = "max"
+max.__doc__ = """
+    .. versionadded:: 2011.1
+    """
+
+
+def _make_subset_minmax_kernel(what):
+    def f(subset, a, queue: cl.CommandQueue | None = None, slice=None):
+        from pyopencl.reduction import get_subset_minmax_kernel
+        krnl = get_subset_minmax_kernel(a.context, what, a.dtype, subset.dtype)
+        result, event1 = krnl(subset, a,  queue=queue, slice=slice,
+                wait_for=a.events + subset.events, return_event=True)
+        result.add_event(event1)
+        return result
+    return f
+
+
+subset_min = _make_subset_minmax_kernel("min")
+subset_min.__doc__ = """.. versionadded:: 2011.1"""
+subset_max = _make_subset_minmax_kernel("max")
+subset_max.__doc__ = """.. versionadded:: 2011.1"""
+
+# }}}
+
+
+# {{{ scans
+
+def cumsum(a, output_dtype=None, queue: cl.CommandQueue | None = None,
+        wait_for: cl.WaitList = None, return_event=False):
+    # undocumented for now
+
+    """
+    .. versionadded:: 2013.1
+    """
+
+    if output_dtype is None:
+        output_dtype = a.dtype
+    else:
+        output_dtype = np.dtype(output_dtype)
+
+    if wait_for is None:
+        wait_for = []
+
+    result = a._new_like_me(output_dtype)
+
+    from pyopencl.scan import get_cumsum_kernel
+    krnl = get_cumsum_kernel(a.context, a.dtype, output_dtype)
+    evt = krnl(a, result, queue=queue, wait_for=wait_for + a.events)
+    result.add_event(evt)
+
+    if return_event:
+        return evt, result
+    else:
+        return result
+
+# }}}
+
+
+__all__ = [
+    "Allocator",
+    "Array",
+    "all",
+    "any",
+    "arange",
+    "as_strided",
+    "concatenate",
+    "cumsum",
+    "diff",
+    "dot",
+    "empty_like",
+    "hstack",
+    "if_positive",
+    "logical_and",
+    "logical_not",
+    "logical_or",
+    "maximum",
+    "minimum",
+    "multi_put",
+    "multi_take",
+    "multi_take_put",
+    "reshape",
+    "stack",
+    "subset_dot",
+    "sum",
+    "take",
+    "to_device",
+    "transpose",
+    "vdot",
+    "zeros",
+    "zeros_like",
+]
+
+# vim: foldmethod=marker