List Set Tuple Dic in Python
List Set Tuple Dic in Python
html
5. Data Structures
This chapter describes some things you’ve learned about already in more detail, and adds
some new things as well.
list.append(x)
Add an item to the end of the list; equivalent to a[len(a):] = [x].
list.extend(L)
Extend the list by appending all the items in the given list; equivalent
to a[len(a):] = L.
list.insert(i, x)
Insert an item at a given position. The first argument is the index of the element before
which to insert, so a.insert(0, x) inserts at the front of the list,
and a.insert(len(a), x) is equivalent to a.append(x).
list.remove(x)
Remove the first item from the list whose value is x. It is an error if there is no such item.
list.pop([i])
Remove the item at the given position in the list, and return it. If no index is
specified, a.pop() removes and returns the last item in the list. (The square brackets
around the i in the method signature denote that the parameter is optional, not that you
should type square brackets at that position. You will see this notation frequently in the
Python Library Reference.)
list.index(x)
Return the index in the list of the first item whose value is x. It is an error if there is no
such item.
list.count(x)
Return the number of times x appears in the list.
Sort the items of the list in place (the arguments can be used for sort customization,
see sorted() for their explanation).
list.reverse()
Reverse the elements of the list, in place.
You might have noticed that methods like insert, remove or sort that only modify the
list have no return value printed – they return the default None. This is a design principle
for all mutable data structures in Python.
The list methods make it very easy to use a list as a stack, where the last element added
is the first element retrieved (“last-in, first-out”). To add an item to the top of the stack,
use append(). To retrieve an item from the top of the stack, use pop() without an explicit
index. For example:
>>> stack.pop()
7
>>> stack
[3, 4, 5, 6]
>>> stack.pop()
6
>>> stack.pop()
5
>>> stack
[3, 4]
It is also possible to use a list as a queue, where the first element added is the first element
retrieved (“first-in, first-out”); however, lists are not efficient for this purpose. While
appends and pops from the end of list are fast, doing inserts or pops from the beginning
of a list is slow (because all of the other elements have to be shifted by one).
There are three built-in functions that are very useful when used with
lists: filter(), map(), and reduce().
More than one sequence may be passed; the function must then have as many
arguments as there are sequences and is called with the corresponding item from each
sequence (or None if some sequence is shorter than another). For example:
If there’s only one item in the sequence, its value is returned; if the sequence is empty,
an exception is raised.
A third argument can be passed to indicate the starting value. In this case the starting
value is returned for an empty sequence, and the function is first applied to the starting
value and the first sequence item, then to the result and the next item, and so on. For
example,
Don’t use this example’s definition of sum(): since summing numbers is such a common
need, a built-in function sum(sequence) is already provided, and works exactly like this.
List comprehensions provide a concise way to create lists. Common applications are to
make new lists where each element is the result of some operations applied to each
member of another sequence or iterable, or to create a subsequence of those elements
that satisfy a certain condition.
>>> squares = []
>>> for x in range(10):
... squares.append(x**2)
...
>>> squares
[0, 1, 4, 9, 16, 25, 36, 49, 64, 81]
>>> combs = []
>>> for x in [1,2,3]:
... for y in [3,1,4]:
... if x != y:
... combs.append((x, y))
Source: https://docs.python.org/2/tutorial/datastructures.html
...
>>> combs
[(1, 3), (1, 4), (2, 3), (2, 1), (2, 4), (3, 1), (3, 4)]
Note how the order of the for and if statements is the same in both these snippets.
If the expression is a tuple (e.g. the (x, y) in the previous example), it must be
parenthesized.
The initial expression in a list comprehension can be any arbitrary expression, including
another list comprehension.
Source: https://docs.python.org/2/tutorial/datastructures.html
Consider the following example of a 3x4 matrix implemented as a list of 3 lists of length
4:
>>> matrix = [
... [1, 2, 3, 4],
... [5, 6, 7, 8],
... [9, 10, 11, 12],
... ]
As we saw in the previous section, the nested listcomp is evaluated in the context of
the for that follows it, so this example is equivalent to:
>>> transposed = []
>>> for i in range(4):
... transposed.append([row[i] for row in matrix])
...
>>> transposed
[[1, 5, 9], [2, 6, 10], [3, 7, 11], [4, 8, 12]]
>>> transposed = []
>>> for i in range(4):
... # the following 3 lines implement the nested listcomp
... transposed_row = []
... for row in matrix:
... transposed_row.append(row[i])
... transposed.append(transposed_row)
...
>>> transposed
[[1, 5, 9], [2, 6, 10], [3, 7, 11], [4, 8, 12]]
In the real world, you should prefer built-in functions to complex flow statements.
The zip() function would do a great job for this use case:
>>> zip(*matrix)
[(1, 5, 9), (2, 6, 10), (3, 7, 11), (4, 8, 12)]
See Unpacking Argument Lists for details on the asterisk in this line.
Source: https://docs.python.org/2/tutorial/datastructures.html
>>> del a
Referencing the name a hereafter is an error (at least until another value is assigned to
it). We’ll find other uses for del later.
As you see, on output tuples are always enclosed in parentheses, so that nested tuples
are interpreted correctly; they may be input with or without surrounding parentheses,
although often parentheses are necessary anyway (if the tuple is part of a larger
expression). It is not possible to assign to the individual items of a tuple, however it is
possible to create tuples which contain mutable objects, such as lists.
Though tuples may seem similar to lists, they are often used in different situations and for
different purposes. Tuples are immutable, and usually contain a heterogeneous
sequence of elements that are accessed via unpacking (see later in this section) or
indexing (or even by attribute in the case of namedtuples). Lists are mutable, and their
elements are usually homogeneous and are accessed by iterating over the list.
A special problem is the construction of tuples containing 0 or 1 items: the syntax has
some extra quirks to accommodate these. Empty tuples are constructed by an empty pair
of parentheses; a tuple with one item is constructed by following a value with a comma (it
is not sufficient to enclose a single value in parentheses). Ugly, but effective. For example:
>>> empty = ()
>>> singleton = 'hello', # <-- note trailing comma
>>> len(empty)
0
>>> len(singleton)
1
>>> singleton
('hello',)
>>> x, y, z = t
This is called, appropriately enough, sequence unpacking and works for any sequence
on the right-hand side. Sequence unpacking requires the list of variables on the left to
Source: https://docs.python.org/2/tutorial/datastructures.html
have the same number of elements as the length of the sequence. Note that multiple
assignment is really just a combination of tuple packing and sequence unpacking.
5.4. Sets
Python also includes a data type for sets. A set is an unordered collection with no
duplicate elements. Basic uses include membership testing and eliminating duplicate
entries. Set objects also support mathematical operations like union, intersection,
difference, and symmetric difference.
Curly braces or the set() function can be used to create sets. Note: to create an empty
set you have to use set(), not {}; the latter creates an empty dictionary, a data structure
that we discuss in the next section.
5.5. Dictionaries
Another useful data type built into Python is the dictionary (see Mapping Types — dict).
Dictionaries are sometimes found in other languages as “associative memories” or
“associative arrays”. Unlike sequences, which are indexed by a range of numbers,
dictionaries are indexed by keys, which can be any immutable type; strings and numbers
can always be keys. Tuples can be used as keys if they contain only strings, numbers, or
tuples; if a tuple contains any mutable object either directly or indirectly, it cannot be used
as a key. You can’t use lists as keys, since lists can be modified in place using index
assignments, slice assignments, or methods like append() and extend().
It is best to think of a dictionary as an unordered set of key: value pairs, with the
requirement that the keys are unique (within one dictionary). A pair of braces creates an
empty dictionary: {}. Placing a comma-separated list of key:value pairs within the braces
adds initial key:value pairs to the dictionary; this is also the way dictionaries are written
on output.
The main operations on a dictionary are storing a value with some key and extracting the
value given the key. It is also possible to delete a key:value pair with del. If you store
using a key that is already in use, the old value associated with that key is forgotten. It is
an error to extract a value using a non-existent key.
The keys() method of a dictionary object returns a list of all the keys used in the
dictionary, in arbitrary order (if you want it sorted, just apply the sorted() function to it).
To check whether a single key is in the dictionary, use the in keyword.
The dict() constructor builds dictionaries directly from sequences of key-value pairs:
Source: https://docs.python.org/2/tutorial/datastructures.html
In addition, dict comprehensions can be used to create dictionaries from arbitrary key and
value expressions:
When the keys are simple strings, it is sometimes easier to specify pairs using keyword
arguments:
To loop over two or more sequences at the same time, the entries can be paired with
the zip() function.
To loop over a sequence in reverse, first specify the sequence in a forward direction and
then call the reversed() function.
...
9
7
5
3
1
To loop over a sequence in sorted order, use the sorted() function which returns a new
sorted list while leaving the source unaltered.
When looping through dictionaries, the key and corresponding value can be retrieved at
the same time using the iteritems() method.
It is sometimes tempting to change a list while you are looping over it; however, it is often
simpler and safer to create a new list instead.
The comparison operators in and not in check whether a value occurs (does not
occur) in a sequence. The operators is and is not compare whether two objects are
really the same object; this only matters for mutable objects like lists. All comparison
operators have the same priority, which is lower than that of all numerical operators.
Comparisons may be combined using the Boolean operators and and or, and the
outcome of a comparison (or of any other Boolean expression) may be negated with not.
These have lower priorities than comparison operators; between them, not has the
highest priority and or the lowest, so that A and not B or C is equivalent
to (A and (not B)) or C. As always, parentheses can be used to express the desired
composition.
The Boolean operators and and or are so-called short-circuit operators: their arguments
are evaluated from left to right, and evaluation stops as soon as the outcome is
determined. For example, if Aand C are true but B is false, A and B and C does not
evaluate the expression C. When used as a general value and not as a Boolean, the
return value of a short-circuit operator is the last evaluated argument.
sequence is the smaller (lesser) one. Lexicographical ordering for strings uses the ASCII
ordering for individual characters. Some examples of comparisons between sequences
of the same type:
Note that comparing objects of different types is legal. The outcome is deterministic but
arbitrary: the types are ordered by their name. Thus, a list is always smaller than a string,
a string is always smaller than a tuple, etc. [1] Mixed numeric types are compared
according to their numeric value, so 0 equals 0.0, etc.