{-
-- | /O(n)/ Yield the indices of all occurences of the given element in
-- ascending order. This is a specialised version of 'findIndices'.
elemIndices :: (a, b) -> (Vector k) (Rec (TaggedFunctor Identity) rs) -> (Vector k) Int
elemIndices = G.elemIndices
{-# INLINE elemIndices #-}
-}

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

-- | /O(n)/ Left fold
foldl :: G.Vector (Vector k) (Rec (TaggedFunctor Identity) rs)
  => (r -> Rec (TaggedFunctor Identity) rs -> r) -> r -> (Vector k) (Rec (TaggedFunctor Identity) rs) -> r
foldl = G.foldl
foldl :: G.Vector (Vector k) (Rec (TaggedFunctor Identity) rs)
  => (r -> Rec (TaggedFunctor Identity) rs -> r) -> r -> (Vector k) (Rec (TaggedFunctor Identity) rs) -> r
foldl = G.foldl
foldl = G.foldl