Abstract
In Chapter 2 and in 3 through 7, we studied container mechanisms in which there was a direct linear, or sequential, structure. Elements had a physical order. When we sort them we make their logical order conform in some way with the physical order. STL sorted containers are quite different. These containers are always kept logically sorted, so that if we write them out the values are reported in increasing order according to some rule. When we insert into a sorted container, it is placed somewhere internally consistent with that logical order. As we shall see, however, there is no necessary physical relationship between the logical position and its physical location. In fact, many different physical arrangements can be equivalent to the same logical one, since the physical structure is not sequential.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bergin, J. (1998). Sets, Maps, Multisets, and MultiMaps. In: Data Structure Programming. Undergraduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1630-8_8
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1630-8_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7223-6
Online ISBN: 978-1-4612-1630-8
eBook Packages: Springer Book Archive