Bases: _abcoll.MutableSequence
A list-like object (a ‘cf list’) suitable for CF structures.
Parameters: | sequence (iterable) – Optional. Initialize new list from sequence’s items. |
---|
Overloaded operators:
The in (set membership), == and != operators are overloaded to use numerically tolerant equality.
The +, *, += and *= operators behave as for a built-in list.
Methods:
Method | Description |
---|---|
append | As for a built-in list. |
copy | Create a deep copy. |
count | As for a built-in list but using numerically tolerant equality. |
equals | Determine whether two lists are congruent element-wise. |
extend | As for a built-in list. |
index | As for a built-in list but using numerically tolerant equality. |
insert | As for a built-in list. |
pop | As for a built-in list. |
remove | As for a built-in list. |
reverse | As for a built-in list. |
sort | As for a built-in list. |
Methods and attributes defined here:
CFL.copy() -> a deep copy of CFL
CFL.count(value) -> integer – return number of occurrences of value
Uses numerically tolerant equality.
Return True if two lists are congruent in that each pair of their elements are equal.
Numerical equality is to within a tolerance. Refer to cf for details.
Parameters: |
|
---|---|
Returns: | True if the two objects are congruent, False otherwise. |
CFL.index(value, [start, [stop]]) -> integer – return first index of value
Uses numerically tolerant equality.
CFL.insert(index, object) – insert object before index