summaryrefslogtreecommitdiff
path: root/posts/libstdc++-std-unordered-map/libstdc++-unordered-map.md
diff options
context:
space:
mode:
Diffstat (limited to 'posts/libstdc++-std-unordered-map/libstdc++-unordered-map.md')
-rw-r--r--posts/libstdc++-std-unordered-map/libstdc++-unordered-map.md4
1 files changed, 4 insertions, 0 deletions
diff --git a/posts/libstdc++-std-unordered-map/libstdc++-unordered-map.md b/posts/libstdc++-std-unordered-map/libstdc++-unordered-map.md
index a1ddad2..bb39544 100644
--- a/posts/libstdc++-std-unordered-map/libstdc++-unordered-map.md
+++ b/posts/libstdc++-std-unordered-map/libstdc++-unordered-map.md
@@ -1,3 +1,7 @@
+[TOC]
+
+## Introduction
+
We all love maps. We love hash maps even more. They should be fast and
help to solve a large number of problems. Do you ever wonder about how they are
working under the hood? In this post I am going to explore implementation