Dictionary Fundamentals: Keys and Values

A Sequence That Stays Fixed

A tuple is a sequence of values whose elements cannot be changed after the tuple is created. It resembles a list because both sequences use integer positions for access, but a tuple is designed for data that should remain fixed. That fixed structure becomes especially useful when a sequence needs to serve as a dictionary key.

Mapping Positions to Elements

Tuple positions are integer indices. Index 0 identifies the first element, and counting continues from there. Negative indexing counts from the end: index -1 identifies the last element. The bracket operator is used to access the element at a chosen index.

In the visual, the tuple is treated as the ordered sequence (north, east, west). The positive indices identify positions from the beginning, while -1 identifies the final element from the end. Indexing retrieves an element; it does not alter the tuple.

Why Assignment Stops Working

Immutability means that once a tuple exists, its elements cannot be replaced, added, or removed. A list allows its contents to be modified after creation, but a tuple locks its contents in place. Therefore, an attempted change to an existing tuple element does not produce a modified tuple.

From Tuple to Dictionary Key

Tuples are hashable because they are immutable. This allows a tuple to be used as a dictionary key, whereas lists do not have this capability. The tuple acts as the key, and the dictionary associates that key with a value. A fixed sequence can therefore identify one dictionary entry.

The key idea is the connection between immutability and hashability. Because the tuple cannot change after creation, it is suitable for use as a stable dictionary key. A list is mutable, so it does not provide the same key capability.

Choosing Tuples or Lists

Tuples are useful for fixed structures such as coordinates, RGB color values, grouped related data, and values returned together from a function. Lists are more suitable when the sequence must change frequently. The choice is based on whether the contents should be fixed or flexible.

Mistakes with Fixed Sequences

• Treating a tuple like a list that can be edited in place.

  Tuples are immutable, so their elements cannot be changed after creation.

  Fix: Create a new tuple when a different fixed sequence is needed, or choose a list when the contents must change.

• Forgetting that indexing begins at 0.

  The first tuple element is at index 0.

  Fix: Use 0 for the first element and -1 for the last element.

• Choosing a list when a fixed sequence must be a dictionary key.

  Lists do not have the hashable capability that allows tuples to serve as dictionary keys.

  Fix: Use a tuple when the sequence is fixed and needs to function as a dictionary key.

• Assuming that being immutable means a tuple cannot be inspected or combined.

  Many sequence operations work on tuples; immutability means the existing tuple is not changed.

  Fix: Use supported sequence operations to inspect or produce sequence results while keeping the original tuple fixed.

Trace the Tuple

A complete reasoning path is: index 0 selects blue, index 1 selects yellow, and index -1 selects black. Replacing the element at index 1 cannot modify the existing tuple because tuple elements are immutable. The tuple can serve as a dictionary key because its immutability makes it hashable.

Essential Takeaways

1. A tuple is an immutable sequence whose elements are accessed with integer indices.
2. Index 0 selects the first element, and index -1 selects the last element.
3. An existing tuple cannot have its elements replaced, added, or removed.
4. Tuple immutability makes tuples hashable, so tuples can be used as dictionary keys while lists cannot.
5. Choose tuples for fixed data and lists for data that needs frequent modification.