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

From Chilipedia
Jump to: navigation, search
(Video Timestamp Index)
(Video Timestamp Index)
Line 39: Line 39:
 
* A look at the <code>std::map</code> cppreference.com documentation [https://youtu.be/JlPsCoCO99o?t=7m35s 7:35]
 
* A look at the <code>std::map</code> cppreference.com documentation [https://youtu.be/JlPsCoCO99o?t=7m35s 7:35]
 
** <code>Map.insert()</code> takes a pair type <code>std::pair<KeyType,ValueType></code>, the Map's elements
 
** <code>Map.insert()</code> takes a pair type <code>std::pair<KeyType,ValueType></code>, the Map's elements
 +
** C++ can deduce the pair Type, so <code>someMap.insert({keyX,valueXYZ});</code> will do the job
  
 
</div>
 
</div>

Revision as of 03:12, 20 January 2020

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 performance vs. binary tree performance
  • Hash table data structure
  • std::unordered_map key requirements
  • Hash combining
  • std::unordered_map bucket interface and hashing policy
  • When to choose std::map over std::unordered_map

Video Timestamp Index

Tutorial 24.1


  • The std::map<KeyType,ValueType> class 0:46
    • Maps consist of keys to lookup (associated with) values
    • map.insert( {key,value} ) to insert (key,value) pairs
    • map[key] returns a reference to the ValueType for a KeyType
  • The Binary tree data structure 2:46
    • std::map performs lookup in O(log(n)), it uses a Binary tree data structure
    • Key properties of a Binary Tree (BT):
    - Nodes can have at most 2 children (hence: binary)
    - Each left child is smaller and each right child is larger than its parent
    - Insertion is done by navigating the tree along a route Left for smaller, Right for larger such that the order property always holds
    • The big advantage of the BT properties is that retrieval is very fast
    • The beauty of std::map is that we don't have to implement any of this; it's all there in the STL 7:00
    • The STL implementation is further optimized, e.g. it uses a red-black tree for BT rebalancing
  • A look at the std::map cppreference.com documentation 7:35
    • Map.insert() takes a pair type std::pair<KeyType,ValueType>, the Map's elements
    • C++ can deduce the pair Type, so someMap.insert({keyX,valueXYZ}); will do the job

Tutorial 24.2

  • [WORK-IN-PROGRESS]

Homework Assignment

The homework for this video is to enable use of a custom datatype in unordered_map hashing over multiple (4) members of that datatype. The solution video is here.

Supplementary Link

See also