From e57fe7609373677db563187df8f30c81e67be26c Mon Sep 17 00:00:00 2001
From: Bailey Thompson <bkthomps@edu.uwaterloo.ca>
Date: Tue, 12 Dec 2017 00:33:31 -0500
Subject: [PATCH] Add unordered_map

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 0af0a6c..9c1a7d3 100644
--- a/README.md
+++ b/README.md
@@ -21,7 +21,7 @@ Data structures that can be quickly searched which use comparators.
 # Unordered associative containers
 Data structures that can be quickly searched which use hashing.
 <p> unordered_set - collection of unique keys, hashed by keys
-<p> unordered_map (todo) - collection of key-value pairs, hashed by keys, keys are unique
+<p> unordered_map - collection of key-value pairs, hashed by keys, keys are unique
 <p> unordered_multiset (todo) - collection of keys, hashed by keys
 <p> unordered_multimap (todo) - collection of key-value pairs, hashed by keys