fix #231

README.md

@@ -398,7 +398,7 @@ The basic idea of this concept is to limit relevance by its context instead of c
 This way contextual search also <a href="https://nextapps-de.github.io/flexsearch/bench/match.html" target="_blank">improves the results of relevance-based queries</a> on a large amount of text data.
 
 <p align="center">
-    <img src="https://cdn.jsdelivr.net/gh/nextapps-de/flexsearch@master/doc/contextual-index.svg?v=4">
+    <img src="https://cdn.jsdelivr.net/gh/nextapps-de/flexsearch@master/doc/contextual-index.svg?v=4" width="100%">
 </p>
 
 <a name="installation"></a>
@@ -1116,8 +1116,8 @@ Create a new index and extend a preset with custom options:
 ```js
 var index = new FlexSearch({
     preset: "memory",
-    resolution: 5,
-    tokenize: "forward"
+    tokenize: "forward",
+    resolution: 5
 });
 ```
 
@@ -2787,9 +2787,9 @@ index = new Index({
 ```
 
 <a name="consumption"></a>
-### Memory Benchmark (Ranking)
+### Memory Consumption
 
-The book "Gulliver's Travels" (Swift Jonathan 1726) was used for this test.
+The book "Gulliver's Travels" (Swift Jonathan 1726) was completely indexed for this test:
 
 <br>
 <img src="https://cdn.jsdelivr.net/gh/nextapps-de/flexsearch@master/doc/memory-comparison.svg?v=2">

dist/flexsearch.debug.js

@@ -1,5 +1,5 @@
 /**!
- * FlexSearch.js v0.7.1 (Debug)
+ * FlexSearch.js v0.7.11 (Debug)
  * Copyright 2018-2021 Nextapps GmbH
  * Author: Thomas Wilkerling
  * Licence: Apache-2.0
@@ -666,20 +666,19 @@ function U(a, b, c, d, e) {
   }
 }
 function V(a, b, c, d, e, f, g, h) {
-  a = a[g];
-  if (d === b.length - 1) {
-    if (a.constructor === Array) {
-      if (c[d]) {
-        for (b = 0; b < a.length; b++) {
-          e.add(f, a[b], !0, !0);
+  if (a = a[g]) {
+    if (d === b.length - 1) {
+      if (a.constructor === Array) {
+        if (c[d]) {
+          for (b = 0; b < a.length; b++) {
+            e.add(f, a[b], !0, !0);
+          }
+          return;
         }
-        return;
+        a = a.join(" ");
       }
-      a = a.join(" ");
-    }
-    e.add(f, a, h, !0);
-  } else {
-    if (a) {
+      e.add(f, a, h, !0);
+    } else {
       if (a.constructor === Array) {
         for (g = 0; g < a.length; g++) {
           V(a, b, c, d, e, f, g, h);