Note: The content and structure of Volume 2 is still very much up in the air. Don't build any preconceptions about the final product based on the following sketch. ;-)

• Part 1 - Adaptors

  This part covers function objects, and function object adaptors, including:

  • Ch 5.1 - TBD

• Part 2 - Algorithms

  This part covers algorithms, including:

  • Ch 4.1 - Filling the Gaps in The Standard, part 1: Predicated Algorithms
  • Ch 4.2 - Filling the Gaps in The Standard, part 2: Bounded and Max'd Algorithms
  • Ch 4.3 - Debug Algorithms
  • Ch 4.4 - POD optimised algorithms
  • Ch 4.5 - Working with Unordered Ranges
  • Ch 4.6 - Overloading on Concept: Whole Collection Algorithms

• Part 3 - Functions

  This part covers function objects, and function object adaptors, including:

  • Ch 5.1 - TBD
  • Ch 5.2 - TBD
  • Ch 5.3 - TBD
  • Ch 5.4 - TBD
  • Ch 5.5 - TBD
  • Ch 5.6 - TBD
  (will include: mixing shims and FOs; fun-ptr and method adaptors that handle calling conventions; a brief look a binders; and more)

• Part 4 - Allocators and Utilities

  This part covers allocators and miscellaneous utilities, including:

  • Ch 6.1 - Allocator Facades
  • Ch 6.2 - Allocator Adaptors
  • Ch 6.3 - "Stateful" Allocators
  • Ch 6.4 - C-string functions
  • Ch 6.5 - String Slicing and Splitting

• Part 5 - Containers

  This part covers container extensions, including:

  • Ch 5.1 - Faster Containers
  • Ch 5.2 - Different Data Structures

• Part 6 - Views

  This part covers the View concept, including:

  • Ch 6.1 - The View Concept
  • Ch 6.2 - string_view
  • Ch 6.3 - Composite Views

• Part 7 - Ranges

  This part covers the Range concept, including:

  • Ch 7.1 - Ranges, part 1: Succinctness
  • Ch 7.2 - Adapting Callback Enumeration APIs to Iterator Concepts
  • Ch 7.3 - Ranges, part 2: Callback Enumeration APIs
  • Ch 7.4 - Ranges, part 3: Filtering