updated boost::unordered_[multi]set and boost::unordered_(flat|node)_map benchmarks

doc/unordered/benchmarks.adoc

@@ -10,7 +10,7 @@ All benchmarks were created using `unordered_set<unsigned int>` (non-duplicate)
 
 The insertion benchmarks insert `n` random values, where `n` is between 10,000 and 3 million. For the duplicated benchmarks, the same random values are repeated an average of 5 times.
 
-The erasure benchmarks erase all `n` elements randomly until the container is empty.
+The erasure benchmarks erase all `n` elements randomly until the container is empty. Erasure by key uses `erase(const key_type&)` to remove entire groups of equivalent elements in each operation.
 
 The successful lookup benchmarks are done by looking up all `n` values, in their original insertion order.
 
@@ -30,7 +30,7 @@ The unsuccessful lookup benchmarks use `n` randomly generated integers but using
 
 h|non-duplicate elements 
 h|duplicate elements 
-h|duplicate elements +
+h|duplicate elements, +
 max load factor 5
 |===
 
@@ -64,8 +64,18 @@ prior `reserve`
 
 h|non-duplicate elements 
 h|duplicate elements 
-h|duplicate elements +
+h|duplicate elements, +
 max load factor 5
+
+|
+|image::benchmarks-set/gcc/scattered%20erasure%20by%20key.xlsx.practice non-unique.png[width=250,link=../diagrams/benchmarks-set/gcc/scattered%20erasure%20by%20key.xlsx.practice non-unique.png,window=_blank]
+|image::benchmarks-set/gcc/scattered%20erasure%20by%20key.xlsx.practice non-unique 5.png[width=250,link=../diagrams/benchmarks-set/gcc/scattered%20erasure%20by%20key.xlsx.practice non-unique 5.png,window=_blank]
+
+|
+h|by key, duplicate elements 
+h|by key, duplicate elements, +
+max load factor 5
+
 |===
 
 ==== Successful Lookup
@@ -154,6 +164,15 @@ h|duplicate elements
 h|duplicate elements, +
 max load factor 5
 
+|
+|image::benchmarks-set/clang_libcpp/scattered%20erasure%20by%20key.xlsx.practice non-unique.png[width=250,link=../diagrams/benchmarks-set/clang_libcpp/scattered%20erasure%20by%20key.xlsx.practice non-unique.png,window=_blank]
+|image::benchmarks-set/clang_libcpp/scattered%20erasure%20by%20key.xlsx.practice non-unique 5.png[width=250,link=../diagrams/benchmarks-set/clang_libcpp/scattered%20erasure%20by%20key.xlsx.practice non-unique 5.png,window=_blank]
+
+|
+h|by key, duplicate elements 
+h|by key, duplicate elements, +
+max load factor 5
+
 |===
 
 ==== Successful lookup
@@ -242,6 +261,15 @@ h|duplicate elements
 h|duplicate elements, +
 max load factor 5
 
+|
+|image::benchmarks-set/vs/scattered%20erasure%20by%20key.xlsx.practice non-unique.png[width=250,link=../diagrams/benchmarks-set/vs/scattered%20erasure%20by%20key.xlsx.practice non-unique.png,window=_blank]
+|image::benchmarks-set/vs/scattered%20erasure%20by%20key.xlsx.practice non-unique 5.png[width=250,link=../diagrams/benchmarks-set/vs/scattered%20erasure%20by%20key.xlsx.practice non-unique 5.png,window=_blank]
+
+|
+h|by key, duplicate elements 
+h|by key, duplicate elements, +
+max load factor 5
+
 |===
 
 ==== Successful lookup