Index: doc/proposals/iterators.md
===================================================================
--- doc/proposals/iterators.md	(revision c87b6043f3954c3bc70ede6f6fc0593d735783ae)
+++ doc/proposals/iterators.md	(revision 0e3f80dd90a96b28846b037762f8922c71f38c1d)
@@ -58,4 +58,8 @@
 returns a range object, which can be used as any other type.
 
+It might not cover every single case with the same syntax (the `@` syntax may
+not translate to operators very well), but should be able to maintain every
+option with some library range.
+
 Library Enhancements
 --------------------
@@ -82,12 +86,23 @@
 ------------
 Python has a robust iterator tool set. It also has a `range` built-in which
-does many of the same things as the special for loops.
+does many of the same things as the special for loops (the finite and
+half-open ranges).
+
+In addition, it has many dedicated iterator constructors and transformers,
+and many containers can both produce and be constructed from iterators.
 
 +   https://docs.python.org/3/reference/datamodel.html#object.__iter__
 +   https://docs.python.org/3/library/functions.html#func-range
 
-C++ has many iterator tools at well, except for the fact it's `iterators` are
+C++ has many iterator tools at well, except for the fact it's "iterators" are
 not what are usually called iterators (as above) but rather an abstraction of
-pointers.
+pointers. The notable missing feature is that a single iterator has no
+concept of being empty or not, instead it must be compared to the end
+iterator.
+
+However, C++ ranges have an interface much more similar to iterators.
+They do appear to be a wrapper around the "pointer" iterators.
+
++   https://en.cppreference.com/w/cpp/ranges
 
 Rust also has a imperative implementation of a functional style of iterators,