Boost.Unordered
Home
Products
Product A Product B Product C
Services
Service A Service B Service C
Download

Boost.Unordered

    • Introduction
    • Basics of Hash Tables
    • Equality Predicates and Hash Functions
    • Regular Containers
    • Concurrent Containers
    • Hash Quality
    • Standard Compliance
    • Data Structures
    • Debuggability
    • Benchmarks
    • Implementation Rationale
    • Reference
      • unordered_map
      • unordered_multimap
      • unordered_set
      • unordered_multiset
      • hash_traits
      • Statistics
      • unordered_flat_map
      • unordered_flat_set
      • unordered_node_map
      • unordered_node_set
      • concurrent_flat_map
      • concurrent_flat_set
      • concurrent_node_map
      • concurrent_node_set
    • Change Log
    • Bibliography
    • Copyright and License
Boost.Unordered
  • Boost.Unordered
  • Boost.Unordered
  • Bibliography
Edit this Page

Bibliography

  • C/C++ Users Journal. February, 2006. Pete Becker. STL and TR1: Part III - Unordered containers.
    An introduction to the standard unordered containers.

  • Wikipedia. Hash table.
    An introduction to hash table implementations. Discusses the differences between closed-addressing and open-addressing approaches.

  • Peter Dimov, 2022. Development Plan for Boost.Unordered.

This page was built using the Antora default UI.

The source code for this UI is licensed under the terms of the MPL-2.0 license.