Topic Overview

Welcome to our exploration of sorted maps using custom classes and comparators in Python. In today's lesson, we'll learn how to use custom classes as keys in sorted maps. This approach enhances data organization and access. With the addition of comparators, we can dictate the order in such maps.

Quick Recap on Sorted Maps

A sorted map is a dictionary with its keys always in order. This arrangement makes operations like searching for keys within a range more efficient. In Python, we use the SortedDict class from the sortedcontainers library to create sorted maps:

from sortedcontainers import SortedDict

s_map = SortedDict({'a': 1, 'b': 2, 'c': 3})
print(s_map)  # Outputs SortedDict({'a': 1, 'b': 2, 'c': 3})
Introduction to Custom Classes in Python

Custom classes enable us to create objects that fit our data — for instance, a "Person" class for employee information or a "Book" class for a library database. In Python, classes are the blueprints for creating objects.

Consider this simple class, for example:

from sortedcontainers import SortedDict

class Person:
    def __init__(self, name, age):
        self.name = name
        self.age = age

person = Person("John Doe", 30)
print(person.name)  # Outputs "John Doe"
print(person.age)   # Outputs 30
Using Custom Classes as Keys in Sorted Maps

Using custom classes as map keys helps organize complex multivariate keys in a sorted map. Below is an example of how to use comparators to dictate the order when using custom classes as keys:

from sortedcontainers import SortedDict

class Person:
    def __init__(self, name, age):
        self.name = name
        self.age = age

    def __hash__(self):
        return hash((self.name, self.score))

people = SortedDict()

john = Person("John", 30)
alice = Person("Alice", 25)

people[john] = "Programmer"
people[alice] = "Designer"

In this example, John is assigned the value "Programmer", and Alice is assigned the value "Designer". However, this code doesn't work, can you guess why?

Comparators and their Role in Sorted Maps

Python uses a comparator to determine the order of two keys. To make this comparison, we add special methods to our class — __lt__ (less than), __gt__ (greater than), __eq__ (equals), __ne__ (not equals), and __hash__ (the hash of the class instance). Without these methods, SortedDict can't compare its Person class keys.

from sortedcontainers import SortedDict

class Person:
    def __init__(self, name, age):
        self.name = name
        self.age = age

    def __lt__(self, other):
        return (self.age, self.name) < (other.age, other.name)

    def __gt__(self, other):
        return (self.age, self.name) > (other.age, other.name)

    def __eq__(self, other):
        return (self.age, self.name) == (other.age, other.name)

    def __ne__(self, other):
        return (self.age, self.name) != (other.age, other.name)
    
    def __hash__(self):
        return hash((self.name, self.age))

people = SortedDict()

john = Person("John", 30)
alice = Person("Alice", 25)

people[john] = "Programmer"
people[alice] = "Designer"

for person in people:
    print(f'{person.name} is a {people[person]}')
# Output:
# Alice is a Designer
# John is a Programmer
Sign up
Join the 1M+ learners on CodeSignal
Be a part of our community of 1M+ users who develop and demonstrate their skills on CodeSignal