Skip to content
Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

HashMap

A collection that looks values up by key.

HashMap<K, V> maps keys to values using a hash of each key; lookup, insert, and remove take constant time on average, and iteration order is unspecified.

Loading interactive…

Examples

  • After stock.insert("apples".to_string(), 40);, stock.get("apples") returns Some(&40).

See also

hash function entry API BTreeMap
Read the full section →