phileas.iteration.base#
This module contains the definition of the base type and classes used for iteration (data tree, pseudo data tree and iteration tree).
Module Attributes
Data values that can be used as data tree leaves |
|
Dictionary keys |
|
A data tree consists of literal leaves, and dictionary or list nodes |
|
A leave of a pseudo data tree is either a data tree leave, or a non-trivial iteration tree leave. |
|
A pseudo data tree is a data tree whose leaves can be non literal iteration leaves. |
|
You can store this value - instead of an actual default value - in instances of classes that can have a default value, but don't. |
Classes
Index of the default value of an iteration tree. |
|
Represents a set of data trees, as well as the way to iterate over them. |
|
|
Behavior of |
Iterator used in cases where random access iteration is too cumbersome to implement. |
|
|
Iteration tree iterator. |
Exceptions
Exception raised when requesting the length of an infinite collection. |
|
|
Indicates that |