Code icon

The App is Under a Quick Maintenance

We apologize for the inconvenience. Please come back later

Menu iconMenu iconPython & SQL Bible
Python & SQL Bible

Chapter 5: Deep Dive into Data Structures

5.4 Python's Collections Module

Python's collections module is a great resource for developers looking to work with different data structures. In addition to the built-in ones, the module offers a variety of specialized data structures that can help optimize performance and simplify code.

For example, the defaultdict class is a subclass of the built-in dict class that automatically initializes missing keys with a default value. Another useful data structure is the Counter class, which allows you to count occurrences of items in a list or other iterable. By taking advantage of these additional data structures, developers can write more efficient and effective code.

Here's a brief introduction:

  • Counter: A dict subclass for counting hashable objects.
from collections import Counter
c = Counter('hello world')
print(c)  # Outputs: Counter({'l': 3, 'o': 2, 'h': 1, 'e': 1, ' ': 1, 'w': 1, 'r': 1, 'd': 1})
  • defaultdict: A dict subclass that calls a factory function to supply missing values.
from collections import defaultdict
d = defaultdict(int)
d['missing']
print(d)  # Outputs: defaultdict(<class 'int'>, {'missing': 0})
  • OrderedDict: A dict subclass that remembers the order entries were added.
from collections import OrderedDict
d = OrderedDict()
d['a'] = 1
d['b'] = 2
print(d)  # Outputs: OrderedDict([('a', 1), ('b', 2)])
  • deque: A list-like container with fast appends and pops on either end.
from collections import deque
d = deque()
d.append('a')
d.append('b')
print(d)  # Outputs: deque(['a', 'b'])
  • namedtuple: Generates subclasses of tuple with named fields.
from collections import namedtuple
Point = namedtuple('Point', ['x', 'y'])
p = Point(1, y=2)
print(p)  # Outputs: Point(x=1, y=2)

5.4 Python's Collections Module

Python's collections module is a great resource for developers looking to work with different data structures. In addition to the built-in ones, the module offers a variety of specialized data structures that can help optimize performance and simplify code.

For example, the defaultdict class is a subclass of the built-in dict class that automatically initializes missing keys with a default value. Another useful data structure is the Counter class, which allows you to count occurrences of items in a list or other iterable. By taking advantage of these additional data structures, developers can write more efficient and effective code.

Here's a brief introduction:

  • Counter: A dict subclass for counting hashable objects.
from collections import Counter
c = Counter('hello world')
print(c)  # Outputs: Counter({'l': 3, 'o': 2, 'h': 1, 'e': 1, ' ': 1, 'w': 1, 'r': 1, 'd': 1})
  • defaultdict: A dict subclass that calls a factory function to supply missing values.
from collections import defaultdict
d = defaultdict(int)
d['missing']
print(d)  # Outputs: defaultdict(<class 'int'>, {'missing': 0})
  • OrderedDict: A dict subclass that remembers the order entries were added.
from collections import OrderedDict
d = OrderedDict()
d['a'] = 1
d['b'] = 2
print(d)  # Outputs: OrderedDict([('a', 1), ('b', 2)])
  • deque: A list-like container with fast appends and pops on either end.
from collections import deque
d = deque()
d.append('a')
d.append('b')
print(d)  # Outputs: deque(['a', 'b'])
  • namedtuple: Generates subclasses of tuple with named fields.
from collections import namedtuple
Point = namedtuple('Point', ['x', 'y'])
p = Point(1, y=2)
print(p)  # Outputs: Point(x=1, y=2)

5.4 Python's Collections Module

Python's collections module is a great resource for developers looking to work with different data structures. In addition to the built-in ones, the module offers a variety of specialized data structures that can help optimize performance and simplify code.

For example, the defaultdict class is a subclass of the built-in dict class that automatically initializes missing keys with a default value. Another useful data structure is the Counter class, which allows you to count occurrences of items in a list or other iterable. By taking advantage of these additional data structures, developers can write more efficient and effective code.

Here's a brief introduction:

  • Counter: A dict subclass for counting hashable objects.
from collections import Counter
c = Counter('hello world')
print(c)  # Outputs: Counter({'l': 3, 'o': 2, 'h': 1, 'e': 1, ' ': 1, 'w': 1, 'r': 1, 'd': 1})
  • defaultdict: A dict subclass that calls a factory function to supply missing values.
from collections import defaultdict
d = defaultdict(int)
d['missing']
print(d)  # Outputs: defaultdict(<class 'int'>, {'missing': 0})
  • OrderedDict: A dict subclass that remembers the order entries were added.
from collections import OrderedDict
d = OrderedDict()
d['a'] = 1
d['b'] = 2
print(d)  # Outputs: OrderedDict([('a', 1), ('b', 2)])
  • deque: A list-like container with fast appends and pops on either end.
from collections import deque
d = deque()
d.append('a')
d.append('b')
print(d)  # Outputs: deque(['a', 'b'])
  • namedtuple: Generates subclasses of tuple with named fields.
from collections import namedtuple
Point = namedtuple('Point', ['x', 'y'])
p = Point(1, y=2)
print(p)  # Outputs: Point(x=1, y=2)

5.4 Python's Collections Module

Python's collections module is a great resource for developers looking to work with different data structures. In addition to the built-in ones, the module offers a variety of specialized data structures that can help optimize performance and simplify code.

For example, the defaultdict class is a subclass of the built-in dict class that automatically initializes missing keys with a default value. Another useful data structure is the Counter class, which allows you to count occurrences of items in a list or other iterable. By taking advantage of these additional data structures, developers can write more efficient and effective code.

Here's a brief introduction:

  • Counter: A dict subclass for counting hashable objects.
from collections import Counter
c = Counter('hello world')
print(c)  # Outputs: Counter({'l': 3, 'o': 2, 'h': 1, 'e': 1, ' ': 1, 'w': 1, 'r': 1, 'd': 1})
  • defaultdict: A dict subclass that calls a factory function to supply missing values.
from collections import defaultdict
d = defaultdict(int)
d['missing']
print(d)  # Outputs: defaultdict(<class 'int'>, {'missing': 0})
  • OrderedDict: A dict subclass that remembers the order entries were added.
from collections import OrderedDict
d = OrderedDict()
d['a'] = 1
d['b'] = 2
print(d)  # Outputs: OrderedDict([('a', 1), ('b', 2)])
  • deque: A list-like container with fast appends and pops on either end.
from collections import deque
d = deque()
d.append('a')
d.append('b')
print(d)  # Outputs: deque(['a', 'b'])
  • namedtuple: Generates subclasses of tuple with named fields.
from collections import namedtuple
Point = namedtuple('Point', ['x', 'y'])
p = Point(1, y=2)
print(p)  # Outputs: Point(x=1, y=2)