The modules described in this chapter provide a variety of specialized data types such as dates and times, fixed-type arrays, heap queues, synchronized queues, and sets.
The following modules are documented in this chapter:
|Basic date and time types.
|Functions for working with calendars, including some emulation of the Unix cal program.
|Heap queue algorithm (a.k.a. priority queue).
|Array bisection algorithms for binary searching.
|Efficient arrays of uniformly typed numeric values.
|Implementation of sets of unique elements.
|General purpose event scheduler.
|Lock and queue for mutual exclusion.
|A synchronized queue class.
|Support for weak references and weak dictionaries.
|Class wrapper for dictionary objects.
|Class wrapper for list objects.
|Class wrapper for string objects.
|Names for built-in types.
|Interface to the creation of runtime implementation objects.
|Shallow and deep copy operations.
|Data pretty printer.
|Alternate repr() implementation with size limits.
See About this document... for information on suggesting changes.