-- | /O(n)/ Left fold on non-empty vectors with strict accumulator
foldl1' :: G.Vector (Vector k) (Rec (TaggedFunctor Identity) rs)
  => (Rec (TaggedFunctor Identity) rs -> Rec (TaggedFunctor Identity) rs -> Rec (TaggedFunctor Identity) rs) -> (Vector k) (Rec (TaggedFunctor Identity) rs) -> Rec (TaggedFunctor Identity) rs
foldl1' = G.foldl1'
foldl1' :: G.Vector (Vector k) (Rec (TaggedFunctor Identity) rs)
  => (Rec (TaggedFunctor Identity) rs -> Rec (TaggedFunctor Identity) rs -> Rec (TaggedFunctor Identity) rs) -> (Vector k) (Rec (TaggedFunctor Identity) rs) -> Rec (TaggedFunctor Identity) rs
foldl1' = G.foldl1'
foldl1' = G.foldl1'