Difference between revisions of "Intermediate C++ Game Programming Tutorial 24"

From Chilipedia
Jump to: navigation, search
(Video Timestamp Index)
(Topics Covered)
Line 2: Line 2:
  
 
== Topics Covered ==
 
== Topics Covered ==
 +
=== Part 1 ===
 
* <code>std::map</code> container interface
 
* <code>std::map</code> container interface
 
* Binary tree data structure
 
* Binary tree data structure
Line 8: Line 9:
 
* <code>std::set</code>
 
* <code>std::set</code>
 
* <code>std::multimap</code> and <code>std::multiset</code>
 
* <code>std::multimap</code> and <code>std::multiset</code>
 +
=== Part 2 ===
 +
* Hash table data structure
 +
* <code>std::unordered_map</code> key requirements
 +
* Hash combining
 +
* <code>std::unordered_map</code> bucket interface and hashing policy
  
 
== Video Timestamp Index ==
 
== Video Timestamp Index ==

Revision as of 20:31, 10 March 2018

Associative containers are super useful, both as a convenient fast way to create dictionary or mapping for real-world problems like managing game resources, and as a data structure to help solve more abstract algorithmic computer science problems. And hash tables are fast as balls.

Topics Covered

Part 1

  • std::map container interface
  • Binary tree data structure
  • std::map key requirements (comparison)
  • std::map gotchas (std::remove_if and const keys)
  • std::set
  • std::multimap and std::multiset

Part 2

  • Hash table data structure
  • std::unordered_map key requirements
  • Hash combining
  • std::unordered_map bucket interface and hashing policy

Video Timestamp Index

Supplementary Link

See also