Sequences, Mappings and Sets

Abstract

Several sequential data structures have been introduced in this book, including strings, tuples, lists, and structures that can be implemented using lists, such as stacks, queues and priority queues. This chapter further gives a set of commonly used methods for sequential types, before moving on to two typical container data structures that are not sequential: dicts and sets. While dicts represent unordered mappings from keys to values, a set represents an unordered container of immutable objects. Both dicts and sets are mutable. This chapter finishes by introducing a set of bitwise operators, which enable the implementation of sets using non-negative integers.