|  | Home | Libraries | People | FAQ | More | 
| Size | intervals | 
                interval | 
                interval | 
                element | 
                element | 
|---|---|---|---|---|---|
| 
                 | O(1) | O(n) | O(n) | O(1) | O(1) | 
| 
                 | O(1) | O(n) | O(n) | O(1) | O(1) | 
| 
                 | O(1) | O(n) | O(n) | 
 | 
 | 
| 
                 | 
 | O(1) | O(1) | O(1) | O(1) | 
| 
                 | 
 | O(1) | O(1) | 
 | 
 | 
        For icl containers the single size function known from std containers
        branches into tree to five different members functions. The table above shows
        the types, size functions
        are implemented for, together with their complexities.
        Linear complexities O(n) refer to the container's iterative_size: 
n = y.iterative_size()
The next table gives a short definition for the different size functions.
| Size | Types | Description | 
|---|---|---|
| 
                 | The number of intervals of an interval container. | |
| 
                 | The number of objects in an icl container that can be iterated over. | |
| 
                 | 
                The length of an interval or the sum of lengths of an interval container's
                intervals, that's  | |
| 
                 | The number of elements of an interval or a container. For continuous data types cardinality can be infinite. | |
| 
                 | 
                The number of elements of an interval or a container, which is also
                it's  | 
Back to section . . .