In this lecture, we'll go over the different collections of objects that Python natively supports. In previous lectures we dealt only with single strings, ints, and floats; now we'll be able to handle arbitrarily large numbers of them. By the end of the lecture, you should be able to
Lists are probably the most basic data structure in Python; they contain ordered elements and can be of abitrary length. Other languages may refer to this basic structure as an "array", and indeed there are similarities. But for our purposes and anytime you're coding in Python, we'll use the term "list."
When I say "data structures," I mean any type that is more sophisticated than the ints and floats we've been working with up until now. I purposefully omitted strs, because they are in fact a data structure unto themselves: they build on the single character, and are effective a "list of characters." In much the same way, we'll see in this lecture how to define a "list of ints", a "list of floats", and even a "list of strs"!
Lists in Python have a few core properties:
In [1]:
x = list()
Here I've defined an empty list, called x. Like our previous variables, this has both a name (x) and a type (list). However, it doesn't have any actual value beyond that; it's just an empty list. Imagine a filing cabinet with nothing in it.
So how do we add things? Lists, as it turns out, have a few methods we can invoke (methods are pieces of functionality that we'll cover more when we get to functions). Here's a useful one:
In [2]:
x.append(1)
The append() method takes whatever argument I supply to the function, and inserts it into the next available position in the list. Which, in this case, is the very first position (since the list was previously empty).
What does our list look like now?
In [3]:
print(x)
It's tough to tell that there's really anything going on, but those square brackets [ and ] are the key: those denote a list, and anything inside those brackets is an element of the list.
Let's look at another list, a bit more interesting this time.
In [4]:
y = list()
y.append(1)
y.append(2)
y.append(3)
print(y)
In this example, I've created a new list y, initially empty, and added three integer values. Notice the ordering of the elements when I print the list at the end: from left-to-right, you'll see the elements in the order that they were added.
You can put any elements you want into a list. If you wanted, you could add strings
In [5]:
y.append("this is perfectly legal")
and floats
In [6]:
y.append(4.2)
and even other lists!
In [7]:
y.append(list()) # Inception BWAAAAAAAAAA
print(y)
So I have these lists and I've stored some things in them. I can print them out and see what I've stored...but so far they seem pretty unwieldy. How do I remove things? If someone asks me for whatever was added 3$^{rd}$, how do I give that to them without giving them the whole list?
Glad you asked! The answers to these questions involve indexing.
Indexing is what happens when you refer to an existing element in a list. For example, in our hybrid list y with lots of random stuff in it, what's the first element?
In [8]:
first_element = y[1]
print(first_element)
print(y)
In this code example, I've used the number 1 as an index to y. In doing so, I took out the value at index 1 and put it into a variable named first_element. I then printed it, as well as the list y, and voi--
--wait, "2" is the second element. o_O
Python and its spiritual progenitors C and C++ are known as zero-indexed languages. This means when you're dealing with lists or arrays, the index of the first element is always 0.
This stands in contrast with languages such as Julia and Matlab, where the index of the first element of a list or array is, indeed, 1. Preference for one or the other tends to covary with whatever you were first taught, though in scientific circles it's generally preferred that languages be 0-indexed$^{[\text{citation needed}]}$.
So what is in the 0 index of our list?
In [9]:
print(y[0])
print(y)
Much better.
This little caveat is usually the main culprit of errors for new programmers. Give yourself some time to get used to Python's 0-indexed lists. You'll see what I mean when we get to loops.
In addition to elements 0 and 1, we can also directly index elements at the end of the list.
In [10]:
print(y[-1])
print(y)
Yep, there's our inception-list, the last element of y.
You can think of this indexing strategy as "wrapping around" the list to the end of it. Similarly, you can also negate other numbers to access the second-to-last element, third-to-last element...
In [11]:
print(y[-2])
print(y[-3])
print(y)
Using more indexing voodoo, you can also index slices of lists. Let's say we want to create a new list that consists of the integer elements of y, which are the first three. We could pull them out one by one, or use slicing:
In [12]:
int_elements = y[0:3] # Slicing!
print(y)
print(int_elements)
That y[0:3] notation is the slicing. The first number, 0, indicates the first index of values we want to keep. The colon : indicates slicing, and the second number, 3, indicates the last index of values.
You could even say this out loud: "With list y, slice starting at index 0 to index 3." The colon is the "to".
The astute reader will notice that index 3 in y is actually the string!
In [13]:
print(y[3])
So, if we're slicing "from 0 to 3", why is this including index 0 but excluding index 3?
When you slice an array, the first (starting) index is inclusive; the second (ending) index, however, is exclusive. In mathematical notation, it would look something like this:
$[ starting : ending )$
Therefore, the end index is one after the last index you want to keep.
You don't always have to start with empty lists. You can pre-define a full list; just use brackets!
In [14]:
z = [42, 502.4, "some string", 0]
If you understood lists, sets and tuples are easy-peasy. They're both exactly the same as lists...except:
Tuples:
Sets:
Other than these two rules, pretty much anything you can do with lists can also be done with tuples and sets.
Whereas we used square brackets to create a list
In [15]:
x = [3, 64.2, "some list"]
print(type(x))
we use regular parentheses to create a tuple!
In [16]:
y = (3, 64.2, "some tuple")
print(type(y))
With lists, if you wanted to change the item at index 2, you could go right ahead:
In [17]:
x[2] = "a different string"
print(x)
Can't do that with tuples, sorry.
In [50]:
y[2] = "does this work?"
Like list, there is a method for building an empty tuple. Any guesses?
In [19]:
z = tuple()
And like lists, you have (almost) all of the other methods at your disposal, such as slicing and len:
In [20]:
print(y[0:2])
print(len(y))
Sets are interesting buggers, in that they only allow you to store a particular element once.
In [21]:
x = list()
x.append(1)
x.append(2)
x.append(2) # Add the same thing twice.
s = set()
s.add(1)
s.add(2)
s.add(2) # Add the same thing twice...again.
In [22]:
print(x)
In [23]:
print(s)
There are certain situations where this can be very useful. It should be noted that sets can actually be built from lists, so you can build a list and then turn it into a set:
In [24]:
x = [1, 2, 3, 3]
s = set(x) # Take the list x as the starting point.
print(s)
Sets also don't index the same way lists and tuples do:
In [49]:
print(s[0])
If you want to add elements to a set, you can use the add method.
If you want to remove elements from a set, you can use the discard or remove methods.
But you can't index or slice a set.
It's useful for checking if you've seen a particular kind of thing at least once.
In [1]:
s = set([1, 3, 6, 2, 5, 8, 8, 3, 2, 3, 10])
print(10 in s) # Basically asking: is 10 in our set?
print(11 in s)
Dictionaries deserve a section all to themselves.
Are you familiar with key-value stores? Associative arrays? Hash maps?
The basic idea of all these data type abstractions is to map a key to a value, in such a way that if you have a certain key, you always get back the value associated with that key.
You can also think of dictionaries as unordered lists with more interesting indices.
A few important points on dictionaries before we get into examples:
Dictionaries are created using the dict() method, or using curly braces:
In [26]:
d = dict()
# Or...
d = {}
New elements can be added to the dictionary in much the same way as lists:
In [27]:
d["some_key"] = 14.3
Yes, you use strings as keys! In this way, you can treat dictionaries as "look up" tables--maybe you're storing information on people in a beta testing program. You can store their information by name:
In [28]:
d["shannon_quinn"] = ["some", "personal", "information"]
print(d)
Since dictionaries do not maintain any kind of ordering of elements, using integers as indices won't give us anything useful. However, dictionaries do have a keys() method that gives us a list of all the keys in the dictionary:
In [29]:
print(d.keys())
and a values() method for (you guessed it) the values in the dictionary:
In [30]:
print(d.values())
To further induce Inception-style headaches, dictionaries also have a items() method that returns a list of tuples where each tuple is a key-value pair in the dictionary!
In [31]:
print(d.items())
(it's basically the entire dictionary, but this method is useful for looping)
Isn't this fun?!
Some questions to discuss and consider:
1: Without knowing the length of the list some_list, how would you slice it so only the first and last elements are removed?
2: Provide an example use-case where the properties of sets and tuples would come in handy over lists.
3: Would it be possible to convert a list to a dictionary? How? Would anything change?
4: Create a dictionary of lists, where the lists contain numbers. For each key-value pair, compute an average.
How is A0 going?
Any volunteers for tomorrow's flipped session?
A1 will be out on Thursday.