Optimization does not use a "caching iterator"

Author: patrickroberts

tests/beman/any_view/constexpr.test.cpp

@@ -64,3 +64,20 @@ TEST(ConstexprTest, sort_vector) {
 #endif
     EXPECT_TRUE(sort(std::vector{6, 8, 7, 5, 3, 0, 9}));
 }
+
+constexpr auto set_front(any_view<int, forward> view, int value) {
+    // forward iterator of lvalue reference uses cache object to fuse virtual dispatches
+    static_assert(sizeof(std::ranges::iterator_t<any_view<int, forward>>) ==
+                  sizeof(std::ranges::iterator_t<any_view<int, input>>) + sizeof(int*));
+
+    auto& ref = view.front();
+    // even with cache object, lifetime of reference is not tied to lifetime of iterator
+    ref = value;
+
+    return view.front() == value;
+}
+
+TEST(ConstexprTest, reference_lifetime) {
+    static_assert(set_front(std::vector{7}, 42));
+    EXPECT_TRUE(set_front(std::vector{7}, 42));
+}