From fa492b52fa1a7422ae64266630e7a3e9610397c2 Mon Sep 17 00:00:00 2001
From: greg <greg7mdp@gmail.com>
Date: Sun, 3 Mar 2019 20:36:31 -0500
Subject: [PATCH] wip

---
 README.md                 | 2 +-
 pdf/parallel_hashmap.html | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index 139fa73..9a066a7 100644
--- a/README.md
+++ b/README.md
@@ -1,7 +1,7 @@
 # The Parallel Hashmap
    or Abseiling from the shoulders of giants - &copy; Gregory Popovitch - March 3, 2019
 
-[tl;dr] built on top of Abseil's *flat_hash_map*, the parallel hashmap is more memory friendly, almost as fast as the underlying *flat_hash_map*, and can be used from multiple threads with high levels of concurrency.
+[tl;dr] We present a novel hashmap design, the Parallel Hashmap. Built on top of Abseil's *flat_hash_map*, the Parallel Hashmap has lower space requirements, is nearly as fast as the underlying *flat_hash_map*, and can be used from multiple threads with high levels of concurrency.
 
 ### A quick look at the current state of the art
 
diff --git a/pdf/parallel_hashmap.html b/pdf/parallel_hashmap.html
index fe47e9e..b54ddc4 100644
--- a/pdf/parallel_hashmap.html
+++ b/pdf/parallel_hashmap.html
@@ -107,7 +107,7 @@
 </div>
 <h1 id="the-parallel-hashmap">The Parallel Hashmap</h1>
 <p>or Abseiling from the shoulders of giants - © Gregory Popovitch - March 3, 2019</p>
-<p>[tl;dr] built on top of Abseil's <em>flat_hash_map</em>, the parallel hashmap is more memory friendly, almost as fast as the underlying <em>flat_hash_map</em>, and can be used from multiple threads with high levels of concurrency.</p>
+<p>[tl;dr] We present a novel hashmap design, the Parallel Hashmap. Built on top of Abseil's <em>flat_hash_map</em>, the Parallel Hashmap has lower space requirements, is nearly as fast as the underlying <em>flat_hash_map</em>, and can be used from multiple threads with high levels of concurrency.</p>
 <h3 id="a-quick-look-at-the-current-state-of-the-art">A quick look at the current state of the art</h3>
 <p>If you haven't been living under a rock, you know that Google open sourced late last year their Abseil library, which includes a very efficient flat hash table implementation. The <em>absl::flat_hash_map</em> stores the values directly in a memory array, which avoids memory indirections (this is referred to as closed hashing).</p>
 <p><img src="https://github.com/greg7mdp/parallel-hashmap/blob/master/img/closed_hashing.png?raw=true" alt="closed_hashing" /></p>