    {-# LANGUAGE CPP #-}
    {-# LANGUAGE RankNTypes #-}
    {-# LANGUAGE TypeFamilies #-}
    -- |
    -- Module      : Data.Vector.Unboxed
    -- Copyright   : (c) Roman Leshchinskiy 2009-2010
    --                   Alexey Kuleshevich 2020-2022
    --                   Aleksey Khudyakov 2020-2022
    --                   Andrew Lelechenko 2020-2022
    -- License     : BSD-style
    --
    -- Maintainer  : Haskell Libraries Team <libraries@haskell.org>
    -- Stability   : experimental
    -- Portability : non-portable
    --
    -- Adaptive unboxed vectors. The implementation is based on data families
    -- and picks an efficient, specialised representation for every element type.
    -- For example, vector of fixed size primitives are backed by
    -- 'Data.Vector.Primitive.Vector', unboxed vectors of tuples are represented
    -- as tuples of unboxed vectors (see 'zip'\/'unzip'). Note that vector is
    -- only adaptive types could pick boxed representation for data type\/field
    -- of record. However all library instances are backed by unboxed array(s).
    --
    -- Defining new instances of unboxed vectors is somewhat complicated since
    -- it requires defining two data family and two type class instances. Latter
    -- two could be generated using @GeneralizedNewtypeDeriving@ or @DerivingVia@
    --
    -- >>> :set -XTypeFamilies -XStandaloneDeriving -XMultiParamTypeClasses -XGeneralizedNewtypeDeriving
    -- >>>
    -- >>> import qualified Data.Vector.Generic         as VG
    -- >>> import qualified Data.Vector.Generic.Mutable as VGM
    -- >>> import qualified Data.Vector.Unboxed         as VU
    -- >>>
    -- >>> newtype Foo = Foo Int
    -- >>>
    -- >>> newtype instance VU.MVector s Foo = MV_Int (VU.MVector s Int)
    -- >>> newtype instance VU.Vector    Foo = V_Int  (VU.Vector    Int)
    -- >>> deriving instance VGM.MVector VU.MVector Foo
    -- >>> deriving instance VG.Vector   VU.Vector  Foo
    -- >>> instance VU.Unbox Foo
    --
    -- For other data types we have several newtype wrappers for use with
    -- @DerivingVia@. See documentation of 'As' and 'IsoUnbox' for defining
    -- unboxed vector of product types. 'UnboxViaPrim' could be used to define
    -- vector of instances of 'Data.Vector.Primitive.Prim'. Similarly
    -- 'DoNotUnboxStrict'/'DoNotUnboxLazy'/'DoNotUnboxNormalForm' could be used
    -- to represent polymorphic fields as boxed vectors.
    --
    -- Or if everything else fails instances could be written by hand.
    -- Here is how the library does this for 'Complex' by simply wrapping
    -- vectors of pairs.
    --
    -- @
    -- newtype instance 'MVector' s ('Complex' a) = MV_Complex ('MVector' s (a,a))
    -- newtype instance 'Vector'    ('Complex' a) = V_Complex  ('Vector'    (a,a))
    --
    -- instance ('RealFloat' a, 'Unbox' a) => 'Data.Vector.Generic.Mutable.MVector' 'MVector' ('Complex' a) where
    --   {-\# INLINE basicLength \#-}
    --   basicLength (MV_Complex v) = 'Data.Vector.Generic.Mutable.basicLength' v
    --   ...
    --
    -- instance ('RealFloat' a, 'Unbox' a) => Data.Vector.Generic.Vector 'Vector' ('Complex' a) where
    --   {-\# INLINE basicLength \#-}
    --   basicLength (V_Complex v) = Data.Vector.Generic.basicLength v
    --   ...
    --
    -- instance ('RealFloat' a, 'Unbox' a) => 'Unbox' ('Complex' a)
    -- @
    module Data.Vector.Unboxed (
      -- * Unboxed vectors
      Vector(V_UnboxAs, V_UnboxViaPrim), MVector(..), Unbox,

      -- * Accessors

      -- ** Length information
      length, null,

      -- ** Indexing
      (!), (!?), head, last,
      unsafeIndex, unsafeHead, unsafeLast,

      -- ** Monadic indexing
      indexM, headM, lastM,
      unsafeIndexM, unsafeHeadM, unsafeLastM,

      -- ** Extracting subvectors (slicing)
      slice, init, tail, take, drop, splitAt, uncons, unsnoc,
      unsafeSlice, unsafeInit, unsafeTail, unsafeTake, unsafeDrop,

      -- * Construction

      -- ** Initialisation
      empty, singleton, replicate, generate, iterateN,

      -- ** Monadic initialisation
      replicateM, generateM, iterateNM, create, createT,

      -- ** Unfolding
      unfoldr, unfoldrN, unfoldrExactN,
      unfoldrM, unfoldrNM, unfoldrExactNM,
      constructN, constructrN,

      -- ** Enumeration
      enumFromN, enumFromStepN, enumFromTo, enumFromThenTo,

      -- ** Concatenation
      cons, snoc, (++), concat,

      -- ** Restricting memory usage
      force,

      -- * Modifying vectors

      -- ** Bulk updates
      (//), update, update_,
      unsafeUpd, unsafeUpdate, unsafeUpdate_,

      -- ** Accumulations
      accum, accumulate, accumulate_,
      unsafeAccum, unsafeAccumulate, unsafeAccumulate_,

      -- ** Permutations
      reverse, backpermute, unsafeBackpermute,

      -- ** Safe destructive updates
      modify,

      -- * Elementwise operations

      -- ** Indexing
      indexed,

      -- ** Mapping
      map, imap, concatMap,

      -- ** Monadic mapping
      mapM, imapM, mapM_, imapM_, forM, forM_,
      iforM, iforM_,

      -- ** Zipping
      zipWith, zipWith3, zipWith4, zipWith5, zipWith6,
      izipWith, izipWith3, izipWith4, izipWith5, izipWith6,
      -- *** Zipping tuples
      -- $zip
      zip, zip3, zip4, zip5, zip6,

      -- ** Monadic zipping
      zipWithM, izipWithM, zipWithM_, izipWithM_,

      -- ** Unzipping
      -- $unzip
      unzip, unzip3, unzip4, unzip5, unzip6,

      -- * Working with predicates

      -- ** Filtering
      filter, ifilter, filterM, uniq,
      mapMaybe, imapMaybe,
      mapMaybeM, imapMaybeM,
      takeWhile, dropWhile,

      -- ** Partitioning
      partition, unstablePartition, partitionWith, span, break, spanR, breakR, groupBy, group,

      -- ** Searching
      elem, notElem, find, findIndex, findIndexR, findIndices, elemIndex, elemIndices,

      -- * Folding
      foldl, foldl1, foldl', foldl1', foldr, foldr1, foldr', foldr1',
      ifoldl, ifoldl', ifoldr, ifoldr',
      foldMap, foldMap',

      -- ** Specialised folds
      all, any, and, or,
      sum, product,
      maximum, maximumBy, maximumOn,
      minimum, minimumBy, minimumOn,
      minIndex, minIndexBy, maxIndex, maxIndexBy,

      -- ** Monadic folds
      foldM, ifoldM, foldM', ifoldM',
      fold1M, fold1M', foldM_, ifoldM_,
      foldM'_, ifoldM'_, fold1M_, fold1M'_,

      -- * Scans
      prescanl, prescanl',
      postscanl, postscanl',
      scanl, scanl', scanl1, scanl1',
      iscanl, iscanl',
      prescanr, prescanr',
      postscanr, postscanr',
      scanr, scanr', scanr1, scanr1',
      iscanr, iscanr',

      -- ** Comparisons
      eqBy, cmpBy,

      -- * Conversions

      -- ** Lists
      toList, fromList, fromListN,

      -- ** Other vector types
      G.convert,

      -- ** Mutable vectors
      freeze, thaw, copy, unsafeFreeze, unsafeThaw, unsafeCopy,

      -- ** Deriving via
      UnboxViaPrim(..),
      As(..),
      IsoUnbox(..),

      -- *** /Lazy/ boxing
      DoNotUnboxLazy(..),

      -- *** /Strict/ boxing
      DoNotUnboxStrict(..),
      DoNotUnboxNormalForm(..)
    ) where

    import Data.Vector.Unboxed.Base
    import qualified Data.Vector.Generic as G
    import qualified Data.Vector.Fusion.Bundle as Bundle
    import Data.Vector.Fusion.Util ( delayed_min )

    import Control.Monad.ST ( ST )
    import Control.Monad.Primitive

    import Prelude
      ( Eq, Ord, Num, Enum, Monoid, Traversable, Monad, Read, Show, Bool, Ordering(..), Int, Maybe, Either
      , compare, mempty, mappend, mconcat, showsPrec
      , (<), (<=), (>), (>=), (==), (/=) )

    import Text.Read      ( Read(..), readListPrecDefault )
    import Data.Semigroup ( Semigroup(..) )

    import qualified GHC.Exts as Exts (IsList(..))

    #define NOT_VECTOR_MODULE
    #include "vector.h"

    -- See http://trac.haskell.org/vector/ticket/12
    instance (Unbox a, Eq a) => Eq (Vector a) where
      {-# INLINE (==) #-}
      Vector a
    xs == :: Vector a -> Vector a -> Bool
    == Vector a
    ys = Bundle Vector a -> Bundle Vector a -> Bool
    forall a (v :: * -> *). Eq a => Bundle v a -> Bundle v a -> Bool
    Bundle.eq (Vector a -> Bundle Vector a
    forall (v :: * -> *) a. Vector v a => v a -> Bundle v a
    G.stream Vector a
    xs) (Vector a -> Bundle Vector a
    forall (v :: * -> *) a. Vector v a => v a -> Bundle v a
    G.stream Vector a
    ys)

    -- See http://trac.haskell.org/vector/ticket/12
    instance (Unbox a, Ord a) => Ord (Vector a) where
      {-# INLINE compare #-}
      compare :: Vector a -> Vector a -> Ordering
    compare Vector a
    xs Vector a
    ys = Bundle Vector a -> Bundle Vector a -> Ordering
    forall a (v :: * -> *).
    Ord a =>
    Bundle v a -> Bundle v a -> Ordering
    Bundle.cmp (Vector a -> Bundle Vector a
    forall (v :: * -> *) a. Vector v a => v a -> Bundle v a
    G.stream Vector a
    xs) (Vector a -> Bundle Vector a
    forall (v :: * -> *) a. Vector v a => v a -> Bundle v a
    G.stream Vector a
    ys)

      {-# INLINE (<) #-}
      Vector a
    xs < :: Vector a -> Vector a -> Bool
    < Vector a
    ys = Bundle Vector a -> Bundle Vector a -> Ordering
    forall a (v :: * -> *).
    Ord a =>
    Bundle v a -> Bundle v a -> Ordering
    Bundle.cmp (Vector a -> Bundle Vector a
    forall (v :: * -> *) a. Vector v a => v a -> Bundle v a
    G.stream Vector a
    xs) (Vector a -> Bundle Vector a
    forall (v :: * -> *) a. Vector v a => v a -> Bundle v a
    G.stream Vector a
    ys) Ordering -> Ordering -> Bool
    forall a. Eq a => a -> a -> Bool
    == Ordering
    LT

      {-# INLINE (<=) #-}
      Vector a
    xs <= :: Vector a -> Vector a -> Bool
    <= Vector a
    ys = Bundle Vector a -> Bundle Vector a -> Ordering
    forall a (v :: * -> *).
    Ord a =>
    Bundle v a -> Bundle v a -> Ordering
    Bundle.cmp (Vector a -> Bundle Vector a
    forall (v :: * -> *) a. Vector v a => v a -> Bundle v a
    G.stream Vector a
    xs) (Vector a -> Bundle Vector a
    forall (v :: * -> *) a. Vector v a => v a -> Bundle v a
    G.stream Vector a
    ys) Ordering -> Ordering -> Bool
    forall a. Eq a => a -> a -> Bool
    /= Ordering
    GT

      {-# INLINE (>) #-}
      Vector a
    xs > :: Vector a -> Vector a -> Bool
    > Vector a
    ys = Bundle Vector a -> Bundle Vector a -> Ordering
    forall a (v :: * -> *).
    Ord a =>
    Bundle v a -> Bundle v a -> Ordering
    Bundle.cmp (Vector a -> Bundle Vector a
    forall (v :: * -> *) a. Vector v a => v a -> Bundle v a
    G.stream Vector a
    xs) (Vector a -> Bundle Vector a
    forall (v :: * -> *) a. Vector v a => v a -> Bundle v a
    G.stream Vector a
    ys) Ordering -> Ordering -> Bool
    forall a. Eq a => a -> a -> Bool
    == Ordering
    GT

      {-# INLINE (>=) #-}
      Vector a
    xs >= :: Vector a -> Vector a -> Bool
    >= Vector a
    ys = Bundle Vector a -> Bundle Vector a -> Ordering
    forall a (v :: * -> *).
    Ord a =>
    Bundle v a -> Bundle v a -> Ordering
    Bundle.cmp (Vector a -> Bundle Vector a
    forall (v :: * -> *) a. Vector v a => v a -> Bundle v a
    G.stream Vector a
    xs) (Vector a -> Bundle Vector a
    forall (v :: * -> *) a. Vector v a => v a -> Bundle v a
    G.stream Vector a
    ys) Ordering -> Ordering -> Bool
    forall a. Eq a => a -> a -> Bool
    /= Ordering
    LT

    instance Unbox a => Semigroup (Vector a) where
      {-# INLINE (<>) #-}
      <> :: Vector a -> Vector a -> Vector a
    (<>) = Vector a -> Vector a -> Vector a
    forall a. Unbox a => Vector a -> Vector a -> Vector a
    (++)

      {-# INLINE sconcat #-}
      sconcat :: NonEmpty (Vector a) -> Vector a
    sconcat = NonEmpty (Vector a) -> Vector a
    forall (v :: * -> *) a. Vector v a => NonEmpty (v a) -> v a
    G.concatNE

    instance Unbox a => Monoid (Vector a) where
      {-# INLINE mempty #-}
      mempty :: Vector a
    mempty = Vector a
    forall a. Unbox a => Vector a
    empty

      {-# INLINE mappend #-}
      mappend :: Vector a -> Vector a -> Vector a
    mappend = Vector a -> Vector a -> Vector a
    forall a. Semigroup a => a -> a -> a
    (<>)

      {-# INLINE mconcat #-}
      mconcat :: [Vector a] -> Vector a
    mconcat = [Vector a] -> Vector a
    forall a. Unbox a => [Vector a] -> Vector a
    concat

    instance (Show a, Unbox a) => Show (Vector a) where
      showsPrec :: Int -> Vector a -> ShowS
    showsPrec = Int -> Vector a -> ShowS
    forall (v :: * -> *) a. (Vector v a, Show a) => Int -> v a -> ShowS
    G.showsPrec

    instance (Read a, Unbox a) => Read (Vector a) where
      readPrec :: ReadPrec (Vector a)
    readPrec = ReadPrec (Vector a)
    forall (v :: * -> *) a. (Vector v a, Read a) => ReadPrec (v a)
    G.readPrec
      readListPrec :: ReadPrec [Vector a]
    readListPrec = ReadPrec [Vector a]
    forall a. Read a => ReadPrec [a]
    readListPrecDefault

    instance (Unbox e) => Exts.IsList (Vector e) where
      type Item (Vector e) = e
      fromList :: [Item (Vector e)] -> Vector e
    fromList = [e] -> Vector e
    [Item (Vector e)] -> Vector e
    forall a. Unbox a => [a] -> Vector a
    fromList
      fromListN :: Int -> [Item (Vector e)] -> Vector e
    fromListN = Int -> [e] -> Vector e
    Int -> [Item (Vector e)] -> Vector e
    forall a. Unbox a => Int -> [a] -> Vector a
    fromListN
      toList :: Vector e -> [Item (Vector e)]
    toList = Vector e -> [e]
    Vector e -> [Item (Vector e)]
    forall a. Unbox a => Vector a -> [a]
    toList

    -- Length information
    -- ------------------

    -- | /O(1)/ Yield the length of the vector.
    length :: Unbox a => Vector a -> Int
    {-# INLINE length #-}
    length :: forall a. Unbox a => Vector a -> Int
    length = Vector a -> Int
    forall (v :: * -> *) a. Vector v a => v a -> Int
    G.length

    -- | /O(1)/ Test whether a vector is empty.
    null :: Unbox a => Vector a -> Bool
    {-# INLINE null #-}
    null :: forall a. Unbox a => Vector a -> Bool
    null = Vector a -> Bool
    forall (v :: * -> *) a. Vector v a => v a -> Bool
    G.null

    -- Indexing
    -- --------

    -- | O(1) Indexing.
    (!) :: Unbox a => Vector a -> Int -> a
    {-# INLINE (!) #-}
    ! :: forall a. Unbox a => Vector a -> Int -> a
    (!) = Vector a -> Int -> a
    forall (v :: * -> *) a.
    (HasCallStack, Vector v a) =>
    v a -> Int -> a
    (G.!)

    -- | O(1) Safe indexing.
    (!?) :: Unbox a => Vector a -> Int -> Maybe a
    {-# INLINE (!?) #-}
    !? :: forall a. Unbox a => Vector a -> Int -> Maybe a
    (!?) = Vector a -> Int -> Maybe a
    forall (v :: * -> *) a. Vector v a => v a -> Int -> Maybe a
    (G.!?)

    -- | /O(1)/ First element.
    head :: Unbox a => Vector a -> a
    {-# INLINE head #-}
    head :: forall a. Unbox a => Vector a -> a
    head = Vector a -> a
    forall (v :: * -> *) a. Vector v a => v a -> a
    G.head

    -- | /O(1)/ Last element.
    last :: Unbox a => Vector a -> a
    {-# INLINE last #-}
    last :: forall a. Unbox a => Vector a -> a
    last = Vector a -> a
    forall (v :: * -> *) a. Vector v a => v a -> a
    G.last

    -- | /O(1)/ Unsafe indexing without bounds checking.
    unsafeIndex :: Unbox a => Vector a -> Int -> a
    {-# INLINE unsafeIndex #-}
    unsafeIndex :: forall a. Unbox a => Vector a -> Int -> a
    unsafeIndex = Vector a -> Int -> a
    forall (v :: * -> *) a. Vector v a => v a -> Int -> a
    G.unsafeIndex

    -- | /O(1)/ First element, without checking if the vector is empty.
    unsafeHead :: Unbox a => Vector a -> a
    {-# INLINE unsafeHead #-}
    unsafeHead :: forall a. Unbox a => Vector a -> a
    unsafeHead = Vector a -> a
    forall (v :: * -> *) a. Vector v a => v a -> a
    G.unsafeHead

    -- | /O(1)/ Last element, without checking if the vector is empty.
    unsafeLast :: Unbox a => Vector a -> a
    {-# INLINE unsafeLast #-}
    unsafeLast :: forall a. Unbox a => Vector a -> a
    unsafeLast = Vector a -> a
    forall (v :: * -> *) a. Vector v a => v a -> a
    G.unsafeLast

    -- Monadic indexing
    -- ----------------

    -- | /O(1)/ Indexing in a monad.
    --
    -- The monad allows operations to be strict in the vector when necessary.
    -- Suppose vector copying is implemented like this:
    --
    -- > copy mv v = ... write mv i (v ! i) ...
    --
    -- For lazy vectors, @v ! i@ would not be evaluated which means that @mv@
    -- would unnecessarily retain a reference to @v@ in each element written.
    --
    -- With 'indexM', copying can be implemented like this instead:
    --
    -- > copy mv v = ... do
    -- >                   x <- indexM v i
    -- >                   write mv i x
    --
    -- Here, no references to @v@ are retained because indexing (but /not/ the
    -- element) is evaluated eagerly.
    indexM :: (Unbox a, Monad m) => Vector a -> Int -> m a
    {-# INLINE indexM #-}
    indexM :: forall a (m :: * -> *).
    (Unbox a, Monad m) =>
    Vector a -> Int -> m a
    indexM = Vector a -> Int -> m a
    forall (v :: * -> *) a (m :: * -> *).
    (HasCallStack, Vector v a, Monad m) =>
    v a -> Int -> m a
    G.indexM

    -- | /O(1)/ First element of a vector in a monad. See 'indexM' for an
    -- explanation of why this is useful.
    headM :: (Unbox a, Monad m) => Vector a -> m a
    {-# INLINE headM #-}
    headM :: forall a (m :: * -> *). (Unbox a, Monad m) => Vector a -> m a
    headM = Vector a -> m a
    forall (v :: * -> *) a (m :: * -> *).
    (Vector v a, Monad m) =>
    v a -> m a
    G.headM

    -- | /O(1)/ Last element of a vector in a monad. See 'indexM' for an
    -- explanation of why this is useful.
    lastM :: (Unbox a, Monad m) => Vector a -> m a
    {-# INLINE lastM #-}
    lastM :: forall a (m :: * -> *). (Unbox a, Monad m) => Vector a -> m a
    lastM = Vector a -> m a
    forall (v :: * -> *) a (m :: * -> *).
    (Vector v a, Monad m) =>
    v a -> m a
    G.lastM

    -- | /O(1)/ Indexing in a monad, without bounds checks. See 'indexM' for an
    -- explanation of why this is useful.
    unsafeIndexM :: (Unbox a, Monad m) => Vector a -> Int -> m a
    {-# INLINE unsafeIndexM #-}
    unsafeIndexM :: forall a (m :: * -> *).
    (Unbox a, Monad m) =>
    Vector a -> Int -> m a
    unsafeIndexM = Vector a -> Int -> m a
    forall (v :: * -> *) a (m :: * -> *).
    (Vector v a, Monad m) =>
    v a -> Int -> m a
    G.unsafeIndexM

    -- | /O(1)/ First element in a monad, without checking for empty vectors.
    -- See 'indexM' for an explanation of why this is useful.
    unsafeHeadM :: (Unbox a, Monad m) => Vector a -> m a
    {-# INLINE unsafeHeadM #-}
    unsafeHeadM :: forall a (m :: * -> *). (Unbox a, Monad m) => Vector a -> m a
    unsafeHeadM = Vector a -> m a
    forall (v :: * -> *) a (m :: * -> *).
    (Vector v a, Monad m) =>
    v a -> m a
    G.unsafeHeadM

    -- | /O(1)/ Last element in a monad, without checking for empty vectors.
    -- See 'indexM' for an explanation of why this is useful.
    unsafeLastM :: (Unbox a, Monad m) => Vector a -> m a
    {-# INLINE unsafeLastM #-}
    unsafeLastM :: forall a (m :: * -> *). (Unbox a, Monad m) => Vector a -> m a
    unsafeLastM = Vector a -> m a
    forall (v :: * -> *) a (m :: * -> *).
    (Vector v a, Monad m) =>
    v a -> m a
    G.unsafeLastM

    -- Extracting subvectors (slicing)
    -- -------------------------------

    -- | /O(1)/ Yield a slice of the vector without copying it. The vector must
    -- contain at least @i+n@ elements.
    slice :: Unbox a => Int   -- ^ @i@ starting index
                     -> Int   -- ^ @n@ length
                     -> Vector a
                     -> Vector a
    {-# INLINE slice #-}
    slice :: forall a. Unbox a => Int -> Int -> Vector a -> Vector a
    slice = Int -> Int -> Vector a -> Vector a
    forall (v :: * -> *) a.
    (HasCallStack, Vector v a) =>
    Int -> Int -> v a -> v a
    G.slice

    -- | /O(1)/ Yield all but the last element without copying. The vector may not
    -- be empty.
    init :: Unbox a => Vector a -> Vector a
    {-# INLINE init #-}
    init :: forall a. Unbox a => Vector a -> Vector a
    init = Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => v a -> v a
    G.init

    -- | /O(1)/ Yield all but the first element without copying. The vector may not
    -- be empty.
    tail :: Unbox a => Vector a -> Vector a
    {-# INLINE tail #-}
    tail :: forall a. Unbox a => Vector a -> Vector a
    tail = Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => v a -> v a
    G.tail

    -- | /O(1)/ Yield at the first @n@ elements without copying. The vector may
    -- contain less than @n@ elements, in which case it is returned unchanged.
    take :: Unbox a => Int -> Vector a -> Vector a
    {-# INLINE take #-}
    take :: forall a. Unbox a => Int -> Vector a -> Vector a
    take = Int -> Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => Int -> v a -> v a
    G.take

    -- | /O(1)/ Yield all but the first @n@ elements without copying. The vector may
    -- contain less than @n@ elements, in which case an empty vector is returned.
    drop :: Unbox a => Int -> Vector a -> Vector a
    {-# INLINE drop #-}
    drop :: forall a. Unbox a => Int -> Vector a -> Vector a
    drop = Int -> Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => Int -> v a -> v a
    G.drop

    -- | /O(1)/ Yield the first @n@ elements paired with the remainder, without copying.
    --
    -- Note that @'splitAt' n v@ is equivalent to @('take' n v, 'drop' n v)@,
    -- but slightly more efficient.
    --
    -- @since 0.7.1
    splitAt :: Unbox a => Int -> Vector a -> (Vector a, Vector a)
    {-# INLINE splitAt #-}
    splitAt :: forall a. Unbox a => Int -> Vector a -> (Vector a, Vector a)
    splitAt = Int -> Vector a -> (Vector a, Vector a)
    forall (v :: * -> *) a. Vector v a => Int -> v a -> (v a, v a)
    G.splitAt

    -- | /O(1)/ Yield the 'head' and 'tail' of the vector, or 'Nothing' if
    -- the vector is empty.
    --
    -- @since 0.12.2.0
    uncons :: Unbox a => Vector a -> Maybe (a, Vector a)
    {-# INLINE uncons #-}
    uncons :: forall a. Unbox a => Vector a -> Maybe (a, Vector a)
    uncons = Vector a -> Maybe (a, Vector a)
    forall (v :: * -> *) a. Vector v a => v a -> Maybe (a, v a)
    G.uncons

    -- | /O(1)/ Yield the 'last' and 'init' of the vector, or 'Nothing' if
    -- the vector is empty.
    --
    -- @since 0.12.2.0
    unsnoc :: Unbox a => Vector a -> Maybe (Vector a, a)
    {-# INLINE unsnoc #-}
    unsnoc :: forall a. Unbox a => Vector a -> Maybe (Vector a, a)
    unsnoc = Vector a -> Maybe (Vector a, a)
    forall (v :: * -> *) a. Vector v a => v a -> Maybe (v a, a)
    G.unsnoc

    -- | /O(1)/ Yield a slice of the vector without copying. The vector must
    -- contain at least @i+n@ elements, but this is not checked.
    unsafeSlice :: Unbox a => Int   -- ^ @i@ starting index
                           -> Int   -- ^ @n@ length
                           -> Vector a
                           -> Vector a
    {-# INLINE unsafeSlice #-}
    unsafeSlice :: forall a. Unbox a => Int -> Int -> Vector a -> Vector a
    unsafeSlice = Int -> Int -> Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => Int -> Int -> v a -> v a
    G.unsafeSlice

    -- | /O(1)/ Yield all but the last element without copying. The vector may not
    -- be empty, but this is not checked.
    unsafeInit :: Unbox a => Vector a -> Vector a
    {-# INLINE unsafeInit #-}
    unsafeInit :: forall a. Unbox a => Vector a -> Vector a
    unsafeInit = Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => v a -> v a
    G.unsafeInit

    -- | /O(1)/ Yield all but the first element without copying. The vector may not
    -- be empty, but this is not checked.
    unsafeTail :: Unbox a => Vector a -> Vector a
    {-# INLINE unsafeTail #-}
    unsafeTail :: forall a. Unbox a => Vector a -> Vector a
    unsafeTail = Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => v a -> v a
    G.unsafeTail

    -- | /O(1)/ Yield the first @n@ elements without copying. The vector must
    -- contain at least @n@ elements, but this is not checked.
    unsafeTake :: Unbox a => Int -> Vector a -> Vector a
    {-# INLINE unsafeTake #-}
    unsafeTake :: forall a. Unbox a => Int -> Vector a -> Vector a
    unsafeTake = Int -> Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => Int -> v a -> v a
    G.unsafeTake

    -- | /O(1)/ Yield all but the first @n@ elements without copying. The vector
    -- must contain at least @n@ elements, but this is not checked.
    unsafeDrop :: Unbox a => Int -> Vector a -> Vector a
    {-# INLINE unsafeDrop #-}
    unsafeDrop :: forall a. Unbox a => Int -> Vector a -> Vector a
    unsafeDrop = Int -> Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => Int -> v a -> v a
    G.unsafeDrop

    -- Initialisation
    -- --------------

    -- | /O(1)/ The empty vector.
    empty :: Unbox a => Vector a
    {-# INLINE empty #-}
    empty :: forall a. Unbox a => Vector a
    empty = Vector a
    forall (v :: * -> *) a. Vector v a => v a
    G.empty

    -- | /O(1)/ A vector with exactly one element.
    singleton :: Unbox a => a -> Vector a
    {-# INLINE singleton #-}
    singleton :: forall a. Unbox a => a -> Vector a
    singleton = a -> Vector a
    forall (v :: * -> *) a. Vector v a => a -> v a
    G.singleton

    -- | /O(n)/ A vector of the given length with the same value in each position.
    replicate :: Unbox a => Int -> a -> Vector a
    {-# INLINE replicate #-}
    replicate :: forall a. Unbox a => Int -> a -> Vector a
    replicate = Int -> a -> Vector a
    forall (v :: * -> *) a. Vector v a => Int -> a -> v a
    G.replicate

    -- | /O(n)/ Construct a vector of the given length by applying the function to
    -- each index.
    generate :: Unbox a => Int -> (Int -> a) -> Vector a
    {-# INLINE generate #-}
    generate :: forall a. Unbox a => Int -> (Int -> a) -> Vector a
    generate = Int -> (Int -> a) -> Vector a
    forall (v :: * -> *) a. Vector v a => Int -> (Int -> a) -> v a
    G.generate

    -- | /O(n)/ Apply the function \(\max(n - 1, 0)\) times to an initial value, producing a vector
    -- of length \(\max(n, 0)\). The 0th element will contain the initial value, which is why there
    -- is one less function application than the number of elements in the produced vector.
    --
    -- \( \underbrace{x, f (x), f (f (x)), \ldots}_{\max(0,n)\rm{~elements}} \)
    --
    -- ===__Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.iterateN 0 undefined undefined :: VU.Vector Int
    -- []
    -- >>> VU.iterateN 3 (\(i, c) -> (pred i, succ c)) (0 :: Int, 'a')
    -- [(0,'a'),(-1,'b'),(-2,'c')]
    --
    -- @since 0.7.1
    iterateN :: Unbox a => Int -> (a -> a) -> a -> Vector a
    {-# INLINE iterateN #-}
    iterateN :: forall a. Unbox a => Int -> (a -> a) -> a -> Vector a
    iterateN = Int -> (a -> a) -> a -> Vector a
    forall (v :: * -> *) a. Vector v a => Int -> (a -> a) -> a -> v a
    G.iterateN

    -- Unfolding
    -- ---------

    -- | /O(n)/ Construct a vector by repeatedly applying the generator function
    -- to a seed. The generator function yields 'Just' the next element and the
    -- new seed or 'Nothing' if there are no more elements.
    --
    -- > unfoldr (\n -> if n == 0 then Nothing else Just (n,n-1)) 10
    -- >  = <10,9,8,7,6,5,4,3,2,1>
    unfoldr :: Unbox a => (b -> Maybe (a, b)) -> b -> Vector a
    {-# INLINE unfoldr #-}
    unfoldr :: forall a b. Unbox a => (b -> Maybe (a, b)) -> b -> Vector a
    unfoldr = (b -> Maybe (a, b)) -> b -> Vector a
    forall (v :: * -> *) a b.
    Vector v a =>
    (b -> Maybe (a, b)) -> b -> v a
    G.unfoldr

    -- | /O(n)/ Construct a vector with at most @n@ elements by repeatedly applying
    -- the generator function to a seed. The generator function yields 'Just' the
    -- next element and the new seed or 'Nothing' if there are no more elements.
    --
    -- > unfoldrN 3 (\n -> Just (n,n-1)) 10 = <10,9,8>
    unfoldrN :: Unbox a => Int -> (b -> Maybe (a, b)) -> b -> Vector a
    {-# INLINE unfoldrN #-}
    unfoldrN :: forall a b. Unbox a => Int -> (b -> Maybe (a, b)) -> b -> Vector a
    unfoldrN = Int -> (b -> Maybe (a, b)) -> b -> Vector a
    forall (v :: * -> *) a b.
    Vector v a =>
    Int -> (b -> Maybe (a, b)) -> b -> v a
    G.unfoldrN

    -- | /O(n)/ Construct a vector with exactly @n@ elements by repeatedly applying
    -- the generator function to a seed. The generator function yields the
    -- next element and the new seed.
    --
    -- > unfoldrExactN 3 (\n -> (n,n-1)) 10 = <10,9,8>
    --
    -- @since 0.12.2.0
    unfoldrExactN  :: Unbox a => Int -> (b -> (a, b)) -> b -> Vector a
    {-# INLINE unfoldrExactN #-}
    unfoldrExactN :: forall a b. Unbox a => Int -> (b -> (a, b)) -> b -> Vector a
    unfoldrExactN = Int -> (b -> (a, b)) -> b -> Vector a
    forall (v :: * -> *) a b.
    Vector v a =>
    Int -> (b -> (a, b)) -> b -> v a
    G.unfoldrExactN

    -- | /O(n)/ Construct a vector by repeatedly applying the monadic
    -- generator function to a seed. The generator function yields 'Just'
    -- the next element and the new seed or 'Nothing' if there are no more
    -- elements.
    unfoldrM :: (Monad m, Unbox a) => (b -> m (Maybe (a, b))) -> b -> m (Vector a)
    {-# INLINE unfoldrM #-}
    unfoldrM :: forall (m :: * -> *) a b.
    (Monad m, Unbox a) =>
    (b -> m (Maybe (a, b))) -> b -> m (Vector a)
    unfoldrM = (b -> m (Maybe (a, b))) -> b -> m (Vector a)
    forall (m :: * -> *) (v :: * -> *) a b.
    (Monad m, Vector v a) =>
    (b -> m (Maybe (a, b))) -> b -> m (v a)
    G.unfoldrM

    -- | /O(n)/ Construct a vector by repeatedly applying the monadic
    -- generator function to a seed. The generator function yields 'Just'
    -- the next element and the new seed or 'Nothing' if there are no more
    -- elements.
    unfoldrNM :: (Monad m, Unbox a) => Int -> (b -> m (Maybe (a, b))) -> b -> m (Vector a)
    {-# INLINE unfoldrNM #-}
    unfoldrNM :: forall (m :: * -> *) a b.
    (Monad m, Unbox a) =>
    Int -> (b -> m (Maybe (a, b))) -> b -> m (Vector a)
    unfoldrNM = Int -> (b -> m (Maybe (a, b))) -> b -> m (Vector a)
    forall (m :: * -> *) (v :: * -> *) a b.
    (Monad m, Vector v a) =>
    Int -> (b -> m (Maybe (a, b))) -> b -> m (v a)
    G.unfoldrNM

    -- | /O(n)/ Construct a vector with exactly @n@ elements by repeatedly
    -- applying the monadic generator function to a seed. The generator
    -- function yields the next element and the new seed.
    --
    -- @since 0.12.2.0
    unfoldrExactNM :: (Monad m, Unbox a) => Int -> (b -> m (a, b)) -> b -> m (Vector a)
    {-# INLINE unfoldrExactNM #-}
    unfoldrExactNM :: forall (m :: * -> *) a b.
    (Monad m, Unbox a) =>
    Int -> (b -> m (a, b)) -> b -> m (Vector a)
    unfoldrExactNM = Int -> (b -> m (a, b)) -> b -> m (Vector a)
    forall (m :: * -> *) (v :: * -> *) a b.
    (Monad m, Vector v a) =>
    Int -> (b -> m (a, b)) -> b -> m (v a)
    G.unfoldrExactNM

    -- | /O(n)/ Construct a vector with @n@ elements by repeatedly applying the
    -- generator function to the already constructed part of the vector.
    --
    -- > constructN 3 f = let a = f <> ; b = f <a> ; c = f <a,b> in <a,b,c>
    constructN :: Unbox a => Int -> (Vector a -> a) -> Vector a
    {-# INLINE constructN #-}
    constructN :: forall a. Unbox a => Int -> (Vector a -> a) -> Vector a
    constructN = Int -> (Vector a -> a) -> Vector a
    forall (v :: * -> *) a. Vector v a => Int -> (v a -> a) -> v a
    G.constructN

    -- | /O(n)/ Construct a vector with @n@ elements from right to left by
    -- repeatedly applying the generator function to the already constructed part
    -- of the vector.
    --
    -- > constructrN 3 f = let a = f <> ; b = f<a> ; c = f <b,a> in <c,b,a>
    constructrN :: Unbox a => Int -> (Vector a -> a) -> Vector a
    {-# INLINE constructrN #-}
    constructrN :: forall a. Unbox a => Int -> (Vector a -> a) -> Vector a
    constructrN = Int -> (Vector a -> a) -> Vector a
    forall (v :: * -> *) a. Vector v a => Int -> (v a -> a) -> v a
    G.constructrN

    -- Enumeration
    -- -----------

    -- | /O(n)/ Yield a vector of the given length, containing the values @x@, @x+1@
    -- etc. This operation is usually more efficient than 'enumFromTo'.
    --
    -- > enumFromN 5 3 = <5,6,7>
    enumFromN :: (Unbox a, Num a) => a -> Int -> Vector a
    {-# INLINE enumFromN #-}
    enumFromN :: forall a. (Unbox a, Num a) => a -> Int -> Vector a
    enumFromN = a -> Int -> Vector a
    forall (v :: * -> *) a. (Vector v a, Num a) => a -> Int -> v a
    G.enumFromN

    -- | /O(n)/ Yield a vector of the given length, containing the values @x@, @x+y@,
    -- @x+y+y@ etc. This operations is usually more efficient than 'enumFromThenTo'.
    --
    -- > enumFromStepN 1 2 5 = <1,3,5,7,9>
    enumFromStepN :: (Unbox a, Num a) => a -> a -> Int -> Vector a
    {-# INLINE enumFromStepN #-}
    enumFromStepN :: forall a. (Unbox a, Num a) => a -> a -> Int -> Vector a
    enumFromStepN = a -> a -> Int -> Vector a
    forall (v :: * -> *) a. (Vector v a, Num a) => a -> a -> Int -> v a
    G.enumFromStepN

    -- | /O(n)/ Enumerate values from @x@ to @y@.
    --
    -- /WARNING:/ This operation can be very inefficient. If possible, use
    -- 'enumFromN' instead.
    enumFromTo :: (Unbox a, Enum a) => a -> a -> Vector a
    {-# INLINE enumFromTo #-}
    enumFromTo :: forall a. (Unbox a, Enum a) => a -> a -> Vector a
    enumFromTo = a -> a -> Vector a
    forall (v :: * -> *) a. (Vector v a, Enum a) => a -> a -> v a
    G.enumFromTo

    -- | /O(n)/ Enumerate values from @x@ to @y@ with a specific step @z@.
    --
    -- /WARNING:/ This operation can be very inefficient. If possible, use
    -- 'enumFromStepN' instead.
    enumFromThenTo :: (Unbox a, Enum a) => a -> a -> a -> Vector a
    {-# INLINE enumFromThenTo #-}
    enumFromThenTo :: forall a. (Unbox a, Enum a) => a -> a -> a -> Vector a
    enumFromThenTo = a -> a -> a -> Vector a
    forall (v :: * -> *) a. (Vector v a, Enum a) => a -> a -> a -> v a
    G.enumFromThenTo

    -- Concatenation
    -- -------------

    -- | /O(n)/ Prepend an element.
    cons :: Unbox a => a -> Vector a -> Vector a
    {-# INLINE cons #-}
    cons :: forall a. Unbox a => a -> Vector a -> Vector a
    cons = a -> Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => a -> v a -> v a
    G.cons

    -- | /O(n)/ Append an element.
    snoc :: Unbox a => Vector a -> a -> Vector a
    {-# INLINE snoc #-}
    snoc :: forall a. Unbox a => Vector a -> a -> Vector a
    snoc = Vector a -> a -> Vector a
    forall (v :: * -> *) a. Vector v a => v a -> a -> v a
    G.snoc

    infixr 5 ++
    -- | /O(m+n)/ Concatenate two vectors.
    (++) :: Unbox a => Vector a -> Vector a -> Vector a
    {-# INLINE (++) #-}
    ++ :: forall a. Unbox a => Vector a -> Vector a -> Vector a
    (++) = Vector a -> Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => v a -> v a -> v a
    (G.++)

    -- | /O(n)/ Concatenate all vectors in the list.
    concat :: Unbox a => [Vector a] -> Vector a
    {-# INLINE concat #-}
    concat :: forall a. Unbox a => [Vector a] -> Vector a
    concat = [Vector a] -> Vector a
    forall (v :: * -> *) a. Vector v a => [v a] -> v a
    G.concat

    -- Monadic initialisation
    -- ----------------------

    -- | /O(n)/ Execute the monadic action the given number of times and store the
    -- results in a vector.
    replicateM :: (Monad m, Unbox a) => Int -> m a -> m (Vector a)
    {-# INLINE replicateM #-}
    replicateM :: forall (m :: * -> *) a.
    (Monad m, Unbox a) =>
    Int -> m a -> m (Vector a)
    replicateM = Int -> m a -> m (Vector a)
    forall (m :: * -> *) (v :: * -> *) a.
    (Monad m, Vector v a) =>
    Int -> m a -> m (v a)
    G.replicateM

    -- | /O(n)/ Construct a vector of the given length by applying the monadic
    -- action to each index.
    generateM :: (Monad m, Unbox a) => Int -> (Int -> m a) -> m (Vector a)
    {-# INLINE generateM #-}
    generateM :: forall (m :: * -> *) a.
    (Monad m, Unbox a) =>
    Int -> (Int -> m a) -> m (Vector a)
    generateM = Int -> (Int -> m a) -> m (Vector a)
    forall (m :: * -> *) (v :: * -> *) a.
    (Monad m, Vector v a) =>
    Int -> (Int -> m a) -> m (v a)
    G.generateM

    -- | /O(n)/ Apply the monadic function \(\max(n - 1, 0)\) times to an initial value, producing a vector
    -- of length \(\max(n, 0)\). The 0th element will contain the initial value, which is why there
    -- is one less function application than the number of elements in the produced vector.
    --
    -- For a non-monadic version, see `iterateN`.
    --
    -- @since 0.12.0.0
    iterateNM :: (Monad m, Unbox a) => Int -> (a -> m a) -> a -> m (Vector a)
    {-# INLINE iterateNM #-}
    iterateNM :: forall (m :: * -> *) a.
    (Monad m, Unbox a) =>
    Int -> (a -> m a) -> a -> m (Vector a)
    iterateNM = Int -> (a -> m a) -> a -> m (Vector a)
    forall (m :: * -> *) (v :: * -> *) a.
    (Monad m, Vector v a) =>
    Int -> (a -> m a) -> a -> m (v a)
    G.iterateNM

    -- | Execute the monadic action and freeze the resulting vector.
    --
    -- @
    -- create (do { v \<- new 2; write v 0 \'a\'; write v 1 \'b\'; return v }) = \<'a','b'\>
    -- @
    create :: Unbox a => (forall s. ST s (MVector s a)) -> Vector a
    {-# INLINE create #-}
    -- NOTE: eta-expanded due to http://hackage.haskell.org/trac/ghc/ticket/4120
    create :: forall a. Unbox a => (forall s. ST s (MVector s a)) -> Vector a
    create forall s. ST s (MVector s a)
    p = (forall s. ST s (Mutable Vector s a)) -> Vector a
    forall (v :: * -> *) a.
    Vector v a =>
    (forall s. ST s (Mutable v s a)) -> v a
    G.create ST s (Mutable Vector s a)
    ST s (MVector s a)
    forall s. ST s (Mutable Vector s a)
    forall s. ST s (MVector s a)
    p

    -- | Execute the monadic action and freeze the resulting vectors.
    createT :: (Traversable f, Unbox a) => (forall s. ST s (f (MVector s a))) -> f (Vector a)
    {-# INLINE createT #-}
    createT :: forall (f :: * -> *) a.
    (Traversable f, Unbox a) =>
    (forall s. ST s (f (MVector s a))) -> f (Vector a)
    createT forall s. ST s (f (MVector s a))
    p = (forall s. ST s (f (Mutable Vector s a))) -> f (Vector a)
    forall (f :: * -> *) (v :: * -> *) a.
    (Traversable f, Vector v a) =>
    (forall s. ST s (f (Mutable v s a))) -> f (v a)
    G.createT ST s (f (Mutable Vector s a))
    ST s (f (MVector s a))
    forall s. ST s (f (Mutable Vector s a))
    forall s. ST s (f (MVector s a))
    p

    -- Restricting memory usage
    -- ------------------------

    -- | /O(n)/ Yield the argument, but force it not to retain any extra memory,
    -- by copying it.
    --
    -- This is especially useful when dealing with slices. For example:
    --
    -- > force (slice 0 2 <huge vector>)
    --
    -- Here, the slice retains a reference to the huge vector. Forcing it creates
    -- a copy of just the elements that belong to the slice and allows the huge
    -- vector to be garbage collected.
    force :: Unbox a => Vector a -> Vector a
    {-# INLINE force #-}
    force :: forall a. Unbox a => Vector a -> Vector a
    force = Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => v a -> v a
    G.force

    -- Bulk updates
    -- ------------

    -- | /O(m+n)/ For each pair @(i,a)@ from the list of idnex/value pairs,
    -- replace the vector element at position @i@ by @a@.
    --
    -- > <5,9,2,7> // [(2,1),(0,3),(2,8)] = <3,9,8,7>
    --
    (//) :: Unbox a => Vector a   -- ^ initial vector (of length @m@)
                    -> [(Int, a)] -- ^ list of index/value pairs (of length @n@)
                    -> Vector a
    {-# INLINE (//) #-}
    // :: forall a. Unbox a => Vector a -> [(Int, a)] -> Vector a
    (//) = Vector a -> [(Int, a)] -> Vector a
    forall (v :: * -> *) a. Vector v a => v a -> [(Int, a)] -> v a
    (G.//)

    -- | /O(m+n)/ For each pair @(i,a)@ from the vector of index/value pairs,
    -- replace the vector element at position @i@ by @a@.
    --
    -- > update <5,9,2,7> <(2,1),(0,3),(2,8)> = <3,9,8,7>
    --
    update :: Unbox a
           => Vector a        -- ^ initial vector (of length @m@)
           -> Vector (Int, a) -- ^ vector of index/value pairs (of length @n@)
           -> Vector a
    {-# INLINE update #-}
    update :: forall a. Unbox a => Vector a -> Vector (Int, a) -> Vector a
    update = Vector a -> Vector (Int, a) -> Vector a
    forall (v :: * -> *) a.
    (Vector v a, Vector v (Int, a)) =>
    v a -> v (Int, a) -> v a
    G.update

    -- | /O(m+min(n1,n2))/ For each index @i@ from the index vector and the
    -- corresponding value @a@ from the value vector, replace the element of the
    -- initial vector at position @i@ by @a@.
    --
    -- > update_ <5,9,2,7>  <2,0,2> <1,3,8> = <3,9,8,7>
    --
    -- The function 'update' provides the same functionality and is usually more
    -- convenient.
    --
    -- @
    -- update_ xs is ys = 'update' xs ('zip' is ys)
    -- @
    update_ :: Unbox a
            => Vector a   -- ^ initial vector (of length @m@)
            -> Vector Int -- ^ index vector (of length @n1@)
            -> Vector a   -- ^ value vector (of length @n2@)
            -> Vector a
    {-# INLINE update_ #-}
    update_ :: forall a. Unbox a => Vector a -> Vector Int -> Vector a -> Vector a
    update_ = Vector a -> Vector Int -> Vector a -> Vector a
    forall (v :: * -> *) a.
    (Vector v a, Vector v Int) =>
    v a -> v Int -> v a -> v a
    G.update_

    -- | Same as ('//'), but without bounds checking.
    unsafeUpd :: Unbox a => Vector a -> [(Int, a)] -> Vector a
    {-# INLINE unsafeUpd #-}
    unsafeUpd :: forall a. Unbox a => Vector a -> [(Int, a)] -> Vector a
    unsafeUpd = Vector a -> [(Int, a)] -> Vector a
    forall (v :: * -> *) a. Vector v a => v a -> [(Int, a)] -> v a
    G.unsafeUpd

    -- | Same as 'update', but without bounds checking.
    unsafeUpdate :: Unbox a => Vector a -> Vector (Int, a) -> Vector a
    {-# INLINE unsafeUpdate #-}
    unsafeUpdate :: forall a. Unbox a => Vector a -> Vector (Int, a) -> Vector a
    unsafeUpdate = Vector a -> Vector (Int, a) -> Vector a
    forall (v :: * -> *) a.
    (Vector v a, Vector v (Int, a)) =>
    v a -> v (Int, a) -> v a
    G.unsafeUpdate

    -- | Same as 'update_', but without bounds checking.
    unsafeUpdate_ :: Unbox a => Vector a -> Vector Int -> Vector a -> Vector a
    {-# INLINE unsafeUpdate_ #-}
    unsafeUpdate_ :: forall a. Unbox a => Vector a -> Vector Int -> Vector a -> Vector a
    unsafeUpdate_ = Vector a -> Vector Int -> Vector a -> Vector a
    forall (v :: * -> *) a.
    (Vector v a, Vector v Int) =>
    v a -> v Int -> v a -> v a
    G.unsafeUpdate_

    -- Accumulations
    -- -------------

    -- | /O(m+n)/ For each pair @(i,b)@ from the list, replace the vector element
    -- @a@ at position @i@ by @f a b@.
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.accum (+) (VU.fromList [1000,2000,3000 :: Int]) [(2,4),(1,6),(0,3),(1,10)]
    -- [1003,2016,3004]
    accum :: Unbox a
          => (a -> b -> a) -- ^ accumulating function @f@
          -> Vector a      -- ^ initial vector (of length @m@)
          -> [(Int,b)]     -- ^ list of index/value pairs (of length @n@)
          -> Vector a
    {-# INLINE accum #-}
    accum :: forall a b.
    Unbox a =>
    (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a
    accum = (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a
    forall (v :: * -> *) a b.
    Vector v a =>
    (a -> b -> a) -> v a -> [(Int, b)] -> v a
    G.accum

    -- | /O(m+n)/ For each pair @(i,b)@ from the vector of pairs, replace the vector
    -- element @a@ at position @i@ by @f a b@.
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.accumulate (+) (VU.fromList [1000,2000,3000 :: Int]) (VU.fromList [(2,4),(1,6),(0,3),(1,10)])
    -- [1003,2016,3004]
    accumulate :: (Unbox a, Unbox b)
                => (a -> b -> a)  -- ^ accumulating function @f@
                -> Vector a       -- ^ initial vector (of length @m@)
                -> Vector (Int,b) -- ^ vector of index/value pairs (of length @n@)
                -> Vector a
    {-# INLINE accumulate #-}
    accumulate :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> b -> a) -> Vector a -> Vector (Int, b) -> Vector a
    accumulate = (a -> b -> a) -> Vector a -> Vector (Int, b) -> Vector a
    forall (v :: * -> *) a b.
    (Vector v a, Vector v (Int, b)) =>
    (a -> b -> a) -> v a -> v (Int, b) -> v a
    G.accumulate

    -- | /O(m+min(n1,n2))/ For each index @i@ from the index vector and the
    -- corresponding value @b@ from the value vector,
    -- replace the element of the initial vector at
    -- position @i@ by @f a b@.
    --
    -- > accumulate_ (+) <5,9,2> <2,1,0,1> <4,6,3,7> = <5+3, 9+6+7, 2+4>
    --
    -- The function 'accumulate' provides the same functionality and is usually more
    -- convenient.
    --
    -- @
    -- accumulate_ f as is bs = 'accumulate' f as ('zip' is bs)
    -- @
    accumulate_ :: (Unbox a, Unbox b)
                => (a -> b -> a) -- ^ accumulating function @f@
                -> Vector a      -- ^ initial vector (of length @m@)
                -> Vector Int    -- ^ index vector (of length @n1@)
                -> Vector b      -- ^ value vector (of length @n2@)
                -> Vector a
    {-# INLINE accumulate_ #-}
    accumulate_ :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a
    accumulate_ = (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a
    forall (v :: * -> *) a b.
    (Vector v a, Vector v Int, Vector v b) =>
    (a -> b -> a) -> v a -> v Int -> v b -> v a
    G.accumulate_

    -- | Same as 'accum', but without bounds checking.
    unsafeAccum :: Unbox a => (a -> b -> a) -> Vector a -> [(Int,b)] -> Vector a
    {-# INLINE unsafeAccum #-}
    unsafeAccum :: forall a b.
    Unbox a =>
    (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a
    unsafeAccum = (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a
    forall (v :: * -> *) a b.
    Vector v a =>
    (a -> b -> a) -> v a -> [(Int, b)] -> v a
    G.unsafeAccum

    -- | Same as 'accumulate', but without bounds checking.
    unsafeAccumulate :: (Unbox a, Unbox b)
                    => (a -> b -> a) -> Vector a -> Vector (Int,b) -> Vector a
    {-# INLINE unsafeAccumulate #-}
    unsafeAccumulate :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> b -> a) -> Vector a -> Vector (Int, b) -> Vector a
    unsafeAccumulate = (a -> b -> a) -> Vector a -> Vector (Int, b) -> Vector a
    forall (v :: * -> *) a b.
    (Vector v a, Vector v (Int, b)) =>
    (a -> b -> a) -> v a -> v (Int, b) -> v a
    G.unsafeAccumulate

    -- | Same as 'accumulate_', but without bounds checking.
    unsafeAccumulate_ :: (Unbox a, Unbox b) =>
                   (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a
    {-# INLINE unsafeAccumulate_ #-}
    unsafeAccumulate_ :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a
    unsafeAccumulate_ = (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a
    forall (v :: * -> *) a b.
    (Vector v a, Vector v Int, Vector v b) =>
    (a -> b -> a) -> v a -> v Int -> v b -> v a
    G.unsafeAccumulate_

    -- Permutations
    -- ------------

    -- | /O(n)/ Reverse a vector.
    reverse :: Unbox a => Vector a -> Vector a
    {-# INLINE reverse #-}
    reverse :: forall a. Unbox a => Vector a -> Vector a
    reverse = Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => v a -> v a
    G.reverse

    -- | /O(n)/ Yield the vector obtained by replacing each element @i@ of the
    -- index vector by @xs'!'i@. This is equivalent to @'map' (xs'!') is@, but is
    -- often much more efficient.
    --
    -- > backpermute <a,b,c,d> <0,3,2,3,1,0> = <a,d,c,d,b,a>
    backpermute :: Unbox a => Vector a -> Vector Int -> Vector a
    {-# INLINE backpermute #-}
    backpermute :: forall a. Unbox a => Vector a -> Vector Int -> Vector a
    backpermute = Vector a -> Vector Int -> Vector a
    forall (v :: * -> *) a.
    (HasCallStack, Vector v a, Vector v Int) =>
    v a -> v Int -> v a
    G.backpermute

    -- | Same as 'backpermute', but without bounds checking.
    unsafeBackpermute :: Unbox a => Vector a -> Vector Int -> Vector a
    {-# INLINE unsafeBackpermute #-}
    unsafeBackpermute :: forall a. Unbox a => Vector a -> Vector Int -> Vector a
    unsafeBackpermute = Vector a -> Vector Int -> Vector a
    forall (v :: * -> *) a.
    (Vector v a, Vector v Int) =>
    v a -> v Int -> v a
    G.unsafeBackpermute

    -- Safe destructive updates
    -- ------------------------

    -- | Apply a destructive operation to a vector. The operation may be
    -- performed in place if it is safe to do so and will modify a copy of the
    -- vector otherwise (see 'Data.Vector.Generic.New.New' for details).
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> import qualified Data.Vector.Unboxed.Mutable as MVU
    -- >>> VU.modify (\v -> MVU.write v 0 'x') $ VU.replicate 4 'a'
    -- "xaaa"
    modify :: Unbox a => (forall s. MVector s a -> ST s ()) -> Vector a -> Vector a
    {-# INLINE modify #-}
    modify :: forall a.
    Unbox a =>
    (forall s. MVector s a -> ST s ()) -> Vector a -> Vector a
    modify forall s. MVector s a -> ST s ()
    p = (forall s. Mutable Vector s a -> ST s ()) -> Vector a -> Vector a
    forall (v :: * -> *) a.
    Vector v a =>
    (forall s. Mutable v s a -> ST s ()) -> v a -> v a
    G.modify Mutable Vector s a -> ST s ()
    MVector s a -> ST s ()
    forall s. Mutable Vector s a -> ST s ()
    forall s. MVector s a -> ST s ()
    p

    -- Indexing
    -- --------

    -- | /O(n)/ Pair each element in a vector with its index.
    indexed :: Unbox a => Vector a -> Vector (Int,a)
    {-# INLINE indexed #-}
    indexed :: forall a. Unbox a => Vector a -> Vector (Int, a)
    indexed = Vector a -> Vector (Int, a)
    forall (v :: * -> *) a.
    (Vector v a, Vector v (Int, a)) =>
    v a -> v (Int, a)
    G.indexed

    -- Mapping
    -- -------

    -- | /O(n)/ Map a function over a vector.
    map :: (Unbox a, Unbox b) => (a -> b) -> Vector a -> Vector b
    {-# INLINE map #-}
    map :: forall a b. (Unbox a, Unbox b) => (a -> b) -> Vector a -> Vector b
    map = (a -> b) -> Vector a -> Vector b
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (a -> b) -> v a -> v b
    G.map

    -- | /O(n)/ Apply a function to every element of a vector and its index.
    imap :: (Unbox a, Unbox b) => (Int -> a -> b) -> Vector a -> Vector b
    {-# INLINE imap #-}
    imap :: forall a b.
    (Unbox a, Unbox b) =>
    (Int -> a -> b) -> Vector a -> Vector b
    imap = (Int -> a -> b) -> Vector a -> Vector b
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (Int -> a -> b) -> v a -> v b
    G.imap

    -- | Map a function over a vector and concatenate the results.
    concatMap :: (Unbox a, Unbox b) => (a -> Vector b) -> Vector a -> Vector b
    {-# INLINE concatMap #-}
    concatMap :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> Vector b) -> Vector a -> Vector b
    concatMap = (a -> Vector b) -> Vector a -> Vector b
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (a -> v b) -> v a -> v b
    G.concatMap

    -- Monadic mapping
    -- ---------------

    -- | /O(n)/ Apply the monadic action to all elements of the vector, yielding a
    -- vector of results.
    mapM :: (Monad m, Unbox a, Unbox b) => (a -> m b) -> Vector a -> m (Vector b)
    {-# INLINE mapM #-}
    mapM :: forall (m :: * -> *) a b.
    (Monad m, Unbox a, Unbox b) =>
    (a -> m b) -> Vector a -> m (Vector b)
    mapM = (a -> m b) -> Vector a -> m (Vector b)
    forall (m :: * -> *) (v :: * -> *) a b.
    (Monad m, Vector v a, Vector v b) =>
    (a -> m b) -> v a -> m (v b)
    G.mapM

    -- | /O(n)/ Apply the monadic action to every element of a vector and its
    -- index, yielding a vector of results.
    imapM :: (Monad m, Unbox a, Unbox b)
          => (Int -> a -> m b) -> Vector a -> m (Vector b)
    {-# INLINE imapM #-}
    imapM :: forall (m :: * -> *) a b.
    (Monad m, Unbox a, Unbox b) =>
    (Int -> a -> m b) -> Vector a -> m (Vector b)
    imapM = (Int -> a -> m b) -> Vector a -> m (Vector b)
    forall (m :: * -> *) (v :: * -> *) a b.
    (Monad m, Vector v a, Vector v b) =>
    (Int -> a -> m b) -> v a -> m (v b)
    G.imapM

    -- | /O(n)/ Apply the monadic action to all elements of a vector and ignore the
    -- results.
    mapM_ :: (Monad m, Unbox a) => (a -> m b) -> Vector a -> m ()
    {-# INLINE mapM_ #-}
    mapM_ :: forall (m :: * -> *) a b.
    (Monad m, Unbox a) =>
    (a -> m b) -> Vector a -> m ()
    mapM_ = (a -> m b) -> Vector a -> m ()
    forall (m :: * -> *) (v :: * -> *) a b.
    (Monad m, Vector v a) =>
    (a -> m b) -> v a -> m ()
    G.mapM_

    -- | /O(n)/ Apply the monadic action to every element of a vector and its
    -- index, ignoring the results.
    imapM_ :: (Monad m, Unbox a) => (Int -> a -> m b) -> Vector a -> m ()
    {-# INLINE imapM_ #-}
    imapM_ :: forall (m :: * -> *) a b.
    (Monad m, Unbox a) =>
    (Int -> a -> m b) -> Vector a -> m ()
    imapM_ = (Int -> a -> m b) -> Vector a -> m ()
    forall (m :: * -> *) (v :: * -> *) a b.
    (Monad m, Vector v a) =>
    (Int -> a -> m b) -> v a -> m ()
    G.imapM_

    -- | /O(n)/ Apply the monadic action to all elements of the vector, yielding a
    -- vector of results. Equivalent to @flip 'mapM'@.
    forM :: (Monad m, Unbox a, Unbox b) => Vector a -> (a -> m b) -> m (Vector b)
    {-# INLINE forM #-}
    forM :: forall (m :: * -> *) a b.
    (Monad m, Unbox a, Unbox b) =>
    Vector a -> (a -> m b) -> m (Vector b)
    forM = Vector a -> (a -> m b) -> m (Vector b)
    forall (m :: * -> *) (v :: * -> *) a b.
    (Monad m, Vector v a, Vector v b) =>
    v a -> (a -> m b) -> m (v b)
    G.forM

    -- | /O(n)/ Apply the monadic action to all elements of a vector and ignore the
    -- results. Equivalent to @flip 'mapM_'@.
    forM_ :: (Monad m, Unbox a) => Vector a -> (a -> m b) -> m ()
    {-# INLINE forM_ #-}
    forM_ :: forall (m :: * -> *) a b.
    (Monad m, Unbox a) =>
    Vector a -> (a -> m b) -> m ()
    forM_ = Vector a -> (a -> m b) -> m ()
    forall (m :: * -> *) (v :: * -> *) a b.
    (Monad m, Vector v a) =>
    v a -> (a -> m b) -> m ()
    G.forM_

    -- | /O(n)/ Apply the monadic action to all elements of the vector and their indices, yielding a
    -- vector of results. Equivalent to @'flip' 'imapM'@.
    --
    -- @since 0.12.2.0
    iforM :: (Monad m, Unbox a, Unbox b) => Vector a -> (Int -> a -> m b) -> m (Vector b)
    {-# INLINE iforM #-}
    iforM :: forall (m :: * -> *) a b.
    (Monad m, Unbox a, Unbox b) =>
    Vector a -> (Int -> a -> m b) -> m (Vector b)
    iforM = Vector a -> (Int -> a -> m b) -> m (Vector b)
    forall (m :: * -> *) (v :: * -> *) a b.
    (Monad m, Vector v a, Vector v b) =>
    v a -> (Int -> a -> m b) -> m (v b)
    G.iforM

    -- | /O(n)/ Apply the monadic action to all elements of the vector and their indices
    -- and ignore the results. Equivalent to @'flip' 'imapM_'@.
    --
    -- @since 0.12.2.0
    iforM_ :: (Monad m, Unbox a) => Vector a -> (Int -> a -> m b) -> m ()
    {-# INLINE iforM_ #-}
    iforM_ :: forall (m :: * -> *) a b.
    (Monad m, Unbox a) =>
    Vector a -> (Int -> a -> m b) -> m ()
    iforM_ = Vector a -> (Int -> a -> m b) -> m ()
    forall (m :: * -> *) (v :: * -> *) a b.
    (Monad m, Vector v a) =>
    v a -> (Int -> a -> m b) -> m ()
    G.iforM_

    -- Zipping
    -- -------

    -- $zip
    --
    -- Following functions could be used to construct vector of tuples
    -- from tuple of vectors. This operation is done in /O(1)/ time and
    -- will share underlying buffers.
    --
    -- Note that variants from "Data.Vector.Generic" doesn't have this
    -- property.

    -- $unzip
    --
    -- Following functions could be used to access underlying
    -- representation of array of tuples. They convert array to tuple of
    -- arrays. This operation is done in /O(1)/ time and will share
    -- underlying buffers.
    --
    -- Note that variants from "Data.Vector.Generic" doesn't have this
    -- property.

    -- | /O(min(m,n))/ Zip two vectors with the given function.
    zipWith :: (Unbox a, Unbox b, Unbox c)
            => (a -> b -> c) -> Vector a -> Vector b -> Vector c
    {-# INLINE zipWith #-}
    zipWith :: forall a b c.
    (Unbox a, Unbox b, Unbox c) =>
    (a -> b -> c) -> Vector a -> Vector b -> Vector c
    zipWith = (a -> b -> c) -> Vector a -> Vector b -> Vector c
    forall (v :: * -> *) a b c.
    (Vector v a, Vector v b, Vector v c) =>
    (a -> b -> c) -> v a -> v b -> v c
    G.zipWith

    -- | Zip three vectors with the given function.
    zipWith3 :: (Unbox a, Unbox b, Unbox c, Unbox d)
             => (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d
    {-# INLINE zipWith3 #-}
    zipWith3 :: forall a b c d.
    (Unbox a, Unbox b, Unbox c, Unbox d) =>
    (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d
    zipWith3 = (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d
    forall (v :: * -> *) a b c d.
    (Vector v a, Vector v b, Vector v c, Vector v d) =>
    (a -> b -> c -> d) -> v a -> v b -> v c -> v d
    G.zipWith3

    zipWith4 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e)
             => (a -> b -> c -> d -> e)
             -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
    {-# INLINE zipWith4 #-}
    zipWith4 :: forall a b c d e.
    (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) =>
    (a -> b -> c -> d -> e)
    -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
    zipWith4 = (a -> b -> c -> d -> e)
    -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
    forall (v :: * -> *) a b c d e.
    (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e) =>
    (a -> b -> c -> d -> e) -> v a -> v b -> v c -> v d -> v e
    G.zipWith4

    zipWith5 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f)
             => (a -> b -> c -> d -> e -> f)
             -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
             -> Vector f
    {-# INLINE zipWith5 #-}
    zipWith5 :: forall a b c d e f.
    (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) =>
    (a -> b -> c -> d -> e -> f)
    -> Vector a
    -> Vector b
    -> Vector c
    -> Vector d
    -> Vector e
    -> Vector f
    zipWith5 = (a -> b -> c -> d -> e -> f)
    -> Vector a
    -> Vector b
    -> Vector c
    -> Vector d
    -> Vector e
    -> Vector f
    forall (v :: * -> *) a b c d e f.
    (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e,
     Vector v f) =>
    (a -> b -> c -> d -> e -> f)
    -> v a -> v b -> v c -> v d -> v e -> v f
    G.zipWith5

    zipWith6 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f, Unbox g)
             => (a -> b -> c -> d -> e -> f -> g)
             -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
             -> Vector f -> Vector g
    {-# INLINE zipWith6 #-}
    zipWith6 :: forall a b c d e f g.
    (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f, Unbox g) =>
    (a -> b -> c -> d -> e -> f -> g)
    -> Vector a
    -> Vector b
    -> Vector c
    -> Vector d
    -> Vector e
    -> Vector f
    -> Vector g
    zipWith6 = (a -> b -> c -> d -> e -> f -> g)
    -> Vector a
    -> Vector b
    -> Vector c
    -> Vector d
    -> Vector e
    -> Vector f
    -> Vector g
    forall (v :: * -> *) a b c d e f g.
    (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e,
     Vector v f, Vector v g) =>
    (a -> b -> c -> d -> e -> f -> g)
    -> v a -> v b -> v c -> v d -> v e -> v f -> v g
    G.zipWith6

    -- | /O(min(m,n))/ Zip two vectors with a function that also takes the
    -- elements' indices.
    izipWith :: (Unbox a, Unbox b, Unbox c)
             => (Int -> a -> b -> c) -> Vector a -> Vector b -> Vector c
    {-# INLINE izipWith #-}
    izipWith :: forall a b c.
    (Unbox a, Unbox b, Unbox c) =>
    (Int -> a -> b -> c) -> Vector a -> Vector b -> Vector c
    izipWith = (Int -> a -> b -> c) -> Vector a -> Vector b -> Vector c
    forall (v :: * -> *) a b c.
    (Vector v a, Vector v b, Vector v c) =>
    (Int -> a -> b -> c) -> v a -> v b -> v c
    G.izipWith

    -- | Zip three vectors and their indices with the given function.
    izipWith3 :: (Unbox a, Unbox b, Unbox c, Unbox d)
              => (Int -> a -> b -> c -> d)
              -> Vector a -> Vector b -> Vector c -> Vector d
    {-# INLINE izipWith3 #-}
    izipWith3 :: forall a b c d.
    (Unbox a, Unbox b, Unbox c, Unbox d) =>
    (Int -> a -> b -> c -> d)
    -> Vector a -> Vector b -> Vector c -> Vector d
    izipWith3 = (Int -> a -> b -> c -> d)
    -> Vector a -> Vector b -> Vector c -> Vector d
    forall (v :: * -> *) a b c d.
    (Vector v a, Vector v b, Vector v c, Vector v d) =>
    (Int -> a -> b -> c -> d) -> v a -> v b -> v c -> v d
    G.izipWith3

    izipWith4 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e)
              => (Int -> a -> b -> c -> d -> e)
              -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
    {-# INLINE izipWith4 #-}
    izipWith4 :: forall a b c d e.
    (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) =>
    (Int -> a -> b -> c -> d -> e)
    -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
    izipWith4 = (Int -> a -> b -> c -> d -> e)
    -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
    forall (v :: * -> *) a b c d e.
    (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e) =>
    (Int -> a -> b -> c -> d -> e) -> v a -> v b -> v c -> v d -> v e
    G.izipWith4

    izipWith5 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f)
              => (Int -> a -> b -> c -> d -> e -> f)
              -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
              -> Vector f
    {-# INLINE izipWith5 #-}
    izipWith5 :: forall a b c d e f.
    (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) =>
    (Int -> a -> b -> c -> d -> e -> f)
    -> Vector a
    -> Vector b
    -> Vector c
    -> Vector d
    -> Vector e
    -> Vector f
    izipWith5 = (Int -> a -> b -> c -> d -> e -> f)
    -> Vector a
    -> Vector b
    -> Vector c
    -> Vector d
    -> Vector e
    -> Vector f
    forall (v :: * -> *) a b c d e f.
    (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e,
     Vector v f) =>
    (Int -> a -> b -> c -> d -> e -> f)
    -> v a -> v b -> v c -> v d -> v e -> v f
    G.izipWith5

    izipWith6 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f, Unbox g)
              => (Int -> a -> b -> c -> d -> e -> f -> g)
              -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
              -> Vector f -> Vector g
    {-# INLINE izipWith6 #-}
    izipWith6 :: forall a b c d e f g.
    (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f, Unbox g) =>
    (Int -> a -> b -> c -> d -> e -> f -> g)
    -> Vector a
    -> Vector b
    -> Vector c
    -> Vector d
    -> Vector e
    -> Vector f
    -> Vector g
    izipWith6 = (Int -> a -> b -> c -> d -> e -> f -> g)
    -> Vector a
    -> Vector b
    -> Vector c
    -> Vector d
    -> Vector e
    -> Vector f
    -> Vector g
    forall (v :: * -> *) a b c d e f g.
    (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e,
     Vector v f, Vector v g) =>
    (Int -> a -> b -> c -> d -> e -> f -> g)
    -> v a -> v b -> v c -> v d -> v e -> v f -> v g
    G.izipWith6

    -- Monadic zipping
    -- ---------------

    -- | /O(min(m,n))/ Zip the two vectors with the monadic action and yield a
    -- vector of results.
    zipWithM :: (Monad m, Unbox a, Unbox b, Unbox c)
             => (a -> b -> m c) -> Vector a -> Vector b -> m (Vector c)
    {-# INLINE zipWithM #-}
    zipWithM :: forall (m :: * -> *) a b c.
    (Monad m, Unbox a, Unbox b, Unbox c) =>
    (a -> b -> m c) -> Vector a -> Vector b -> m (Vector c)
    zipWithM = (a -> b -> m c) -> Vector a -> Vector b -> m (Vector c)
    forall (m :: * -> *) (v :: * -> *) a b c.
    (Monad m, Vector v a, Vector v b, Vector v c) =>
    (a -> b -> m c) -> v a -> v b -> m (v c)
    G.zipWithM

    -- | /O(min(m,n))/ Zip the two vectors with a monadic action that also takes
    -- the element index and yield a vector of results.
    izipWithM :: (Monad m, Unbox a, Unbox b, Unbox c)
              => (Int -> a -> b -> m c) -> Vector a -> Vector b -> m (Vector c)
    {-# INLINE izipWithM #-}
    izipWithM :: forall (m :: * -> *) a b c.
    (Monad m, Unbox a, Unbox b, Unbox c) =>
    (Int -> a -> b -> m c) -> Vector a -> Vector b -> m (Vector c)
    izipWithM = (Int -> a -> b -> m c) -> Vector a -> Vector b -> m (Vector c)
    forall (m :: * -> *) (v :: * -> *) a b c.
    (Monad m, Vector v a, Vector v b, Vector v c) =>
    (Int -> a -> b -> m c) -> v a -> v b -> m (v c)
    G.izipWithM

    -- | /O(min(m,n))/ Zip the two vectors with the monadic action and ignore the
    -- results.
    zipWithM_ :: (Monad m, Unbox a, Unbox b)
              => (a -> b -> m c) -> Vector a -> Vector b -> m ()
    {-# INLINE zipWithM_ #-}
    zipWithM_ :: forall (m :: * -> *) a b c.
    (Monad m, Unbox a, Unbox b) =>
    (a -> b -> m c) -> Vector a -> Vector b -> m ()
    zipWithM_ = (a -> b -> m c) -> Vector a -> Vector b -> m ()
    forall (m :: * -> *) (v :: * -> *) a b c.
    (Monad m, Vector v a, Vector v b) =>
    (a -> b -> m c) -> v a -> v b -> m ()
    G.zipWithM_

    -- | /O(min(m,n))/ Zip the two vectors with a monadic action that also takes
    -- the element index and ignore the results.
    izipWithM_ :: (Monad m, Unbox a, Unbox b)
               => (Int -> a -> b -> m c) -> Vector a -> Vector b -> m ()
    {-# INLINE izipWithM_ #-}
    izipWithM_ :: forall (m :: * -> *) a b c.
    (Monad m, Unbox a, Unbox b) =>
    (Int -> a -> b -> m c) -> Vector a -> Vector b -> m ()
    izipWithM_ = (Int -> a -> b -> m c) -> Vector a -> Vector b -> m ()
    forall (m :: * -> *) (v :: * -> *) a b c.
    (Monad m, Vector v a, Vector v b) =>
    (Int -> a -> b -> m c) -> v a -> v b -> m ()
    G.izipWithM_

    -- Filtering
    -- ---------

    -- | /O(n)/ Drop all elements that do not satisfy the predicate.
    filter :: Unbox a => (a -> Bool) -> Vector a -> Vector a
    {-# INLINE filter #-}
    filter :: forall a. Unbox a => (a -> Bool) -> Vector a -> Vector a
    filter = (a -> Bool) -> Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => (a -> Bool) -> v a -> v a
    G.filter

    -- | /O(n)/ Drop all elements that do not satisfy the predicate which is applied to
    -- the values and their indices.
    ifilter :: Unbox a => (Int -> a -> Bool) -> Vector a -> Vector a
    {-# INLINE ifilter #-}
    ifilter :: forall a. Unbox a => (Int -> a -> Bool) -> Vector a -> Vector a
    ifilter = (Int -> a -> Bool) -> Vector a -> Vector a
    forall (v :: * -> *) a.
    Vector v a =>
    (Int -> a -> Bool) -> v a -> v a
    G.ifilter

    -- | /O(n)/ Drop repeated adjacent elements. The first element in each group is returned.
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.uniq $ VU.fromList [1,3,3,200,3 :: Int]
    -- [1,3,200,3]
    -- >>> import Data.Semigroup
    -- >>> VU.uniq $ VU.fromList [ Arg 1 'a', Arg 1 'b', Arg (1 :: Int) 'c']
    -- [Arg 1 'a']
    uniq :: (Unbox a, Eq a) => Vector a -> Vector a
    {-# INLINE uniq #-}
    uniq :: forall a. (Unbox a, Eq a) => Vector a -> Vector a
    uniq = Vector a -> Vector a
    forall (v :: * -> *) a. (Vector v a, Eq a) => v a -> v a
    G.uniq

    -- | /O(n)/ Map the values and collect the 'Just' results.
    mapMaybe :: (Unbox a, Unbox b) => (a -> Maybe b) -> Vector a -> Vector b
    {-# INLINE mapMaybe #-}
    mapMaybe :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> Maybe b) -> Vector a -> Vector b
    mapMaybe = (a -> Maybe b) -> Vector a -> Vector b
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (a -> Maybe b) -> v a -> v b
    G.mapMaybe

    -- | /O(n)/ Map the indices/values and collect the 'Just' results.
    imapMaybe :: (Unbox a, Unbox b) => (Int -> a -> Maybe b) -> Vector a -> Vector b
    {-# INLINE imapMaybe #-}
    imapMaybe :: forall a b.
    (Unbox a, Unbox b) =>
    (Int -> a -> Maybe b) -> Vector a -> Vector b
    imapMaybe = (Int -> a -> Maybe b) -> Vector a -> Vector b
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (Int -> a -> Maybe b) -> v a -> v b
    G.imapMaybe

    -- | /O(n)/ Drop all elements that do not satisfy the monadic predicate.
    filterM :: (Monad m, Unbox a) => (a -> m Bool) -> Vector a -> m (Vector a)
    {-# INLINE filterM #-}
    filterM :: forall (m :: * -> *) a.
    (Monad m, Unbox a) =>
    (a -> m Bool) -> Vector a -> m (Vector a)
    filterM = (a -> m Bool) -> Vector a -> m (Vector a)
    forall (m :: * -> *) (v :: * -> *) a.
    (Monad m, Vector v a) =>
    (a -> m Bool) -> v a -> m (v a)
    G.filterM

    -- | /O(n)/ Apply the monadic function to each element of the vector and
    -- discard elements returning 'Nothing'.
    --
    -- @since 0.12.2.0
    mapMaybeM :: (Monad m, Unbox a, Unbox b) => (a -> m (Maybe b)) -> Vector a -> m (Vector b)
    {-# INLINE mapMaybeM #-}
    mapMaybeM :: forall (m :: * -> *) a b.
    (Monad m, Unbox a, Unbox b) =>
    (a -> m (Maybe b)) -> Vector a -> m (Vector b)
    mapMaybeM = (a -> m (Maybe b)) -> Vector a -> m (Vector b)
    forall (m :: * -> *) (v :: * -> *) a b.
    (Monad m, Vector v a, Vector v b) =>
    (a -> m (Maybe b)) -> v a -> m (v b)
    G.mapMaybeM

    -- | /O(n)/ Apply the monadic function to each element of the vector and its index.
    -- Discard elements returning 'Nothing'.
    --
    -- @since 0.12.2.0
    imapMaybeM :: (Monad m, Unbox a, Unbox b) => (Int -> a -> m (Maybe b)) -> Vector a -> m (Vector b)
    {-# INLINE imapMaybeM #-}
    imapMaybeM :: forall (m :: * -> *) a b.
    (Monad m, Unbox a, Unbox b) =>
    (Int -> a -> m (Maybe b)) -> Vector a -> m (Vector b)
    imapMaybeM = (Int -> a -> m (Maybe b)) -> Vector a -> m (Vector b)
    forall (m :: * -> *) (v :: * -> *) a b.
    (Monad m, Vector v a, Vector v b) =>
    (Int -> a -> m (Maybe b)) -> v a -> m (v b)
    G.imapMaybeM

    -- | /O(n)/ Yield the longest prefix of elements satisfying the predicate.
    -- The current implementation is not copy-free, unless the result vector is
    -- fused away.
    takeWhile :: Unbox a => (a -> Bool) -> Vector a -> Vector a
    {-# INLINE takeWhile #-}
    takeWhile :: forall a. Unbox a => (a -> Bool) -> Vector a -> Vector a
    takeWhile = (a -> Bool) -> Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => (a -> Bool) -> v a -> v a
    G.takeWhile

    -- | /O(n)/ Drop the longest prefix of elements that satisfy the predicate
    -- without copying.
    dropWhile :: Unbox a => (a -> Bool) -> Vector a -> Vector a
    {-# INLINE dropWhile #-}
    dropWhile :: forall a. Unbox a => (a -> Bool) -> Vector a -> Vector a
    dropWhile = (a -> Bool) -> Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => (a -> Bool) -> v a -> v a
    G.dropWhile

    -- Partitioning
    -- -------------

    -- | /O(n)/ Split the vector in two parts, the first one containing those
    -- elements that satisfy the predicate and the second one those that don't. The
    -- relative order of the elements is preserved at the cost of a sometimes
    -- reduced performance compared to 'unstablePartition'.
    partition :: Unbox a => (a -> Bool) -> Vector a -> (Vector a, Vector a)
    {-# INLINE partition #-}
    partition :: forall a.
    Unbox a =>
    (a -> Bool) -> Vector a -> (Vector a, Vector a)
    partition = (a -> Bool) -> Vector a -> (Vector a, Vector a)
    forall (v :: * -> *) a.
    Vector v a =>
    (a -> Bool) -> v a -> (v a, v a)
    G.partition

    -- | /O(n)/ Split the vector into two parts, the first one containing the
    -- @`Left`@ elements and the second containing the @`Right`@ elements.
    -- The relative order of the elements is preserved.
    --
    -- @since 0.12.1.0
    partitionWith :: (Unbox a, Unbox b, Unbox c) => (a -> Either b c) -> Vector a -> (Vector b, Vector c)
    {-# INLINE partitionWith #-}
    partitionWith :: forall a b c.
    (Unbox a, Unbox b, Unbox c) =>
    (a -> Either b c) -> Vector a -> (Vector b, Vector c)
    partitionWith = (a -> Either b c) -> Vector a -> (Vector b, Vector c)
    forall (v :: * -> *) a b c.
    (Vector v a, Vector v b, Vector v c) =>
    (a -> Either b c) -> v a -> (v b, v c)
    G.partitionWith

    -- | /O(n)/ Split the vector in two parts, the first one containing those
    -- elements that satisfy the predicate and the second one those that don't.
    -- The order of the elements is not preserved, but the operation is often
    -- faster than 'partition'.
    unstablePartition :: Unbox a => (a -> Bool) -> Vector a -> (Vector a, Vector a)
    {-# INLINE unstablePartition #-}
    unstablePartition :: forall a.
    Unbox a =>
    (a -> Bool) -> Vector a -> (Vector a, Vector a)
    unstablePartition = (a -> Bool) -> Vector a -> (Vector a, Vector a)
    forall (v :: * -> *) a.
    Vector v a =>
    (a -> Bool) -> v a -> (v a, v a)
    G.unstablePartition

    -- | /O(n)/ Split the vector into the longest prefix of elements that satisfy
    -- the predicate and the rest without copying.
    --
    -- Does not fuse.
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.span (<4) $ VU.generate 10 id
    -- ([0,1,2,3],[4,5,6,7,8,9])
    span :: Unbox a => (a -> Bool) -> Vector a -> (Vector a, Vector a)
    {-# INLINE span #-}
    span :: forall a.
    Unbox a =>
    (a -> Bool) -> Vector a -> (Vector a, Vector a)
    span = (a -> Bool) -> Vector a -> (Vector a, Vector a)
    forall (v :: * -> *) a.
    Vector v a =>
    (a -> Bool) -> v a -> (v a, v a)
    G.span

    -- | /O(n)/ Split the vector into the longest prefix of elements that do not
    -- satisfy the predicate and the rest without copying.
    --
    -- Does not fuse.
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.break (>4) $ VU.generate 10 id
    -- ([0,1,2,3,4],[5,6,7,8,9])
    break :: Unbox a => (a -> Bool) -> Vector a -> (Vector a, Vector a)
    {-# INLINE break #-}
    break :: forall a.
    Unbox a =>
    (a -> Bool) -> Vector a -> (Vector a, Vector a)
    break = (a -> Bool) -> Vector a -> (Vector a, Vector a)
    forall (v :: * -> *) a.
    Vector v a =>
    (a -> Bool) -> v a -> (v a, v a)
    G.break

    -- | /O(n)/ Split the vector into the longest prefix of elements that satisfy
    -- the predicate and the rest without copying.
    --
    -- Does not fuse.
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.spanR (>4) $ VU.generate 10 id
    -- ([5,6,7,8,9],[0,1,2,3,4])
    spanR :: Unbox a => (a -> Bool) -> Vector a -> (Vector a, Vector a)
    {-# INLINE spanR #-}
    spanR :: forall a.
    Unbox a =>
    (a -> Bool) -> Vector a -> (Vector a, Vector a)
    spanR = (a -> Bool) -> Vector a -> (Vector a, Vector a)
    forall (v :: * -> *) a.
    Vector v a =>
    (a -> Bool) -> v a -> (v a, v a)
    G.spanR

    -- | /O(n)/ Split the vector into the longest prefix of elements that do not
    -- satisfy the predicate and the rest without copying.
    --
    -- Does not fuse.
    --
    -- @since NEXT_VERSION
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.breakR (<5) $ VU.generate 10 id
    -- ([5,6,7,8,9],[0,1,2,3,4])
    breakR :: Unbox a => (a -> Bool) -> Vector a -> (Vector a, Vector a)
    {-# INLINE breakR #-}
    breakR :: forall a.
    Unbox a =>
    (a -> Bool) -> Vector a -> (Vector a, Vector a)
    breakR = (a -> Bool) -> Vector a -> (Vector a, Vector a)
    forall (v :: * -> *) a.
    Vector v a =>
    (a -> Bool) -> v a -> (v a, v a)
    G.breakR

    -- | /O(n)/ Split a vector into a list of slices, using a predicate function.
    --
    -- The concatenation of this list of slices is equal to the argument vector,
    -- and each slice contains only equal elements, as determined by the equality
    -- predicate function.
    --
    -- Does not fuse.
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> import           Data.Char (isUpper)
    -- >>> VU.groupBy (\a b -> isUpper a == isUpper b) (VU.fromList "Mississippi River")
    -- ["M","ississippi ","R","iver"]
    --
    -- See also 'Data.List.groupBy', 'group'.
    --
    -- @since 0.13.0.1
    groupBy :: Unbox a => (a -> a -> Bool) -> Vector a -> [Vector a]
    groupBy :: forall a. Unbox a => (a -> a -> Bool) -> Vector a -> [Vector a]
    groupBy = (a -> a -> Bool) -> Vector a -> [Vector a]
    forall (v :: * -> *) a.
    Vector v a =>
    (a -> a -> Bool) -> v a -> [v a]
    G.groupBy

    -- | /O(n)/ Split a vector into a list of slices of the input vector.
    --
    -- The concatenation of this list of slices is equal to the argument vector,
    -- and each slice contains only equal elements.
    --
    -- Does not fuse.
    --
    -- This is the equivalent of 'groupBy (==)'.
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.group (VU.fromList "Mississippi")
    -- ["M","i","ss","i","ss","i","pp","i"]
    --
    -- See also 'Data.List.group'.
    --
    -- @since 0.13.0.1
    group :: (Unbox a, Eq a) => Vector a -> [Vector a]
    group :: forall a. (Unbox a, Eq a) => Vector a -> [Vector a]
    group = (a -> a -> Bool) -> Vector a -> [Vector a]
    forall (v :: * -> *) a.
    Vector v a =>
    (a -> a -> Bool) -> v a -> [v a]
    G.groupBy a -> a -> Bool
    forall a. Eq a => a -> a -> Bool
    (==)

    -- Searching
    -- ---------

    infix 4 `elem`
    -- | /O(n)/ Check if the vector contains an element.
    elem :: (Unbox a, Eq a) => a -> Vector a -> Bool
    {-# INLINE elem #-}
    elem :: forall a. (Unbox a, Eq a) => a -> Vector a -> Bool
    elem = a -> Vector a -> Bool
    forall (v :: * -> *) a. (Vector v a, Eq a) => a -> v a -> Bool
    G.elem

    infix 4 `notElem`
    -- | /O(n)/ Check if the vector does not contain an element (inverse of 'elem').
    notElem :: (Unbox a, Eq a) => a -> Vector a -> Bool
    {-# INLINE notElem #-}
    notElem :: forall a. (Unbox a, Eq a) => a -> Vector a -> Bool
    notElem = a -> Vector a -> Bool
    forall (v :: * -> *) a. (Vector v a, Eq a) => a -> v a -> Bool
    G.notElem

    -- | /O(n)/ Yield 'Just' the first element matching the predicate or 'Nothing'
    -- if no such element exists.
    find :: Unbox a => (a -> Bool) -> Vector a -> Maybe a
    {-# INLINE find #-}
    find :: forall a. Unbox a => (a -> Bool) -> Vector a -> Maybe a
    find = (a -> Bool) -> Vector a -> Maybe a
    forall (v :: * -> *) a. Vector v a => (a -> Bool) -> v a -> Maybe a
    G.find

    -- | /O(n)/ Yield 'Just' the index of the first element matching the predicate
    -- or 'Nothing' if no such element exists.
    findIndex :: Unbox a => (a -> Bool) -> Vector a -> Maybe Int
    {-# INLINE findIndex #-}
    findIndex :: forall a. Unbox a => (a -> Bool) -> Vector a -> Maybe Int
    findIndex = (a -> Bool) -> Vector a -> Maybe Int
    forall (v :: * -> *) a.
    Vector v a =>
    (a -> Bool) -> v a -> Maybe Int
    G.findIndex

    -- | /O(n)/ Yield 'Just' the index of the /last/ element matching the predicate
    -- or 'Nothing' if no such element exists.
    --
    -- Does not fuse.
    findIndexR :: Unbox a => (a -> Bool) -> Vector a -> Maybe Int
    {-# INLINE findIndexR #-}
    findIndexR :: forall a. Unbox a => (a -> Bool) -> Vector a -> Maybe Int
    findIndexR = (a -> Bool) -> Vector a -> Maybe Int
    forall (v :: * -> *) a.
    Vector v a =>
    (a -> Bool) -> v a -> Maybe Int
    G.findIndexR

    -- | /O(n)/ Yield the indices of elements satisfying the predicate in ascending
    -- order.
    findIndices :: Unbox a => (a -> Bool) -> Vector a -> Vector Int
    {-# INLINE findIndices #-}
    findIndices :: forall a. Unbox a => (a -> Bool) -> Vector a -> Vector Int
    findIndices = (a -> Bool) -> Vector a -> Vector Int
    forall (v :: * -> *) a.
    (Vector v a, Vector v Int) =>
    (a -> Bool) -> v a -> v Int
    G.findIndices

    -- | /O(n)/ Yield 'Just' the index of the first occurrence of the given element or
    -- 'Nothing' if the vector does not contain the element. This is a specialised
    -- version of 'findIndex'.
    elemIndex :: (Unbox a, Eq a) => a -> Vector a -> Maybe Int
    {-# INLINE elemIndex #-}
    elemIndex :: forall a. (Unbox a, Eq a) => a -> Vector a -> Maybe Int
    elemIndex = a -> Vector a -> Maybe Int
    forall (v :: * -> *) a. (Vector v a, Eq a) => a -> v a -> Maybe Int
    G.elemIndex

    -- | /O(n)/ Yield the indices of all occurrences of the given element in
    -- ascending order. This is a specialised version of 'findIndices'.
    elemIndices :: (Unbox a, Eq a) => a -> Vector a -> Vector Int
    {-# INLINE elemIndices #-}
    elemIndices :: forall a. (Unbox a, Eq a) => a -> Vector a -> Vector Int
    elemIndices = a -> Vector a -> Vector Int
    forall (v :: * -> *) a.
    (Vector v a, Vector v Int, Eq a) =>
    a -> v a -> v Int
    G.elemIndices

    -- Folding
    -- -------

    -- | /O(n)/ Left fold.
    foldl :: Unbox b => (a -> b -> a) -> a -> Vector b -> a
    {-# INLINE foldl #-}
    foldl :: forall b a. Unbox b => (a -> b -> a) -> a -> Vector b -> a
    foldl = (a -> b -> a) -> a -> Vector b -> a
    forall (v :: * -> *) b a.
    Vector v b =>
    (a -> b -> a) -> a -> v b -> a
    G.foldl

    -- | /O(n)/ Left fold on non-empty vectors.
    foldl1 :: Unbox a => (a -> a -> a) -> Vector a -> a
    {-# INLINE foldl1 #-}
    foldl1 :: forall a. Unbox a => (a -> a -> a) -> Vector a -> a
    foldl1 = (a -> a -> a) -> Vector a -> a
    forall (v :: * -> *) a. Vector v a => (a -> a -> a) -> v a -> a
    G.foldl1

    -- | /O(n)/ Left fold with strict accumulator.
    foldl' :: Unbox b => (a -> b -> a) -> a -> Vector b -> a
    {-# INLINE foldl' #-}
    foldl' :: forall b a. Unbox b => (a -> b -> a) -> a -> Vector b -> a
    foldl' = (a -> b -> a) -> a -> Vector b -> a
    forall (v :: * -> *) b a.
    Vector v b =>
    (a -> b -> a) -> a -> v b -> a
    G.foldl'

    -- | /O(n)/ Left fold on non-empty vectors with strict accumulator.
    foldl1' :: Unbox a => (a -> a -> a) -> Vector a -> a
    {-# INLINE foldl1' #-}
    foldl1' :: forall a. Unbox a => (a -> a -> a) -> Vector a -> a
    foldl1' = (a -> a -> a) -> Vector a -> a
    forall (v :: * -> *) a. Vector v a => (a -> a -> a) -> v a -> a
    G.foldl1'

    -- | /O(n)/ Right fold.
    foldr :: Unbox a => (a -> b -> b) -> b -> Vector a -> b
    {-# INLINE foldr #-}
    foldr :: forall a b. Unbox a => (a -> b -> b) -> b -> Vector a -> b
    foldr = (a -> b -> b) -> b -> Vector a -> b
    forall (v :: * -> *) a b.
    Vector v a =>
    (a -> b -> b) -> b -> v a -> b
    G.foldr

    -- | /O(n)/ Right fold on non-empty vectors.
    foldr1 :: Unbox a => (a -> a -> a) -> Vector a -> a
    {-# INLINE foldr1 #-}
    foldr1 :: forall a. Unbox a => (a -> a -> a) -> Vector a -> a
    foldr1 = (a -> a -> a) -> Vector a -> a
    forall (v :: * -> *) a. Vector v a => (a -> a -> a) -> v a -> a
    G.foldr1

    -- | /O(n)/ Right fold with a strict accumulator.
    foldr' :: Unbox a => (a -> b -> b) -> b -> Vector a -> b
    {-# INLINE foldr' #-}
    foldr' :: forall a b. Unbox a => (a -> b -> b) -> b -> Vector a -> b
    foldr' = (a -> b -> b) -> b -> Vector a -> b
    forall (v :: * -> *) a b.
    Vector v a =>
    (a -> b -> b) -> b -> v a -> b
    G.foldr'

    -- | /O(n)/ Right fold on non-empty vectors with strict accumulator.
    foldr1' :: Unbox a => (a -> a -> a) -> Vector a -> a
    {-# INLINE foldr1' #-}
    foldr1' :: forall a. Unbox a => (a -> a -> a) -> Vector a -> a
    foldr1' = (a -> a -> a) -> Vector a -> a
    forall (v :: * -> *) a. Vector v a => (a -> a -> a) -> v a -> a
    G.foldr1'

    -- | /O(n)/ Left fold using a function applied to each element and its index.
    ifoldl :: Unbox b => (a -> Int -> b -> a) -> a -> Vector b -> a
    {-# INLINE ifoldl #-}
    ifoldl :: forall b a. Unbox b => (a -> Int -> b -> a) -> a -> Vector b -> a
    ifoldl = (a -> Int -> b -> a) -> a -> Vector b -> a
    forall (v :: * -> *) b a.
    Vector v b =>
    (a -> Int -> b -> a) -> a -> v b -> a
    G.ifoldl

    -- | /O(n)/ Left fold with strict accumulator using a function applied to each element
    -- and its index.
    ifoldl' :: Unbox b => (a -> Int -> b -> a) -> a -> Vector b -> a
    {-# INLINE ifoldl' #-}
    ifoldl' :: forall b a. Unbox b => (a -> Int -> b -> a) -> a -> Vector b -> a
    ifoldl' = (a -> Int -> b -> a) -> a -> Vector b -> a
    forall (v :: * -> *) b a.
    Vector v b =>
    (a -> Int -> b -> a) -> a -> v b -> a
    G.ifoldl'

    -- | /O(n)/ Right fold using a function applied to each element and its index.
    ifoldr :: Unbox a => (Int -> a -> b -> b) -> b -> Vector a -> b
    {-# INLINE ifoldr #-}
    ifoldr :: forall a b. Unbox a => (Int -> a -> b -> b) -> b -> Vector a -> b
    ifoldr = (Int -> a -> b -> b) -> b -> Vector a -> b
    forall (v :: * -> *) a b.
    Vector v a =>
    (Int -> a -> b -> b) -> b -> v a -> b
    G.ifoldr

    -- | /O(n)/ Right fold with strict accumulator using a function applied to each
    -- element and its index.
    ifoldr' :: Unbox a => (Int -> a -> b -> b) -> b -> Vector a -> b
    {-# INLINE ifoldr' #-}
    ifoldr' :: forall a b. Unbox a => (Int -> a -> b -> b) -> b -> Vector a -> b
    ifoldr' = (Int -> a -> b -> b) -> b -> Vector a -> b
    forall (v :: * -> *) a b.
    Vector v a =>
    (Int -> a -> b -> b) -> b -> v a -> b
    G.ifoldr'

    -- | /O(n)/ Map each element of the structure to a monoid and combine
    -- the results. It uses the same implementation as the corresponding method
    -- of the 'Foldable' type cless. Note that it's implemented in terms of 'foldr'
    -- and won't fuse with functions that traverse the vector from left to
    -- right ('map', 'generate', etc.).
    --
    -- @since 0.12.2.0
    foldMap :: (Monoid m, Unbox a) => (a -> m) -> Vector a -> m
    {-# INLINE foldMap #-}
    foldMap :: forall m a. (Monoid m, Unbox a) => (a -> m) -> Vector a -> m
    foldMap = (a -> m) -> Vector a -> m
    forall m (v :: * -> *) a.
    (Monoid m, Vector v a) =>
    (a -> m) -> v a -> m
    G.foldMap

    -- | /O(n)/ Like 'foldMap', but strict in the accumulator. It uses the same
    -- implementation as the corresponding method of the 'Foldable' type class.
    -- Note that it's implemented in terms of 'foldl'', so it fuses in most
    -- contexts.
    --
    -- @since 0.12.2.0
    foldMap' :: (Monoid m, Unbox a) => (a -> m) -> Vector a -> m
    {-# INLINE foldMap' #-}
    foldMap' :: forall m a. (Monoid m, Unbox a) => (a -> m) -> Vector a -> m
    foldMap' = (a -> m) -> Vector a -> m
    forall m (v :: * -> *) a.
    (Monoid m, Vector v a) =>
    (a -> m) -> v a -> m
    G.foldMap'

    -- Specialised folds
    -- -----------------

    -- | /O(n)/ Check if all elements satisfy the predicate.
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.all even $ VU.fromList [2, 4, 12 :: Int]
    -- True
    -- >>> VU.all even $ VU.fromList [2, 4, 13 :: Int]
    -- False
    -- >>> VU.all even (VU.empty :: VU.Vector Int)
    -- True
    all :: Unbox a => (a -> Bool) -> Vector a -> Bool
    {-# INLINE all #-}
    all :: forall a. Unbox a => (a -> Bool) -> Vector a -> Bool
    all = (a -> Bool) -> Vector a -> Bool
    forall (v :: * -> *) a. Vector v a => (a -> Bool) -> v a -> Bool
    G.all

    -- | /O(n)/ Check if any element satisfies the predicate.
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.any even $ VU.fromList [1, 3, 7 :: Int]
    -- False
    -- >>> VU.any even $ VU.fromList [3, 2, 13 :: Int]
    -- True
    -- >>> VU.any even (VU.empty :: VU.Vector Int)
    -- False
    any :: Unbox a => (a -> Bool) -> Vector a -> Bool
    {-# INLINE any #-}
    any :: forall a. Unbox a => (a -> Bool) -> Vector a -> Bool
    any = (a -> Bool) -> Vector a -> Bool
    forall (v :: * -> *) a. Vector v a => (a -> Bool) -> v a -> Bool
    G.any

    -- | /O(n)/ Check if all elements are 'True'.
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.and $ VU.fromList [True, False]
    -- False
    -- >>> VU.and VU.empty
    -- True
    and :: Vector Bool -> Bool
    {-# INLINE and #-}
    and :: Vector Bool -> Bool
    and = Vector Bool -> Bool
    forall (v :: * -> *). Vector v Bool => v Bool -> Bool
    G.and

    -- | /O(n)/ Check if any element is 'True'.
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.or $ VU.fromList [True, False]
    -- True
    -- >>> VU.or VU.empty
    -- False
    or :: Vector Bool -> Bool
    {-# INLINE or #-}
    or :: Vector Bool -> Bool
    or = Vector Bool -> Bool
    forall (v :: * -> *). Vector v Bool => v Bool -> Bool
    G.or

    -- | /O(n)/ Compute the sum of the elements.
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.sum $ VU.fromList [300,20,1 :: Int]
    -- 321
    -- >>> VU.sum (VU.empty :: VU.Vector Int)
    -- 0
    sum :: (Unbox a, Num a) => Vector a -> a
    {-# INLINE sum #-}
    sum :: forall a. (Unbox a, Num a) => Vector a -> a
    sum = Vector a -> a
    forall (v :: * -> *) a. (Vector v a, Num a) => v a -> a
    G.sum

    -- | /O(n)/ Compute the product of the elements.
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.product $ VU.fromList [1,2,3,4 :: Int]
    -- 24
    -- >>> VU.product (VU.empty :: VU.Vector Int)
    -- 1
    product :: (Unbox a, Num a) => Vector a -> a
    {-# INLINE product #-}
    product :: forall a. (Unbox a, Num a) => Vector a -> a
    product = Vector a -> a
    forall (v :: * -> *) a. (Vector v a, Num a) => v a -> a
    G.product

    -- | /O(n)/ Yield the maximum element of the vector. The vector may not be
    -- empty. In case of a tie, the first occurrence wins.
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.maximum $ VU.fromList [2, 1 :: Int]
    -- 2
    -- >>> import Data.Semigroup
    -- >>> VU.maximum $ VU.fromList [Arg 1 'a', Arg (2 :: Int) 'b']
    -- Arg 2 'b'
    -- >>> VU.maximum $ VU.fromList [Arg 1 'a', Arg (1 :: Int) 'b']
    -- Arg 1 'a'
    maximum :: (Unbox a, Ord a) => Vector a -> a
    {-# INLINE maximum #-}
    maximum :: forall a. (Unbox a, Ord a) => Vector a -> a
    maximum = Vector a -> a
    forall (v :: * -> *) a. (Vector v a, Ord a) => v a -> a
    G.maximum

    -- | /O(n)/ Yield the maximum element of the vector according to the
    -- given comparison function. The vector may not be empty. In case of
    -- a tie, the first occurrence wins. This behavior is different from
    -- 'Data.List.maximumBy' which returns the last tie.
    --
    -- ==== __Examples__
    --
    -- >>> import Data.Ord
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.maximumBy (comparing fst) $ VU.fromList [(2,'a'), (1 :: Int,'b')]
    -- (2,'a')
    -- >>> VU.maximumBy (comparing fst) $ VU.fromList [(1,'a'), (1 :: Int,'b')]
    -- (1,'a')
    maximumBy :: Unbox a => (a -> a -> Ordering) -> Vector a -> a
    {-# INLINE maximumBy #-}
    maximumBy :: forall a. Unbox a => (a -> a -> Ordering) -> Vector a -> a
    maximumBy = (a -> a -> Ordering) -> Vector a -> a
    forall (v :: * -> *) a.
    Vector v a =>
    (a -> a -> Ordering) -> v a -> a
    G.maximumBy

    -- | /O(n)/ Yield the maximum element of the vector by comparing the results
    -- of a key function on each element. In case of a tie, the first occurrence
    -- wins. The vector may not be empty.
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.maximumOn fst $ VU.fromList [(2,'a'), (1 :: Int,'b')]
    -- (2,'a')
    -- >>> VU.maximumOn fst $ VU.fromList [(1,'a'), (1 :: Int,'b')]
    -- (1,'a')
    --
    -- @since 0.13.0.0
    maximumOn :: (Ord b, Unbox a) => (a -> b) -> Vector a -> a
    {-# INLINE maximumOn #-}
    maximumOn :: forall b a. (Ord b, Unbox a) => (a -> b) -> Vector a -> a
    maximumOn = (a -> b) -> Vector a -> a
    forall b (v :: * -> *) a.
    (Ord b, Vector v a) =>
    (a -> b) -> v a -> a
    G.maximumOn

    -- | /O(n)/ Yield the minimum element of the vector. The vector may not be
    -- empty. In case of a tie, the first occurrence wins.
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.minimum $ VU.fromList [2, 1 :: Int]
    -- 1
    -- >>> import Data.Semigroup
    -- >>> VU.minimum $ VU.fromList [Arg 2 'a', Arg (1 :: Int) 'b']
    -- Arg 1 'b'
    -- >>> VU.minimum $ VU.fromList [Arg 1 'a', Arg (1 :: Int) 'b']
    -- Arg 1 'a'
    minimum :: (Unbox a, Ord a) => Vector a -> a
    {-# INLINE minimum #-}
    minimum :: forall a. (Unbox a, Ord a) => Vector a -> a
    minimum = Vector a -> a
    forall (v :: * -> *) a. (Vector v a, Ord a) => v a -> a
    G.minimum

    -- | /O(n)/ Yield the minimum element of the vector according to the
    -- given comparison function. The vector may not be empty. In case of
    -- a tie, the first occurrence wins.
    --
    -- ==== __Examples__
    --
    -- >>> import Data.Ord
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.minimumBy (comparing fst) $ VU.fromList [(2,'a'), (1 :: Int,'b')]
    -- (1,'b')
    -- >>> VU.minimumBy (comparing fst) $ VU.fromList [(1,'a'), (1 :: Int,'b')]
    -- (1,'a')
    minimumBy :: Unbox a => (a -> a -> Ordering) -> Vector a -> a
    -- | /O(n)/ Yield the minimum element of the vector according to the given
    -- comparison function. The vector may not be empty.
    {-# INLINE minimumBy #-}
    minimumBy :: forall a. Unbox a => (a -> a -> Ordering) -> Vector a -> a
    minimumBy = (a -> a -> Ordering) -> Vector a -> a
    forall (v :: * -> *) a.
    Vector v a =>
    (a -> a -> Ordering) -> v a -> a
    G.minimumBy

    -- | /O(n)/ Yield the minimum element of the vector by comparing the results
    -- of a key function on each element. In case of a tie, the first occurrence
    -- wins. The vector may not be empty.
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.minimumOn fst $ VU.fromList [(2,'a'), (1 :: Int,'b')]
    -- (1,'b')
    -- >>> VU.minimumOn fst $ VU.fromList [(1,'a'), (1 :: Int,'b')]
    -- (1,'a')
    --
    -- @since 0.13.0.0
    minimumOn :: (Ord b, Unbox a) => (a -> b) -> Vector a -> a
    {-# INLINE minimumOn #-}
    minimumOn :: forall b a. (Ord b, Unbox a) => (a -> b) -> Vector a -> a
    minimumOn = (a -> b) -> Vector a -> a
    forall b (v :: * -> *) a.
    (Ord b, Vector v a) =>
    (a -> b) -> v a -> a
    G.minimumOn

    -- | /O(n)/ Yield the index of the maximum element of the vector. The vector
    -- may not be empty.
    maxIndex :: (Unbox a, Ord a) => Vector a -> Int
    {-# INLINE maxIndex #-}
    maxIndex :: forall a. (Unbox a, Ord a) => Vector a -> Int
    maxIndex = Vector a -> Int
    forall (v :: * -> *) a. (Vector v a, Ord a) => v a -> Int
    G.maxIndex

    -- | /O(n)/ Yield the index of the maximum element of the vector
    -- according to the given comparison function. The vector may not be
    -- empty. In case of a tie, the first occurrence wins.
    --
    -- ==== __Examples__
    --
    -- >>> import Data.Ord
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.maxIndexBy (comparing fst) $ VU.fromList [(2,'a'), (1,'b')]
    -- 0
    -- >>> VU.maxIndexBy (comparing fst) $ VU.fromList [(1,'a'), (1,'b')]
    -- 0
    maxIndexBy :: Unbox a => (a -> a -> Ordering) -> Vector a -> Int
    {-# INLINE maxIndexBy #-}
    maxIndexBy :: forall a. Unbox a => (a -> a -> Ordering) -> Vector a -> Int
    maxIndexBy = (a -> a -> Ordering) -> Vector a -> Int
    forall (v :: * -> *) a.
    Vector v a =>
    (a -> a -> Ordering) -> v a -> Int
    G.maxIndexBy

    -- | /O(n)/ Yield the index of the minimum element of the vector. The vector
    -- may not be empty.
    minIndex :: (Unbox a, Ord a) => Vector a -> Int
    {-# INLINE minIndex #-}
    minIndex :: forall a. (Unbox a, Ord a) => Vector a -> Int
    minIndex = Vector a -> Int
    forall (v :: * -> *) a. (Vector v a, Ord a) => v a -> Int
    G.minIndex

    -- | /O(n)/ Yield the index of the minimum element of the vector according to
    -- the given comparison function. The vector may not be empty.
    --
    -- ==== __Examples__
    --
    -- >>> import Data.Ord
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.minIndexBy (comparing fst) $ VU.fromList [(2,'a'), (1,'b')]
    -- 1
    -- >>> VU.minIndexBy (comparing fst) $ VU.fromList [(1,'a'), (1,'b')]
    -- 0
    minIndexBy :: Unbox a => (a -> a -> Ordering) -> Vector a -> Int
    {-# INLINE minIndexBy #-}
    minIndexBy :: forall a. Unbox a => (a -> a -> Ordering) -> Vector a -> Int
    minIndexBy = (a -> a -> Ordering) -> Vector a -> Int
    forall (v :: * -> *) a.
    Vector v a =>
    (a -> a -> Ordering) -> v a -> Int
    G.minIndexBy

    -- Monadic folds
    -- -------------

    -- | /O(n)/ Monadic fold.
    foldM :: (Monad m, Unbox b) => (a -> b -> m a) -> a -> Vector b -> m a
    {-# INLINE foldM #-}
    foldM :: forall (m :: * -> *) b a.
    (Monad m, Unbox b) =>
    (a -> b -> m a) -> a -> Vector b -> m a
    foldM = (a -> b -> m a) -> a -> Vector b -> m a
    forall (m :: * -> *) (v :: * -> *) b a.
    (Monad m, Vector v b) =>
    (a -> b -> m a) -> a -> v b -> m a
    G.foldM

    -- | /O(n)/ Monadic fold using a function applied to each element and its index.
    ifoldM :: (Monad m, Unbox b) => (a -> Int -> b -> m a) -> a -> Vector b -> m a
    {-# INLINE ifoldM #-}
    ifoldM :: forall (m :: * -> *) b a.
    (Monad m, Unbox b) =>
    (a -> Int -> b -> m a) -> a -> Vector b -> m a
    ifoldM = (a -> Int -> b -> m a) -> a -> Vector b -> m a
    forall (m :: * -> *) (v :: * -> *) b a.
    (Monad m, Vector v b) =>
    (a -> Int -> b -> m a) -> a -> v b -> m a
    G.ifoldM

    -- | /O(n)/ Monadic fold over non-empty vectors.
    fold1M :: (Monad m, Unbox a) => (a -> a -> m a) -> Vector a -> m a
    {-# INLINE fold1M #-}
    fold1M :: forall (m :: * -> *) a.
    (Monad m, Unbox a) =>
    (a -> a -> m a) -> Vector a -> m a
    fold1M = (a -> a -> m a) -> Vector a -> m a
    forall (m :: * -> *) (v :: * -> *) a.
    (Monad m, Vector v a) =>
    (a -> a -> m a) -> v a -> m a
    G.fold1M

    -- | /O(n)/ Monadic fold with strict accumulator.
    foldM' :: (Monad m, Unbox b) => (a -> b -> m a) -> a -> Vector b -> m a
    {-# INLINE foldM' #-}
    foldM' :: forall (m :: * -> *) b a.
    (Monad m, Unbox b) =>
    (a -> b -> m a) -> a -> Vector b -> m a
    foldM' = (a -> b -> m a) -> a -> Vector b -> m a
    forall (m :: * -> *) (v :: * -> *) b a.
    (Monad m, Vector v b) =>
    (a -> b -> m a) -> a -> v b -> m a
    G.foldM'

    -- | /O(n)/ Monadic fold with strict accumulator using a function applied to each
    -- element and its index.
    ifoldM' :: (Monad m, Unbox b) => (a -> Int -> b -> m a) -> a -> Vector b -> m a
    {-# INLINE ifoldM' #-}
    ifoldM' :: forall (m :: * -> *) b a.
    (Monad m, Unbox b) =>
    (a -> Int -> b -> m a) -> a -> Vector b -> m a
    ifoldM' = (a -> Int -> b -> m a) -> a -> Vector b -> m a
    forall (m :: * -> *) (v :: * -> *) b a.
    (Monad m, Vector v b) =>
    (a -> Int -> b -> m a) -> a -> v b -> m a
    G.ifoldM'

    -- | /O(n)/ Monadic fold over non-empty vectors with strict accumulator.
    fold1M' :: (Monad m, Unbox a) => (a -> a -> m a) -> Vector a -> m a
    {-# INLINE fold1M' #-}
    fold1M' :: forall (m :: * -> *) a.
    (Monad m, Unbox a) =>
    (a -> a -> m a) -> Vector a -> m a
    fold1M' = (a -> a -> m a) -> Vector a -> m a
    forall (m :: * -> *) (v :: * -> *) a.
    (Monad m, Vector v a) =>
    (a -> a -> m a) -> v a -> m a
    G.fold1M'

    -- | /O(n)/ Monadic fold that discards the result.
    foldM_ :: (Monad m, Unbox b) => (a -> b -> m a) -> a -> Vector b -> m ()
    {-# INLINE foldM_ #-}
    foldM_ :: forall (m :: * -> *) b a.
    (Monad m, Unbox b) =>
    (a -> b -> m a) -> a -> Vector b -> m ()
    foldM_ = (a -> b -> m a) -> a -> Vector b -> m ()
    forall (m :: * -> *) (v :: * -> *) b a.
    (Monad m, Vector v b) =>
    (a -> b -> m a) -> a -> v b -> m ()
    G.foldM_

    -- | /O(n)/ Monadic fold that discards the result using a function applied to
    -- each element and its index.
    ifoldM_ :: (Monad m, Unbox b) => (a -> Int -> b -> m a) -> a -> Vector b -> m ()
    {-# INLINE ifoldM_ #-}
    ifoldM_ :: forall (m :: * -> *) b a.
    (Monad m, Unbox b) =>
    (a -> Int -> b -> m a) -> a -> Vector b -> m ()
    ifoldM_ = (a -> Int -> b -> m a) -> a -> Vector b -> m ()
    forall (m :: * -> *) (v :: * -> *) b a.
    (Monad m, Vector v b) =>
    (a -> Int -> b -> m a) -> a -> v b -> m ()
    G.ifoldM_

    -- | /O(n)/ Monadic fold over non-empty vectors that discards the result.
    fold1M_ :: (Monad m, Unbox a) => (a -> a -> m a) -> Vector a -> m ()
    {-# INLINE fold1M_ #-}
    fold1M_ :: forall (m :: * -> *) a.
    (Monad m, Unbox a) =>
    (a -> a -> m a) -> Vector a -> m ()
    fold1M_ = (a -> a -> m a) -> Vector a -> m ()
    forall (m :: * -> *) (v :: * -> *) a.
    (Monad m, Vector v a) =>
    (a -> a -> m a) -> v a -> m ()
    G.fold1M_

    -- | /O(n)/ Monadic fold with strict accumulator that discards the result.
    foldM'_ :: (Monad m, Unbox b) => (a -> b -> m a) -> a -> Vector b -> m ()
    {-# INLINE foldM'_ #-}
    foldM'_ :: forall (m :: * -> *) b a.
    (Monad m, Unbox b) =>
    (a -> b -> m a) -> a -> Vector b -> m ()
    foldM'_ = (a -> b -> m a) -> a -> Vector b -> m ()
    forall (m :: * -> *) (v :: * -> *) b a.
    (Monad m, Vector v b) =>
    (a -> b -> m a) -> a -> v b -> m ()
    G.foldM'_

    -- | /O(n)/ Monadic fold with strict accumulator that discards the result
    -- using a function applied to each element and its index.
    ifoldM'_ :: (Monad m, Unbox b)
             => (a -> Int -> b -> m a) -> a -> Vector b -> m ()
    {-# INLINE ifoldM'_ #-}
    ifoldM'_ :: forall (m :: * -> *) b a.
    (Monad m, Unbox b) =>
    (a -> Int -> b -> m a) -> a -> Vector b -> m ()
    ifoldM'_ = (a -> Int -> b -> m a) -> a -> Vector b -> m ()
    forall (m :: * -> *) (v :: * -> *) b a.
    (Monad m, Vector v b) =>
    (a -> Int -> b -> m a) -> a -> v b -> m ()
    G.ifoldM'_

    -- | /O(n)/ Monadic fold over non-empty vectors with strict accumulator
    -- that discards the result.
    fold1M'_ :: (Monad m, Unbox a) => (a -> a -> m a) -> Vector a -> m ()
    {-# INLINE fold1M'_ #-}
    fold1M'_ :: forall (m :: * -> *) a.
    (Monad m, Unbox a) =>
    (a -> a -> m a) -> Vector a -> m ()
    fold1M'_ = (a -> a -> m a) -> Vector a -> m ()
    forall (m :: * -> *) (v :: * -> *) a.
    (Monad m, Vector v a) =>
    (a -> a -> m a) -> v a -> m ()
    G.fold1M'_

    -- Scans
    -- -----

    -- | /O(n)/ Left-to-right prescan.
    --
    -- @
    -- prescanl f z = 'init' . 'scanl' f z
    -- @
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector as VU
    -- >>> VU.prescanl (+) 0 (VU.fromList [1,2,3,4 :: Int])
    -- [0,1,3,6]
    prescanl :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a
    {-# INLINE prescanl #-}
    prescanl :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> b -> a) -> a -> Vector b -> Vector a
    prescanl = (a -> b -> a) -> a -> Vector b -> Vector a
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (a -> b -> a) -> a -> v b -> v a
    G.prescanl

    -- | /O(n)/ Left-to-right prescan with strict accumulator.
    prescanl' :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a
    {-# INLINE prescanl' #-}
    prescanl' :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> b -> a) -> a -> Vector b -> Vector a
    prescanl' = (a -> b -> a) -> a -> Vector b -> Vector a
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (a -> b -> a) -> a -> v b -> v a
    G.prescanl'

    -- | /O(n)/ Left-to-right postscan.
    --
    -- @
    -- postscanl f z = 'tail' . 'scanl' f z
    -- @
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.postscanl (+) 0 (VU.fromList [1,2,3,4 :: Int])
    -- [1,3,6,10]
    postscanl :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a
    {-# INLINE postscanl #-}
    postscanl :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> b -> a) -> a -> Vector b -> Vector a
    postscanl = (a -> b -> a) -> a -> Vector b -> Vector a
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (a -> b -> a) -> a -> v b -> v a
    G.postscanl

    -- | /O(n)/ Left-to-right postscan with strict accumulator.
    postscanl' :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a
    {-# INLINE postscanl' #-}
    postscanl' :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> b -> a) -> a -> Vector b -> Vector a
    postscanl' = (a -> b -> a) -> a -> Vector b -> Vector a
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (a -> b -> a) -> a -> v b -> v a
    G.postscanl'

    -- | /O(n)/ Left-to-right scan.
    --
    -- > scanl f z <x1,...,xn> = <y1,...,y(n+1)>
    -- >   where y1 = z
    -- >         yi = f y(i-1) x(i-1)
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.scanl (+) 0 (VU.fromList [1,2,3,4 :: Int])
    -- [0,1,3,6,10]
    scanl :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a
    {-# INLINE scanl #-}
    scanl :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> b -> a) -> a -> Vector b -> Vector a
    scanl = (a -> b -> a) -> a -> Vector b -> Vector a
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (a -> b -> a) -> a -> v b -> v a
    G.scanl

    -- | /O(n)/ Left-to-right scan with strict accumulator.
    scanl' :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a
    {-# INLINE scanl' #-}
    scanl' :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> b -> a) -> a -> Vector b -> Vector a
    scanl' = (a -> b -> a) -> a -> Vector b -> Vector a
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (a -> b -> a) -> a -> v b -> v a
    G.scanl'

    -- | /O(n)/ Left-to-right scan over a vector with its index.
    --
    -- @since 0.12.2.0
    iscanl :: (Unbox a, Unbox b) => (Int -> a -> b -> a) -> a -> Vector b -> Vector a
    {-# INLINE iscanl #-}
    iscanl :: forall a b.
    (Unbox a, Unbox b) =>
    (Int -> a -> b -> a) -> a -> Vector b -> Vector a
    iscanl = (Int -> a -> b -> a) -> a -> Vector b -> Vector a
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (Int -> a -> b -> a) -> a -> v b -> v a
    G.iscanl

    -- | /O(n)/ Left-to-right scan over a vector (strictly) with its index.
    --
    -- @since 0.12.2.0
    iscanl' :: (Unbox a, Unbox b) => (Int -> a -> b -> a) -> a -> Vector b -> Vector a
    {-# INLINE iscanl' #-}
    iscanl' :: forall a b.
    (Unbox a, Unbox b) =>
    (Int -> a -> b -> a) -> a -> Vector b -> Vector a
    iscanl' = (Int -> a -> b -> a) -> a -> Vector b -> Vector a
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (Int -> a -> b -> a) -> a -> v b -> v a
    G.iscanl'

    -- | /O(n)/ Initial-value free left-to-right scan over a vector.
    --
    -- > scanl f <x1,...,xn> = <y1,...,yn>
    -- >   where y1 = x1
    -- >         yi = f y(i-1) xi
    --
    -- Note: Since 0.13, application of this to an empty vector no longer
    -- results in an error; instead it produces an empty vector.
    --
    -- ==== __Examples__
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.scanl1 min $ VU.fromListN 5 [4,2,4,1,3 :: Int]
    -- [4,2,2,1,1]
    -- >>> VU.scanl1 max $ VU.fromListN 5 [1,3,2,5,4 :: Int]
    -- [1,3,3,5,5]
    -- >>> VU.scanl1 min (VU.empty :: VU.Vector Int)
    -- []
    scanl1 :: Unbox a => (a -> a -> a) -> Vector a -> Vector a
    {-# INLINE scanl1 #-}
    scanl1 :: forall a. Unbox a => (a -> a -> a) -> Vector a -> Vector a
    scanl1 = (a -> a -> a) -> Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => (a -> a -> a) -> v a -> v a
    G.scanl1

    -- | /O(n)/ Initial-value free left-to-right scan over a vector with a strict accumulator.
    --
    -- Note: Since 0.13, application of this to an empty vector no longer
    -- results in an error; instead it produces an empty vector.
    --
    -- ==== __Examples__
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.scanl1' min $ VU.fromListN 5 [4,2,4,1,3 :: Int]
    -- [4,2,2,1,1]
    -- >>> VU.scanl1' max $ VU.fromListN 5 [1,3,2,5,4 :: Int]
    -- [1,3,3,5,5]
    -- >>> VU.scanl1' min (VU.empty :: VU.Vector Int)
    -- []
    scanl1' :: Unbox a => (a -> a -> a) -> Vector a -> Vector a
    {-# INLINE scanl1' #-}
    scanl1' :: forall a. Unbox a => (a -> a -> a) -> Vector a -> Vector a
    scanl1' = (a -> a -> a) -> Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => (a -> a -> a) -> v a -> v a
    G.scanl1'

    -- | /O(n)/ Right-to-left prescan.
    --
    -- @
    -- prescanr f z = 'reverse' . 'prescanl' (flip f) z . 'reverse'
    -- @
    prescanr :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b
    {-# INLINE prescanr #-}
    prescanr :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> b -> b) -> b -> Vector a -> Vector b
    prescanr = (a -> b -> b) -> b -> Vector a -> Vector b
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (a -> b -> b) -> b -> v a -> v b
    G.prescanr

    -- | /O(n)/ Right-to-left prescan with strict accumulator.
    prescanr' :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b
    {-# INLINE prescanr' #-}
    prescanr' :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> b -> b) -> b -> Vector a -> Vector b
    prescanr' = (a -> b -> b) -> b -> Vector a -> Vector b
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (a -> b -> b) -> b -> v a -> v b
    G.prescanr'

    -- | /O(n)/ Right-to-left postscan.
    postscanr :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b
    {-# INLINE postscanr #-}
    postscanr :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> b -> b) -> b -> Vector a -> Vector b
    postscanr = (a -> b -> b) -> b -> Vector a -> Vector b
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (a -> b -> b) -> b -> v a -> v b
    G.postscanr

    -- | /O(n)/ Right-to-left postscan with strict accumulator.
    postscanr' :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b
    {-# INLINE postscanr' #-}
    postscanr' :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> b -> b) -> b -> Vector a -> Vector b
    postscanr' = (a -> b -> b) -> b -> Vector a -> Vector b
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (a -> b -> b) -> b -> v a -> v b
    G.postscanr'

    -- | /O(n)/ Right-to-left scan.
    scanr :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b
    {-# INLINE scanr #-}
    scanr :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> b -> b) -> b -> Vector a -> Vector b
    scanr = (a -> b -> b) -> b -> Vector a -> Vector b
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (a -> b -> b) -> b -> v a -> v b
    G.scanr

    -- | /O(n)/ Right-to-left scan with strict accumulator.
    scanr' :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b
    {-# INLINE scanr' #-}
    scanr' :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> b -> b) -> b -> Vector a -> Vector b
    scanr' = (a -> b -> b) -> b -> Vector a -> Vector b
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (a -> b -> b) -> b -> v a -> v b
    G.scanr'

    -- | /O(n)/ Right-to-left scan over a vector with its index.
    --
    -- @since 0.12.2.0
    iscanr :: (Unbox a, Unbox b) => (Int -> a -> b -> b) -> b -> Vector a -> Vector b
    {-# INLINE iscanr #-}
    iscanr :: forall a b.
    (Unbox a, Unbox b) =>
    (Int -> a -> b -> b) -> b -> Vector a -> Vector b
    iscanr = (Int -> a -> b -> b) -> b -> Vector a -> Vector b
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (Int -> a -> b -> b) -> b -> v a -> v b
    G.iscanr

    -- | /O(n)/ Right-to-left scan over a vector (strictly) with its index.
    --
    -- @sinqce 0.12.2.0
    iscanr' :: (Unbox a, Unbox b) => (Int -> a -> b -> b) -> b -> Vector a -> Vector b
    {-# INLINE iscanr' #-}
    iscanr' :: forall a b.
    (Unbox a, Unbox b) =>
    (Int -> a -> b -> b) -> b -> Vector a -> Vector b
    iscanr' = (Int -> a -> b -> b) -> b -> Vector a -> Vector b
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (Int -> a -> b -> b) -> b -> v a -> v b
    G.iscanr'

    -- | /O(n)/ Right-to-left, initial-value free scan over a vector.
    --
    -- Note: Since 0.13, application of this to an empty vector no longer
    -- results in an error; instead it produces an empty vector.
    --
    -- ==== __Examples__
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.scanr1 min $ VU.fromListN 5 [3,1,4,2,4 :: Int]
    -- [1,1,2,2,4]
    -- >>> VU.scanr1 max $ VU.fromListN 5 [4,5,2,3,1 :: Int]
    -- [5,5,3,3,1]
    -- >>> VU.scanr1 min (VU.empty :: VU.Vector Int)
    -- []
    scanr1 :: Unbox a => (a -> a -> a) -> Vector a -> Vector a
    {-# INLINE scanr1 #-}
    scanr1 :: forall a. Unbox a => (a -> a -> a) -> Vector a -> Vector a
    scanr1 = (a -> a -> a) -> Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => (a -> a -> a) -> v a -> v a
    G.scanr1

    -- | /O(n)/ Right-to-left, initial-value free scan over a vector with a strict
    -- accumulator.
    --
    -- Note: Since 0.13, application of this to an empty vector no longer
    -- results in an error; instead it produces an empty vector.
    --
    -- ==== __Examples__
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.scanr1' min $ VU.fromListN 5 [3,1,4,2,4 :: Int]
    -- [1,1,2,2,4]
    -- >>> VU.scanr1' max $ VU.fromListN 5 [4,5,2,3,1 :: Int]
    -- [5,5,3,3,1]
    -- >>> VU.scanr1' min (VU.empty :: VU.Vector Int)
    -- []
    scanr1' :: Unbox a => (a -> a -> a) -> Vector a -> Vector a
    {-# INLINE scanr1' #-}
    scanr1' :: forall a. Unbox a => (a -> a -> a) -> Vector a -> Vector a
    scanr1' = (a -> a -> a) -> Vector a -> Vector a
    forall (v :: * -> *) a. Vector v a => (a -> a -> a) -> v a -> v a
    G.scanr1'

    -- Comparisons
    -- ------------------------

    -- | /O(n)/ Check if two vectors are equal using the supplied equality
    -- predicate.
    --
    -- @since 0.12.2.0
    eqBy :: (Unbox a, Unbox b) => (a -> b -> Bool) -> Vector a -> Vector b -> Bool
    {-# INLINE eqBy #-}
    eqBy :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> b -> Bool) -> Vector a -> Vector b -> Bool
    eqBy = (a -> b -> Bool) -> Vector a -> Vector b -> Bool
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (a -> b -> Bool) -> v a -> v b -> Bool
    G.eqBy

    -- | /O(n)/ Compare two vectors using the supplied comparison function for
    -- vector elements. Comparison works the same as for lists.
    --
    -- > cmpBy compare == compare
    --
    -- @since 0.12.2.0
    cmpBy :: (Unbox a, Unbox b) => (a -> b -> Ordering) -> Vector a -> Vector b -> Ordering
    cmpBy :: forall a b.
    (Unbox a, Unbox b) =>
    (a -> b -> Ordering) -> Vector a -> Vector b -> Ordering
    cmpBy = (a -> b -> Ordering) -> Vector a -> Vector b -> Ordering
    forall (v :: * -> *) a b.
    (Vector v a, Vector v b) =>
    (a -> b -> Ordering) -> v a -> v b -> Ordering
    G.cmpBy

    -- Conversions - Lists
    -- ------------------------

    -- | /O(n)/ Convert a vector to a list.
    toList :: Unbox a => Vector a -> [a]
    {-# INLINE toList #-}
    toList :: forall a. Unbox a => Vector a -> [a]
    toList = Vector a -> [a]
    forall (v :: * -> *) a. Vector v a => v a -> [a]
    G.toList

    -- | /O(n)/ Convert a list to a vector. During the operation, the
    -- vector’s capacity will be doubling until the list's contents are
    -- in the vector. Depending on the list’s size, up to half of the vector’s
    -- capacity might be empty. If you’d rather avoid this, you can use
    -- 'fromListN', which will provide the exact space the list requires but will
    -- prevent list fusion, or @'force' . 'fromList'@, which will create the
    -- vector and then copy it without the superfluous space.
    --
    -- @since 0.3
    fromList :: Unbox a => [a] -> Vector a
    {-# INLINE fromList #-}
    fromList :: forall a. Unbox a => [a] -> Vector a
    fromList = [a] -> Vector a
    forall (v :: * -> *) a. Vector v a => [a] -> v a
    G.fromList

    -- | /O(n)/ Convert the first @n@ elements of a list to a vector. It's
    -- expected that the supplied list will be exactly @n@ elements long. As
    -- an optimization, this function allocates a buffer for @n@ elements, which
    -- could be used for DoS-attacks by exhausting the memory if an attacker controls
    -- that parameter.
    --
    -- @
    -- fromListN n xs = 'fromList' ('take' n xs)
    -- @
    --
    -- ==== __Examples__
    --
    -- >>> import qualified Data.Vector.Unboxed as VU
    -- >>> VU.fromListN 3 [1,2,3,4,5 :: Int]
    -- [1,2,3]
    -- >>> VU.fromListN 3 [1 :: Int]
    -- [1]
    fromListN :: Unbox a => Int -> [a] -> Vector a
    {-# INLINE fromListN #-}
    fromListN :: forall a. Unbox a => Int -> [a] -> Vector a
    fromListN = Int -> [a] -> Vector a
    forall (v :: * -> *) a. Vector v a => Int -> [a] -> v a
    G.fromListN

    -- Conversions - Mutable vectors
    -- -----------------------------

    -- | /O(1)/ Unsafely convert a mutable vector to an immutable one without
    -- copying. The mutable vector may not be used after this operation.
    unsafeFreeze :: (Unbox a, PrimMonad m) => MVector (PrimState m) a -> m (Vector a)
    {-# INLINE unsafeFreeze #-}
    unsafeFreeze :: forall a (m :: * -> *).
    (Unbox a, PrimMonad m) =>
    MVector (PrimState m) a -> m (Vector a)
    unsafeFreeze = Mutable Vector (PrimState m) a -> m (Vector a)
    MVector (PrimState m) a -> m (Vector a)
    forall (m :: * -> *) (v :: * -> *) a.
    (PrimMonad m, Vector v a) =>
    Mutable v (PrimState m) a -> m (v a)
    G.unsafeFreeze

    -- | /O(n)/ Yield an immutable copy of the mutable vector.
    freeze :: (Unbox a, PrimMonad m) => MVector (PrimState m) a -> m (Vector a)
    {-# INLINE freeze #-}
    freeze :: forall a (m :: * -> *).
    (Unbox a, PrimMonad m) =>
    MVector (PrimState m) a -> m (Vector a)
    freeze = Mutable Vector (PrimState m) a -> m (Vector a)
    MVector (PrimState m) a -> m (Vector a)
    forall (m :: * -> *) (v :: * -> *) a.
    (PrimMonad m, Vector v a) =>
    Mutable v (PrimState m) a -> m (v a)
    G.freeze

    -- | /O(1)/ Unsafely convert an immutable vector to a mutable one
    -- without copying. Note that this is a very dangerous function and
    -- generally it's only safe to read from the resulting vector. In this
    -- case, the immutable vector could be used safely as well.
    --
    -- Problems with mutation happen because GHC has a lot of freedom to
    -- introduce sharing. As a result mutable vectors produced by
    -- @unsafeThaw@ may or may not share the same underlying buffer. For
    -- example:
    --
    -- > foo = do
    -- >   let vec = V.generate 10 id
    -- >   mvec <- V.unsafeThaw vec
    -- >   do_something mvec
    --
    -- Here GHC could lift @vec@ outside of foo which means that all calls to
    -- @do_something@ will use same buffer with possibly disastrous
    -- results. Whether such aliasing happens or not depends on the program in
    -- question, optimization levels, and GHC flags.
    --
    -- All in all, attempts to modify a vector produced by @unsafeThaw@ fall out of
    -- domain of software engineering and into realm of black magic, dark
    -- rituals, and unspeakable horrors. The only advice that could be given
    -- is: "Don't attempt to mutate a vector produced by @unsafeThaw@ unless you
    -- know how to prevent GHC from aliasing buffers accidentally. We don't."
    unsafeThaw :: (Unbox a, PrimMonad m) => Vector a -> m (MVector (PrimState m) a)
    {-# INLINE unsafeThaw #-}
    unsafeThaw :: forall a (m :: * -> *).
    (Unbox a, PrimMonad m) =>
    Vector a -> m (MVector (PrimState m) a)
    unsafeThaw = Vector a -> m (Mutable Vector (PrimState m) a)
    Vector a -> m (MVector (PrimState m) a)
    forall (m :: * -> *) (v :: * -> *) a.
    (PrimMonad m, Vector v a) =>
    v a -> m (Mutable v (PrimState m) a)
    G.unsafeThaw

    -- | /O(n)/ Yield a mutable copy of an immutable vector.
    thaw :: (Unbox a, PrimMonad m) => Vector a -> m (MVector (PrimState m) a)
    {-# INLINE thaw #-}
    thaw :: forall a (m :: * -> *).
    (Unbox a, PrimMonad m) =>
    Vector a -> m (MVector (PrimState m) a)
    thaw = Vector a -> m (Mutable Vector (PrimState m) a)
    Vector a -> m (MVector (PrimState m) a)
    forall (m :: * -> *) (v :: * -> *) a.
    (PrimMonad m, Vector v a) =>
    v a -> m (Mutable v (PrimState m) a)
    G.thaw

    -- | /O(n)/ Copy an immutable vector into a mutable one. The two vectors must
    -- have the same length. This is not checked.
    unsafeCopy
      :: (Unbox a, PrimMonad m) => MVector (PrimState m) a -> Vector a -> m ()
    {-# INLINE unsafeCopy #-}
    unsafeCopy :: forall a (m :: * -> *).
    (Unbox a, PrimMonad m) =>
    MVector (PrimState m) a -> Vector a -> m ()
    unsafeCopy = Mutable Vector (PrimState m) a -> Vector a -> m ()
    MVector (PrimState m) a -> Vector a -> m ()
    forall (m :: * -> *) (v :: * -> *) a.
    (PrimMonad m, Vector v a) =>
    Mutable v (PrimState m) a -> v a -> m ()
    G.unsafeCopy

    -- | /O(n)/ Copy an immutable vector into a mutable one. The two vectors must
    -- have the same length.
    copy :: (Unbox a, PrimMonad m) => MVector (PrimState m) a -> Vector a -> m ()
    {-# INLINE copy #-}
    copy :: forall a (m :: * -> *).
    (Unbox a, PrimMonad m) =>
    MVector (PrimState m) a -> Vector a -> m ()
    copy = Mutable Vector (PrimState m) a -> Vector a -> m ()
    MVector (PrimState m) a -> Vector a -> m ()
    forall (m :: * -> *) (v :: * -> *) a.
    (HasCallStack, PrimMonad m, Vector v a) =>
    Mutable v (PrimState m) a -> v a -> m ()
    G.copy

    #define DEFINE_IMMUTABLE
    #include "unbox-tuple-instances"

    -- $setup
    -- >>> import Prelude (Bool(True, False), ($), (+), min, max, even, fst, pred, id, succ, undefined, Ord(..))