Sorting Python dictionaries by Keys. If we want to order or sort the dictionary objects by their keys, the simplest way to do so is by Python's built-in sorted method, which will take any iterable and return a list of the values which has been sorted (in ascending order by default). ❮ Python Glossary Loop Through a Dictionary You can loop through a dictionary by using a for loop. When looping through a dictionary, the return value are the keys of the dictionary, but there are methods to return the values as well.
This chapter describes some things you’ve learned about already in more detail,and adds some new things as well.
The list data type has some more methods. Here are all of the methods of listobjects:
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 toa[len(a):]=L
.
list.
insert
(i, x)Insert an item at a given position. The first argument is the index of theelement before which to insert, so a.insert(0,x)
inserts at the front ofthe 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 thereis no such item.
list.
pop
([i])Remove the item at the given position in the list, and return it. If no indexis specified, a.pop()
removes and returns the last item in the list. (Thesquare brackets around the i in the method signature denote that the parameteris optional, not that you should type square brackets at that position. Youwill 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 anerror if there is no such item.
list.
count
(x)Return the number of times x appears in the list.
list.
sort
(cmp=None, key=None, reverse=False)Sort the items of the list in place (the arguments can be used for sortcustomization, see sorted()
for their explanation).
list.
reverse
()Reverse the elements of the list, in place.
An example that uses most of the list methods:
You might have noticed that methods like insert
, remove
or sort
thatonly modify the list have no return value printed – they return the defaultNone
. This is a design principle for all mutable data structures inPython.
The list methods make it very easy to use a list as a stack, where the lastelement added is the first element retrieved (“last-in, first-out”). To add anitem to the top of the stack, use append()
. To retrieve an item from thetop of the stack, use pop()
without an explicit index. For example:
It is also possible to use a list as a queue, where the first element added isthe first element retrieved (“first-in, first-out”); however, lists are notefficient for this purpose. While appends and pops from the end of list arefast, doing inserts or pops from the beginning of a list is slow (because allof the other elements have to be shifted by one).
To implement a queue, use collections.deque
which was designed tohave fast appends and pops from both ends. For example:
There are three built-in functions that are very useful when used with lists:filter()
, map()
, and reduce()
.
filter(function,sequence)
returns a sequence consisting of those items fromthe sequence for which function(item)
is true. If sequence is astr
, unicode
or tuple
, the result will be of thesame type; otherwise, it is always a list
. For example, to compute asequence of numbers divisible by 3 or 5:
map(function,sequence)
calls function(item)
Free online poker games without downloading. for each of the sequence’sitems and returns a list of the return values. For example, to compute somecubes:
More than one sequence may be passed; the function must then have as manyarguments as there are sequences and is called with the corresponding item fromeach sequence (or None
if some sequence is shorter than another). Forexample:
reduce(function,sequence)
returns a single value constructed by calling thebinary function function on the first two items of the sequence, then on theresult and the next item, and so on. For example, to compute the sum of thenumbers 1 through 10:
If there’s only one item in the sequence, its value is returned; if the sequenceis empty, an exception is raised.
A third argument can be passed to indicate the starting value. In this case thestarting value is returned for an empty sequence, and the function is firstapplied to the starting value and the first sequence item, then to the resultand the next item, and so on. For example,
Don’t use this example’s definition of sum()
: since summing numbers issuch 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 ofsome operations applied to each member of another sequence or iterable, or tocreate a subsequence of those elements that satisfy a certain condition.
For example, assume we want to create a list of squares, like:
We can obtain the same result with:
This is also equivalent to squares=map(lambdax:x**2,range(10))
,but it’s more concise and readable.
A list comprehension consists of brackets containing an expression followedby a for
clause, then zero or more for
or if
clauses. The result will be a new list resulting from evaluating the expressionin the context of the for
and if
clauses which follow it.For example, this listcomp combines the elements of two lists if they are notequal:
and it’s equivalent to:
Note how the order of the for
and if
statements is thesame in both these snippets.
If the expression is a tuple (e.g. the (x,y)
in the previous example),it must be parenthesized.
List comprehensions can contain complex expressions and nested functions:
The initial expression in a list comprehension can be any arbitrary expression,including another list comprehension.
Consider the following example of a 3x4 matrix implemented as a list of3 lists of length 4:
The following list comprehension will transpose rows and columns:
As we saw in the previous section, the nested listcomp is evaluated inthe context of the for
that follows it, so this example isequivalent to:
which, in turn, is the same as:
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:
See Unpacking Argument Lists for details on the asterisk in this line.
del
statement¶There is a way to remove an item from a list given its index instead of itsvalue: the del
statement. This differs from the pop()
methodwhich returns a value. The del
statement can also be used to removeslices from a list or clear the entire list (which we did earlier by assignmentof an empty list to the slice). For example:
del
can also be used to delete entire variables:
Referencing the name a
hereafter is an error (at least until another valueis assigned to it). We’ll find other uses for del
later.
We saw that lists and strings have many common properties, such as indexing andslicing operations. They are two examples of sequence data types (seeSequence Types — str, unicode, list, tuple, bytearray, buffer, xrange). Since Python is an evolving language, other sequence datatypes may be added. There is also another standard sequence data type: thetuple.
A tuple consists of a number of values separated by commas, for instance:
As you see, on output tuples are always enclosed in parentheses, so that nestedtuples are interpreted correctly; they may be input with or without surroundingparentheses, although often parentheses are necessary anyway (if the tuple ispart of a larger expression). It is not possible to assign to the individualitems of a tuple, however it is possible to create tuples which contain mutableobjects, such as lists.
Though tuples may seem similar to lists, they are often used in differentsituations and for different purposes.Tuples are immutable, and usually contain a heterogeneous sequence ofelements 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 areaccessed by iterating over the list.
A special problem is the construction of tuples containing 0 or 1 items: thesyntax has some extra quirks to accommodate these. Empty tuples are constructedby an empty pair of parentheses; a tuple with one item is constructed byfollowing a value with a comma (it is not sufficient to enclose a single valuein parentheses). Ugly, but effective. For example:
The statement t=12345,54321,'hello!'
is an example of tuple packing:the values 12345
, 54321
and 'hello!'
are packed together in a tuple.The reverse operation is also possible:
This is called, appropriately enough, sequence unpacking and works for anysequence on the right-hand side. Sequence unpacking requires the list ofvariables on the left to have the same number of elements as the length of thesequence. Note that multiple assignment is really just a combination of tuplepacking and sequence unpacking.
Python also includes a data type for sets. A set is an unordered collectionwith no duplicate elements. Basic uses include membership testing andeliminating duplicate entries. Set objects also support mathematical operationslike union, intersection, difference, and symmetric difference.
Curly braces or the set()
function can be used to create sets. Note: tocreate an empty set you have to use set()
, not {}
; the latter creates anempty dictionary, a data structure that we discuss in the next section.
Here is a brief demonstration:
Similarly to list comprehensions, set comprehensionsare also supported:
Another useful data type built into Python is the dictionary (seeMapping Types — dict). Dictionaries are sometimes found in other languages as“associative memories” or “associative arrays”. Unlike sequences, which areindexed by a range of numbers, dictionaries are indexed by keys, which can beany immutable type; strings and numbers can always be keys. Tuples can be usedas keys if they contain only strings, numbers, or tuples; if a tuple containsany 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 indexassignments, slice assignments, or methods like append()
andextend()
.
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 ofbraces creates an empty dictionary: {}
. Placing a comma-separated list ofkey:value pairs within the braces adds initial key:value pairs to thedictionary; this is also the way dictionaries are written on output.
The main operations on a dictionary are storing a value with some key andextracting the value given the key. It is also possible to delete a key:valuepair with del
. If you store using a key that is already in use, the oldvalue associated with that key is forgotten. It is an error to extract a valueusing a non-existent key.
The keys()
method of a dictionary object returns a list of all the keysused in the dictionary, in arbitrary order (if you want it sorted, just applythe sorted()
function to it). To check whether a single key is in thedictionary, use the in
keyword.
Here is a small example using a dictionary:
The dict()
constructor builds dictionaries directly from sequences ofkey-value pairs:
In addition, dict comprehensions can be used to create dictionaries fromarbitrary key and value expressions:
When the keys are simple strings, it is sometimes easier to specify pairs usingkeyword arguments:
When looping through a sequence, the position index and corresponding value canbe retrieved at the same time using the enumerate()
function.
To loop over two or more sequences at the same time, the entries can be pairedwith the zip()
function.
To loop over a sequence in reverse, first specify the sequence in a forwarddirection and then call the reversed()
function.
To loop over a sequence in sorted order, use the sorted()
function whichreturns a new sorted list while leaving the source unaltered.
When looping through dictionaries, the key and corresponding value can beretrieved 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 conditions used in while
and if
statements can contain anyoperators, not just comparisons.
The comparison operators in
and notin
check whether a value occurs(does not occur) in a sequence. The operators is
and isnot
comparewhether two objects are really the same object; this only matters for mutableobjects like lists. All comparison operators have the same priority, which islower than that of all numerical operators.
Comparisons can be chained. For example, a<bc
tests whether a
isless than b
and moreover b
equals c
.
Comparisons may be combined using the Boolean operators and
and or
, andthe outcome of a comparison (or of any other Boolean expression) may be negatedwith not
. These have lower priorities than comparison operators; betweenthem, not
has the highest priority and or
the lowest, so that AandnotBorC
is equivalent to (Aand(notB))orC
. As always, parenthesescan be used to express the desired composition.
The Boolean operators and
and or
are so-called short-circuitoperators: their arguments are evaluated from left to right, and evaluationstops as soon as the outcome is determined. Printing tools software. For example, if A
and C
aretrue but B
is false, AandBandC
does not evaluate the expressionC
. When used as a general value and not as a Boolean, the return value of ashort-circuit operator is the last evaluated argument.
It is possible to assign the result of a comparison or other Boolean expressionto a variable. For example,
Note that in Python, unlike C, assignment cannot occur inside expressions. Cprogrammers may grumble about this, but it avoids a common class of problemsencountered in C programs: typing =
in an expression when wasintended.
Sequence objects may be compared to other objects with the same sequence type.The comparison uses lexicographical ordering: first the first two items arecompared, and if they differ this determines the outcome of the comparison; ifthey are equal, the next two items are compared, and so on, until eithersequence is exhausted. If two items to be compared are themselves sequences ofthe same type, the lexicographical comparison is carried out recursively. Ifall items of two sequences compare equal, the sequences are considered equal.If one sequence is an initial sub-sequence of the other, the shorter sequence isthe smaller (lesser) one. Lexicographical ordering for strings uses the ASCIIordering for individual characters. Some examples of comparisons betweensequences of the same type:
Note that comparing objects of different types is legal. The outcome isdeterministic but arbitrary: the types are ordered by their name. Thus, a listis 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 0equals 0.0, etc.
Footnotes
The rules for comparing objects of different types should not be relied upon;they may change in a future version of the language.