Changeset 0e3f80d

Timestamp:

Sep 2, 2022, 10:59:55 AM (2 years ago)

Author:

Andrew Beach <ajbeach@…>

Branches:

ADT, ast-experimental, master, pthread-emulation

Children:

836cf647

Parents:

c87b604

Message:

Added some more notes to the iterators proposal.

File:

• doc/proposals/iterators.md (modified) (2 diffs)

doc/proposals/iterators.md

@@ -58 +58 @@
 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 +86 @@
 ------------
 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,