Term
|
Definition
A type where one value can be checked to see if it is greater than, less than, or equal to another value of the same type. Types which are comparable can be put in a list and sorted. |
|
|
Term
|
Definition
A collection of related values, often organized in lists, dictionaries, tuples, etc. |
|
|
Term
|
Definition
Abbreviation of “decorate-sort-undecorate”, a pattern that involves build- ing a list of tuples, sorting, and extracting part of the result. |
|
|
Term
|
Definition
The operation of assembling a variable-length argument tuple. |
|
|
Term
|
Definition
A type that has a hash function. Immutable types like integers, floats, and strings are hashable; mutable types like lists and dictionaries are not. |
|
|
Term
|
Definition
The operation of treating a sequence as a list of arguments. |
|
|
Term
shape (of a data structure): |
|
Definition
A summary of the type, size, and composition of a data structure. |
|
|
Term
|
Definition
A list (or other sequence) with a single element. |
|
|
Term
|
Definition
n immutable sequence of elements. |
|
|
Term
|
Definition
An assignment with a sequence on the right side and a tuple of variables on the left. The right side is evaluated and then its elements are assigned to the variables on the left. |
|
|