[flat.{,multi}{map,set}.cons]: zip_view should be views::zip (#6373)

We don't expect to use CTAD on `ranges::zip_view(args...)`;
what we expect is `views::zip`.

Author: Quuxplusone

source/containers.tex

@@ -15512,7 +15512,7 @@
 sorts the range \range{begin()}{end()} with respect to \tcode{value_comp()}; and
 finally erases the duplicate elements as if by:
 \begin{codeblock}
-auto zv = ranges::zip_view(c.keys, c.values);
+auto zv = views::zip(c.keys, c.values);
 auto it = ranges::unique(zv, key_equiv(compare)).begin();
 auto dist = distance(zv.begin(), it);
 c.keys.erase(c.keys.begin() + dist, c.keys.end());
@@ -15843,7 +15843,7 @@
 the sorted range of pre-existing elements into a single sorted range; and
 finally erases the duplicate elements as if by:
 \begin{codeblock}
-auto zv = ranges::zip_view(c.keys, c.values);
+auto zv = views::zip(c.keys, c.values);
 auto it = ranges::unique(zv, key_equiv(compare)).begin();
 auto dist = distance(zv.begin(), it);
 c.keys.erase(c.keys.begin() + dist, c.keys.end());
@@ -15882,7 +15882,7 @@
 the sorted range of pre-existing elements into a single sorted range; and
 finally erases the duplicate elements as if by:
 \begin{codeblock}
-auto zv = ranges::zip_view(c.keys, c.values);
+auto zv = views::zip(c.keys, c.values);
 auto it = ranges::unique(zv, key_equiv(compare)).begin();
 auto dist = distance(zv.begin(), it);
 c.keys.erase(c.keys.begin() + dist, c.keys.end());
@@ -15920,7 +15920,7 @@
 the sorted range of pre-existing elements into a single sorted range; and
 finally erases the duplicate elements as if by:
 \begin{codeblock}
-auto zv = ranges::zip_view(c.keys, c.values);
+auto zv = views::zip(c.keys, c.values);
 auto it = ranges::unique(zv, key_equiv(compare)).begin();
 auto dist = distance(zv.begin(), it);
 c.keys.erase(c.keys.begin() + dist, c.keys.end());