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

Revision as of 20:20, 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

• 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

Video Timestamp Index

• Tutorial 24.1
• Tutorial 24.2

Supplementary Link

• Data Structure / Algorithm Visualizations

See also

• Next in series (Tutorial 25)
• Intermediate C++ Game Programming Series