Documentation.

h2/src/docsrc/html/mvstore.html

@@ -247,8 +247,8 @@ For common use cases, the storage overhead of this utility is very small compare
 
 <h3 id="inMemory">In-Memory Performance and Usage</h3>
 <p>
-Performance of in-memory operations is comparable with <code>java.util.TreeMap</code>
-(many operations are actually faster), but usually slower than <code>java.util.HashMap</code>.
+Performance of in-memory operations is comparable with <code>java.util.TreeMap</code>,
+but usually slower than <code>java.util.HashMap</code>.
 </p><p>
 The memory overhead for large maps is slightly better than for the regular
 map implementations, but there is a higher overhead per map.

h2/src/tools/org/h2/build/doc/dictionary.txt

@@ -735,4 +735,4 @@ mgcodeact cumer reach notably computation varies smuggled stderr sees messes
 nico devel nicolas linestring atelier fortin cnrs tweet geospatialnews bundles
 srid roads
 
-overlaps anyhow poly manifested cardinal invalidated
+overlaps anyhow poly manifested cardinal invalidated boosting rogue