Abstract
The Standard Template Library does not currently have hashed data structures, though it might have in the future, as a proposal has been made to the standards committee to adopt them. This chapter is based on two separate implementations that have been suggested as the basis of further action by the committee. One of these is by Robert Fraley of Hewlett-Packard and the other is by Javier Barreirro and David Musser of Rensselaer Polytechnic Institute.
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). Hash Tables. In: Data Structure Programming. Undergraduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1630-8_9
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1630-8_9
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