Data Collection Iterator
(Redirected from iterator)
Jump to navigation
Jump to search
A Data Collection Iterator is a data access function that can be used to traverse an iterable data object.
- AKA: Iterable.
- Context:
- It can be Iterated.
- It can range from being an Internal Iterator to being an External Iterator.
- It can range from being a Lazy Iterator to being ...
- It can (often) be referenced in a Foreach Loop.
- It can range from being a Python Iterable, Scala Iterable, ...
- Example(s):
- for a String Object.
- for a Set Object.
- a Generator Iterator which contains a frozen stack frame.
- …
- Counter-Example(s):
- See: Reduction Function, Container Data Structure, Object Interface, Imperative Program.
References
2016
- (Wikipedia, 2016) ⇒ https://en.wikipedia.org/wiki/iterator Retrieved:2016-7-25.
- In computer programming, an iterator is an object that enables a programmer to traverse a container, particularly lists. Various types of iterators are often provided via a container's interface. Though the interface and semantics of a given iterator are fixed, iterators are often implemented in terms of the structures underlying a container implementation and are often tightly coupled to the container to enable the operational semantics of the iterator. Note that an iterator performs traversal and also gives access to data elements in a container, but does not perform iteration (i.e., not without some significant liberty taken with that concept or with trivial use of the terminology). An iterator is behaviorally similar to a database cursor. Iterators date to the CLU programming language in 1974.