Policy-Based Data Structures
    Ami Tavory and Vladimir Dreizin, IBM Haifa Research
    Laboratories, and Benjamin Kosnik, Red Hat
    
    This is a library of policy-based elementary
    data structures: associative containers and priority queues. It
    is designed for high-performance, flexibility, semantic safety,
    and conformance to the corresponding containers in std
    and std::tr1 (except for some points where it differs by
    design).
    The documentation is organized as follows:
    
      - 
        Introductory
        
          - Introduction
- Motivation
- Usage
          Prerequisites
 
- 
        Interface
        
          - Short Tutorial
- Concepts
- Specifics
        
 
- 
        Design
        
          - 
            Associative Containers
            
              - Data-Structure
              Genericity and Interface 
- Tree-Based
              Containers
- Trie-Based
              Containers
- Hash-Based
              Containers
- List-Based
              Containers 
 
- Priority Queues
 
- 
        Examples
        
          - Associative
          Containers
- Priority Queues
 
- 
        Tests
        
          - 
            Associative Containers
            
              - Regression
              Tests
- Performance
              Tests
 
- 
            Priority Queues
            
              - Regression
              Tests
- Performance
              Tests
 
 
- 
        Misc.
        
          - Acknowledgments
- Contact
- Disclaimer and
          Copyright
- References