jsonschema-key-compression 1.6.1 → 2.0.0

package/dist/lib/create-compression-table.js

@@ -1,7 +1,12 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.uncompressedToCompressedTable = exports.compressedToUncompressedTable = exports.getPropertiesOfSchema = exports.createCompressionTable = exports.DEFAULT_COMPRESSION_FLAG = void 0;
+exports.DEFAULT_COMPRESSION_FLAG = void 0;
+exports.createCompressionTable = createCompressionTable;
+exports.getPropertiesOfSchema = getPropertiesOfSchema;
+exports.compressedToUncompressedTable = compressedToUncompressedTable;
+exports.uncompressedToCompressedTable = uncompressedToCompressedTable;
 var util_1 = require("./util");
+var enum_compression_1 = require("./enum-compression");
 /**
  * Compressed property-names begin with the compression-flag
  * it indicates that the name is compressed.
@@ -9,76 +14,97 @@ var util_1 = require("./util");
  * compression-flag, an error will be thrown.
  */
 exports.DEFAULT_COMPRESSION_FLAG = '|';
-function createCompressionTable(schema, compressionFlag, ignoreProperties) {
+/**
+ * @param compressEnums If true, the values of string-enums are compressed
+ * into the index of the value inside of the enum.
+ * This changes the stored format, so it is opt-in
+ * to keep already compressed data readable.
+ */
+function createCompressionTable(schema, compressionFlag, ignoreProperties, compressEnums) {
     if (compressionFlag === void 0) { compressionFlag = exports.DEFAULT_COMPRESSION_FLAG; }
     if (ignoreProperties === void 0) { ignoreProperties = []; }
+    if (compressEnums === void 0) { compressEnums = false; }
     var table = compressedToUncompressedTable(schema, ignoreProperties);
     var compressionTable = {
         compressedToUncompressed: table,
         uncompressedToCompressed: uncompressedToCompressedTable(table, compressionFlag, ignoreProperties),
         compressionFlag: compressionFlag
     };
+    if (compressEnums) {
+        var enumCompression = (0, enum_compression_1.getEnumCompressionTable)(schema, ignoreProperties);
+        /**
+         * The field stays undefined when there is nothing to compress,
+         * so that the compression does not have to look it up on each key.
+         */
+        if (enumCompression.size > 0) {
+            compressionTable.enumCompression = enumCompression;
+        }
+    }
     return compressionTable;
 }
-exports.createCompressionTable = createCompressionTable;
 /**
  * Returns a list of all property names that occur in the schema.
  * @returns Set of strings to ensure uniqueness.
  */
 function getPropertiesOfSchema(schema) {
     var ret = new Set();
-    function addSchema(innerSchema) {
-        var keys = getPropertiesOfSchema(innerSchema);
-        Array.from(keys).forEach(function (k) { return ret.add(k); });
-    }
-    if (schema.properties) {
+    addPropertiesOfSchema(schema, ret);
+    return ret;
+}
+/**
+ * Adds all property names of the schema to the given set.
+ * Using a single accumulator set avoids creating
+ * a new set and array copy on each nesting level.
+ */
+function addPropertiesOfSchema(schema, ret) {
+    var properties = schema.properties;
+    if (properties) {
         // do not use Object.entries, it is transpiled shitty
-        Object.keys(schema.properties).forEach(function (property) {
-            var deepSchema = schema.properties[property];
+        var propertyNames = Object.keys(properties);
+        for (var i = 0; i < propertyNames.length; i++) {
+            var property = propertyNames[i];
             ret.add(property);
-            if (!schema.properties) {
-                return;
-            }
-            addSchema(deepSchema);
-        });
+            addPropertiesOfSchema(properties[property], ret);
+        }
     }
-    if (schema.items) {
-        if (Array.isArray(schema.items)) {
-            schema.items.forEach(function (subSchema) {
-                addSchema(subSchema);
-            });
+    var items = schema.items;
+    if (items) {
+        if (Array.isArray(items)) {
+            for (var i = 0; i < items.length; i++) {
+                addPropertiesOfSchema(items[i], ret);
+            }
         }
         else {
-            addSchema(schema.items);
+            addPropertiesOfSchema(items, ret);
         }
     }
-    return ret;
 }
-exports.getPropertiesOfSchema = getPropertiesOfSchema;
 function compressedToUncompressedTable(schema, ignoreProperties) {
     var attributes = getPropertiesOfSchema(schema);
     var schemaKeysSorted = Array.from(attributes).sort(util_1.alphabeticCompare);
     var table = new Map();
     var lastKeyNumber = 0;
-    schemaKeysSorted
-        .filter(function (k) { return k.length > 3 && !ignoreProperties.includes(k); })
-        .forEach(function (k) {
-        var compressKey = (0, util_1.numberToLetter)(lastKeyNumber);
-        lastKeyNumber++;
-        table.set(k, compressKey);
-    });
+    for (var i = 0; i < schemaKeysSorted.length; i++) {
+        var k = schemaKeysSorted[i];
+        if (k.length > 3 && !ignoreProperties.includes(k)) {
+            table.set(k, (0, util_1.numberToLetter)(lastKeyNumber));
+            lastKeyNumber++;
+        }
+    }
     return table;
 }
-exports.compressedToUncompressedTable = compressedToUncompressedTable;
 function uncompressedToCompressedTable(table, compressionFlag, ignoreProperties) {
     var reverseTable = new Map();
-    Array.from(table.keys()).forEach(function (key) {
-        var value = table.get(key);
-        if (!ignoreProperties.includes(value)) {
+    table.forEach(function (value, key) {
+        /**
+         * The ignored properties are property names,
+         * so they must be compared to the key and not to the
+         * compressed value which could randomly be equal to an ignored name.
+         */
+        if (!ignoreProperties.includes(key)) {
             reverseTable.set(compressionFlag + value, key);
         }
     });
     return reverseTable;
 }
-exports.uncompressedToCompressedTable = uncompressedToCompressedTable;
 //# sourceMappingURL=create-compression-table.js.map

package/dist/lib/create-compression-table.js.map

@@ -1 +1 @@
-{"version":3,"file":"create-compression-table.js","sourceRoot":"","sources":["../../src/create-compression-table.ts"],"names":[],"mappings":";;;AAKA,+BAGgB;AAEhB;;;;;GAKG;AACU,QAAA,wBAAwB,GAAG,GAAG,CAAC;AAE5C,SAAgB,sBAAsB,CAClC,MAAkB,EAClB,eAAkD,EAClD,gBAA+B;IAD/B,gCAAA,EAAA,kBAA0B,gCAAwB;IAClD,iCAAA,EAAA,qBAA+B;IAE/B,IAAM,KAAK,GAAG,6BAA6B,CACvC,MAAM,EACN,gBAAgB,CACnB,CAAC;IACF,IAAM,gBAAgB,GAAqB;QACvC,wBAAwB,EAAE,KAAK;QAC/B,wBAAwB,EAAE,6BAA6B,CACnD,KAAK,EACL,eAAe,EACf,gBAAgB,CACnB;QACD,eAAe,iBAAA;KAClB,CAAC;IAEF,OAAO,gBAAgB,CAAC;AAC5B,CAAC;AApBD,wDAoBC;AAED;;;GAGG;AACH,SAAgB,qBAAqB,CAAC,MAAkB;IACpD,IAAM,GAAG,GAAgB,IAAI,GAAG,EAAE,CAAC;IAEnC,SAAS,SAAS,CAAC,WAAuB;QACtC,IAAM,IAAI,GAAG,qBAAqB,CAAC,WAAW,CAAC,CAAC;QAChD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,UAAA,CAAC,IAAI,OAAA,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAV,CAAU,CAAC,CAAC;IAC9C,CAAC;IAED,IAAI,MAAM,CAAC,UAAU,EAAE;QACnB,qDAAqD;QACrD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,UAAA,QAAQ;YAC3C,IAAM,UAAU,GAAI,MAAc,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YACxD,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAClB,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE;gBACpB,OAAO;aACV;YACD,SAAS,CAAC,UAAU,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;KACN;IAED,IAAI,MAAM,CAAC,KAAK,EAAE;QACd,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;YAC7B,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,UAAA,SAAS;gBAC1B,SAAS,CAAC,SAAS,CAAC,CAAC;YACzB,CAAC,CAAC,CAAC;SACN;aAAM;YACH,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;SAC3B;KACJ;IAED,OAAO,GAAG,CAAC;AACf,CAAC;AA/BD,sDA+BC;AAED,SAAgB,6BAA6B,CACzC,MAAkB,EAClB,gBAA0B;IAE1B,IAAM,UAAU,GAAgB,qBAAqB,CAAC,MAAM,CAAC,CAAC;IAC9D,IAAM,gBAAgB,GAAa,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,wBAAiB,CAAC,CAAC;IAClF,IAAM,KAAK,GAAc,IAAI,GAAG,EAAE,CAAC;IACnC,IAAI,aAAa,GAAW,CAAC,CAAC;IAC9B,gBAAgB;SACX,MAAM,CAAC,UAAA,CAAC,IAAI,OAAA,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAA7C,CAA6C,CAAC;SAC1D,OAAO,CAAC,UAAA,CAAC;QACN,IAAM,WAAW,GAAG,IAAA,qBAAc,EAAC,aAAa,CAAC,CAAC;QAClD,aAAa,EAAE,CAAC;QAChB,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IACP,OAAO,KAAK,CAAC;AACjB,CAAC;AAhBD,sEAgBC;AAED,SAAgB,6BAA6B,CACzC,KAAgB,EAChB,eAAuB,EACvB,gBAA0B;IAE1B,IAAM,YAAY,GAAc,IAAI,GAAG,EAAE,CAAC;IAC1C,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,UAAA,GAAG;QAChC,IAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAW,CAAC;QACvC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YACnC,YAAY,CAAC,GAAG,CAAC,eAAe,GAAG,KAAK,EAAE,GAAG,CAAC,CAAC;SAClD;IACL,CAAC,CAAC,CAAC;IACH,OAAO,YAAY,CAAC;AACxB,CAAC;AAbD,sEAaC"}
+{"version":3,"file":"create-compression-table.js","sourceRoot":"","sources":["../../src/create-compression-table.ts"],"names":[],"mappings":";;;AAyBA,wDAmCC;AAMD,sDAIC;AA+BD,sEAgBC;AAED,sEAiBC;AAnID,+BAGgB;AAChB,uDAA6D;AAE7D;;;;;GAKG;AACU,QAAA,wBAAwB,GAAG,GAAG,CAAC;AAE5C;;;;;GAKG;AACH,SAAgB,sBAAsB,CAClC,MAAkB,EAClB,eAAkD,EAClD,gBAA+B,EAC/B,aAA8B;IAF9B,gCAAA,EAAA,kBAA0B,gCAAwB;IAClD,iCAAA,EAAA,qBAA+B;IAC/B,8BAAA,EAAA,qBAA8B;IAE9B,IAAM,KAAK,GAAG,6BAA6B,CACvC,MAAM,EACN,gBAAgB,CACnB,CAAC;IACF,IAAM,gBAAgB,GAAqB;QACvC,wBAAwB,EAAE,KAAK;QAC/B,wBAAwB,EAAE,6BAA6B,CACnD,KAAK,EACL,eAAe,EACf,gBAAgB,CACnB;QACD,eAAe,iBAAA;KAClB,CAAC;IAEF,IAAI,aAAa,EAAE,CAAC;QAChB,IAAM,eAAe,GAAG,IAAA,0CAAuB,EAC3C,MAAM,EACN,gBAAgB,CACnB,CAAC;QACF;;;WAGG;QACH,IAAI,eAAe,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC3B,gBAAgB,CAAC,eAAe,GAAG,eAAe,CAAC;QACvD,CAAC;IACL,CAAC;IAED,OAAO,gBAAgB,CAAC;AAC5B,CAAC;AAED;;;GAGG;AACH,SAAgB,qBAAqB,CAAC,MAAkB;IACpD,IAAM,GAAG,GAAgB,IAAI,GAAG,EAAE,CAAC;IACnC,qBAAqB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACnC,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,SAAS,qBAAqB,CAAC,MAAkB,EAAE,GAAgB;IAC/D,IAAM,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC;IACrC,IAAI,UAAU,EAAE,CAAC;QACb,qDAAqD;QACrD,IAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,IAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAW,CAAC;YAC5C,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAClB,qBAAqB,CAAC,UAAU,CAAC,QAAQ,CAAe,EAAE,GAAG,CAAC,CAAC;QACnE,CAAC;IACL,CAAC;IAED,IAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;IAC3B,IAAI,KAAK,EAAE,CAAC;QACR,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,qBAAqB,CAAC,KAAK,CAAC,CAAC,CAAe,EAAE,GAAG,CAAC,CAAC;YACvD,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,qBAAqB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACtC,CAAC;IACL,CAAC;AACL,CAAC;AAED,SAAgB,6BAA6B,CACzC,MAAkB,EAClB,gBAA0B;IAE1B,IAAM,UAAU,GAAgB,qBAAqB,CAAC,MAAM,CAAC,CAAC;IAC9D,IAAM,gBAAgB,GAAa,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,wBAAiB,CAAC,CAAC;IAClF,IAAM,KAAK,GAAc,IAAI,GAAG,EAAE,CAAC;IACnC,IAAI,aAAa,GAAW,CAAC,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/C,IAAM,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAW,CAAC;QACxC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YAChD,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAA,qBAAc,EAAC,aAAa,CAAC,CAAC,CAAC;YAC5C,aAAa,EAAE,CAAC;QACpB,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED,SAAgB,6BAA6B,CACzC,KAAgB,EAChB,eAAuB,EACvB,gBAA0B;IAE1B,IAAM,YAAY,GAAc,IAAI,GAAG,EAAE,CAAC;IAC1C,KAAK,CAAC,OAAO,CAAC,UAAC,KAAK,EAAE,GAAG;QACrB;;;;WAIG;QACH,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAClC,YAAY,CAAC,GAAG,CAAC,eAAe,GAAG,KAAK,EAAE,GAAG,CAAC,CAAC;QACnD,CAAC;IACL,CAAC,CAAC,CAAC;IACH,OAAO,YAAY,CAAC;AACxB,CAAC"}

package/dist/lib/decompress.js

@@ -1,25 +1,43 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.decompressedKey = exports.decompressedPath = exports.decompressObject = void 0;
+exports.decompressObject = decompressObject;
+exports.decompressedPath = decompressedPath;
+exports.decompressedKey = decompressedKey;
+var enum_compression_1 = require("./enum-compression");
 function decompressObject(table, obj) {
     if (typeof obj !== 'object' || obj === null)
         return obj;
-    else if (Array.isArray(obj)) {
+    if (Array.isArray(obj)) {
         // array
-        return obj.map(function (item) { return decompressObject(table, item); });
+        var retArray = new Array(obj.length);
+        for (var index = 0; index < obj.length; index++) {
+            var item = obj[index];
+            // primitives do not need a recursive call
+            retArray[index] = (typeof item === 'object' && item !== null) ? decompressObject(table, item) : item;
+        }
+        return retArray;
     }
-    else {
-        // object
-        var ret_1 = {};
-        Object.keys(obj).forEach(function (key) {
-            var decompressed = decompressedKey(table, key);
-            var value = decompressObject(table, obj[key]);
-            ret_1[decompressed] = value;
-        });
-        return ret_1;
+    // object
+    var ret = {};
+    var keys = Object.keys(obj);
+    var enumCompression = table.enumCompression;
+    for (var index = 0; index < keys.length; index++) {
+        var key = keys[index];
+        var value = obj[key];
+        var decompressed = decompressedKey(table, key);
+        var enumValues = enumCompression && enumCompression.get(decompressed);
+        if (enumValues && (typeof value === 'number' || Array.isArray(value))) {
+            ret[decompressed] = (0, enum_compression_1.decompressEnumValue)(enumValues, value);
+        }
+        else {
+            // primitives do not need a recursive call
+            ret[decompressed] = (typeof value === 'object' && value !== null) ?
+                decompressObject(table, value) :
+                value;
+        }
     }
+    return ret;
 }
-exports.decompressObject = decompressObject;
 /**
  * transform a compressed object-path
  * into its non-compressed version
@@ -35,22 +53,23 @@ function decompressedPath(table, path) {
         return compressedKey;
     }).join('.');
 }
-exports.decompressedPath = decompressedPath;
 function decompressedKey(table, key) {
     /**
-        * keys could be array-accessors like myArray[4]
-        * we have to split and readd the squared brackets value
-        */
-    var splitSquaredBrackets = key.split('[');
-    key = splitSquaredBrackets.shift();
-    var decompressed = table.uncompressedToCompressed.get(key);
+     * keys could be array-accessors like myArray[4]
+     * so the part before the squared bracket is looked up
+     * and the bracket part is re-added.
+     * Most keys have no bracket, so the plain lookup is the fast path.
+     */
+    var bracketIndex = key.indexOf('[');
+    if (bracketIndex === -1) {
+        var directDecompressed = table.uncompressedToCompressed.get(key);
+        return directDecompressed ? directDecompressed : key;
+    }
+    var plainKey = key.slice(0, bracketIndex);
+    var decompressed = table.uncompressedToCompressed.get(plainKey);
     if (!decompressed) {
         return key;
     }
-    else {
-        var readdSquared = splitSquaredBrackets.length ? '[' + splitSquaredBrackets.join('[') : '';
-        return decompressed + readdSquared;
-    }
+    return decompressed + key.slice(bracketIndex);
 }
-exports.decompressedKey = decompressedKey;
 //# sourceMappingURL=decompress.js.map

package/dist/lib/decompress.js.map

@@ -1 +1 @@
-{"version":3,"file":"decompress.js","sourceRoot":"","sources":["../../src/decompress.ts"],"names":[],"mappings":";;;AAKA,SAAgB,gBAAgB,CAC5B,KAAuB,EACvB,GAAoB;IAEpB,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,GAAG,CAAC;SACnD,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;QACzB,QAAQ;QACR,OAAO,GAAG,CAAC,GAAG,CAAC,UAAA,IAAI,IAAI,OAAA,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,EAA7B,CAA6B,CAAC,CAAC;KACzD;SAAM;QACH,SAAS;QACT,IAAM,KAAG,GAAoB,EAAE,CAAC;QAChC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,UAAA,GAAG;YACxB,IAAM,YAAY,GAAG,eAAe,CAChC,KAAK,EACL,GAAG,CACN,CAAC;YACF,IAAM,KAAK,GAAG,gBAAgB,CAC1B,KAAK,EACL,GAAG,CAAC,GAAG,CAAC,CACX,CAAC;YACF,KAAG,CAAC,YAAY,CAAC,GAAG,KAAK,CAAC;QAC9B,CAAC,CAAC,CAAC;QACH,OAAO,KAAG,CAAC;KACd;AACL,CAAC;AAxBD,4CAwBC;AAED;;;;;;GAMG;AACH,SAAgB,gBAAgB,CAC5B,KAAuB,EACvB,IAAY;IAEZ,IAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACjC,OAAO,QAAQ;SACV,GAAG,CAAC,UAAA,MAAM;QACP,IAAM,aAAa,GAAG,eAAe,CACjC,KAAK,EACL,MAAM,CACT,CAAC;QACF,OAAO,aAAa,CAAC;IACzB,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACrB,CAAC;AAbD,4CAaC;AAED,SAAgB,eAAe,CAC3B,KAAuB,EACvB,GAAW;IAGX;;;UAGM;IACN,IAAM,oBAAoB,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC5C,GAAG,GAAG,oBAAoB,CAAC,KAAK,EAAY,CAAC;IAE7C,IAAM,YAAY,GAAG,KAAK,CAAC,wBAAwB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7D,IAAI,CAAC,YAAY,EAAE;QACf,OAAO,GAAG,CAAC;KACd;SAAM;QACH,IAAM,YAAY,GAAG,oBAAoB,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,oBAAoB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7F,OAAO,YAAY,GAAG,YAAY,CAAC;KACtC;AACL,CAAC;AAnBD,0CAmBC"}
+{"version":3,"file":"decompress.js","sourceRoot":"","sources":["../../src/decompress.ts"],"names":[],"mappings":";;AAOA,4CAkCC;AASD,4CAaC;AAED,0CAsBC;AAlFD,uDAAyD;AAEzD,SAAgB,gBAAgB,CAC5B,KAAuB,EACvB,GAAoB;IAEpB,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,GAAG,CAAC;IACxD,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACrB,QAAQ;QACR,IAAM,QAAQ,GAA8B,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAClE,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,GAAG,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;YAC9C,IAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;YACxB,0CAA0C;YAC1C,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;QAChH,CAAC;QACD,OAAO,QAAQ,CAAC;IACpB,CAAC;IACD,SAAS;IACT,IAAM,GAAG,GAA4B,EAAE,CAAC;IACxC,IAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC9B,IAAM,eAAe,GAAG,KAAK,CAAC,eAAe,CAAC;IAC9C,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QAC/C,IAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAW,CAAC;QAClC,IAAM,KAAK,GAAI,GAA+B,CAAC,GAAG,CAAC,CAAC;QACpD,IAAM,YAAY,GAAG,eAAe,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACjD,IAAM,UAAU,GAAG,eAAe,IAAI,eAAe,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QACxE,IAAI,UAAU,IAAI,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACpE,GAAG,CAAC,YAAY,CAAC,GAAG,IAAA,sCAAmB,EAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC/D,CAAC;aAAM,CAAC;YACJ,0CAA0C;YAC1C,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC;gBAC/D,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;gBAChC,KAAK,CAAC;QACd,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,gBAAgB,CAC5B,KAAuB,EACvB,IAAY;IAEZ,IAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACjC,OAAO,QAAQ;SACV,GAAG,CAAC,UAAA,MAAM;QACP,IAAM,aAAa,GAAG,eAAe,CACjC,KAAK,EACL,MAAM,CACT,CAAC;QACF,OAAO,aAAa,CAAC;IACzB,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACrB,CAAC;AAED,SAAgB,eAAe,CAC3B,KAAuB,EACvB,GAAW;IAGX;;;;;OAKG;IACH,IAAM,YAAY,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACtC,IAAI,YAAY,KAAK,CAAC,CAAC,EAAE,CAAC;QACtB,IAAM,kBAAkB,GAAG,KAAK,CAAC,wBAAwB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnE,OAAO,kBAAkB,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,GAAG,CAAC;IACzD,CAAC;IACD,IAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;IAC5C,IAAM,YAAY,GAAG,KAAK,CAAC,wBAAwB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAClE,IAAI,CAAC,YAAY,EAAE,CAAC;QAChB,OAAO,GAAG,CAAC;IACf,CAAC;IACD,OAAO,YAAY,GAAG,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;AAClD,CAAC"}

package/dist/lib/enum-compression.d.ts

@@ -0,0 +1,35 @@
+import type { EnumCompressionTable, JsonSchema } from './types';
+/**
+ * Enum-compression replaces the value of a property
+ * by the index of that value inside of the enum of the property.
+ * For example with the enum ['admin', 'editor', 'viewer']
+ * the value 'editor' is stored as the number 1.
+ *
+ * Only enums where all values are strings can be compressed:
+ * - The compressed value is a number, so a number inside of the enum
+ *   could not be told apart from an index.
+ * - Strings are also where the saved space actually is.
+ *
+ * The values are sorted before the indexes are assigned, so that the order
+ * of the indexes is equal to the alphabetic order of the values.
+ * This keeps sorting and range-queries like $gt working on compressed data.
+ */
+export declare function compressibleEnumValues(values: any[]): string[] | null;
+/**
+ * Creates the table that maps a property name to the enum of its values.
+ * A property name is only compressed when it has the same compressible enum
+ * at every place where it occurs in the schema. Otherwise the same value
+ * could mean different things depending on where it is stored.
+ */
+export declare function getEnumCompressionTable(schema: JsonSchema, ignoreProperties: string[]): EnumCompressionTable;
+/**
+ * Replaces the enum-value by its index.
+ * Values that are not part of the enum are kept as they are,
+ * so that data which does not match the schema is not destroyed.
+ */
+export declare function compressEnumValue(enumValues: string[], value: any): any;
+/**
+ * Replaces the index by its enum-value.
+ * The exact counterpart of compressEnumValue().
+ */
+export declare function decompressEnumValue(enumValues: string[], value: any): any;

package/dist/lib/enum-compression.js

@@ -0,0 +1,223 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.compressibleEnumValues = compressibleEnumValues;
+exports.getEnumCompressionTable = getEnumCompressionTable;
+exports.compressEnumValue = compressEnumValue;
+exports.decompressEnumValue = decompressEnumValue;
+var util_1 = require("./util");
+/**
+ * Enum-compression replaces the value of a property
+ * by the index of that value inside of the enum of the property.
+ * For example with the enum ['admin', 'editor', 'viewer']
+ * the value 'editor' is stored as the number 1.
+ *
+ * Only enums where all values are strings can be compressed:
+ * - The compressed value is a number, so a number inside of the enum
+ *   could not be told apart from an index.
+ * - Strings are also where the saved space actually is.
+ *
+ * The values are sorted before the indexes are assigned, so that the order
+ * of the indexes is equal to the alphabetic order of the values.
+ * This keeps sorting and range-queries like $gt working on compressed data.
+ */
+function compressibleEnumValues(values) {
+    if (values.length === 0) {
+        return null;
+    }
+    var unique = [];
+    for (var i = 0; i < values.length; i++) {
+        var value = values[i];
+        if (typeof value !== 'string') {
+            return null;
+        }
+        if (!unique.includes(value)) {
+            unique.push(value);
+        }
+    }
+    return unique.sort(util_1.alphabeticCompare);
+}
+/**
+ * Returns the enum that applies to the values which are stored
+ * at a property, or null if the property has no compressible enum.
+ * The enum can either be defined at the property itself,
+ * or at the items of an array-property.
+ */
+function valueEnumOfSchema(schema) {
+    if (Array.isArray(schema.enum)) {
+        return compressibleEnumValues(schema.enum);
+    }
+    var items = schema.items;
+    if (items && !Array.isArray(items) && Array.isArray(items.enum)) {
+        return compressibleEnumValues(items.enum);
+    }
+    return null;
+}
+function equalEnumValues(a, b) {
+    if (a.length !== b.length) {
+        return false;
+    }
+    for (var i = 0; i < a.length; i++) {
+        if (a[i] !== b[i]) {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * Collects the enum of each property name for every place
+ * where the name occurs in the schema.
+ * All sub-schema keywords are walked, not only the ones that
+ * the key-compression uses, so that a property name which is used
+ * with different enums is detected as ambiguous.
+ * @recursive
+ */
+function addEnumCandidates(schema, candidates) {
+    var properties = schema.properties;
+    if (properties) {
+        // do not use Object.entries, it is transpiled shitty
+        var propertyNames = Object.keys(properties);
+        for (var i = 0; i < propertyNames.length; i++) {
+            var property = propertyNames[i];
+            var subSchema = properties[property];
+            var found = candidates.get(property);
+            if (!found) {
+                found = [];
+                candidates.set(property, found);
+            }
+            found.push(valueEnumOfSchema(subSchema));
+            addEnumCandidates(subSchema, candidates);
+        }
+    }
+    var items = schema.items;
+    if (items) {
+        if (Array.isArray(items)) {
+            for (var i = 0; i < items.length; i++) {
+                addEnumCandidates(items[i], candidates);
+            }
+        }
+        else {
+            addEnumCandidates(items, candidates);
+        }
+    }
+    if (schema.additionalItems && typeof schema.additionalItems === 'object') {
+        addEnumCandidates(schema.additionalItems, candidates);
+    }
+    var subSchemaLists = [schema.allOf, schema.anyOf, schema.oneOf];
+    for (var i = 0; i < subSchemaLists.length; i++) {
+        var subSchemas = subSchemaLists[i];
+        if (subSchemas) {
+            for (var j = 0; j < subSchemas.length; j++) {
+                addEnumCandidates(subSchemas[j], candidates);
+            }
+        }
+    }
+    if (schema.not) {
+        addEnumCandidates(schema.not, candidates);
+    }
+    var subSchemaMaps = [schema.patternProperties, schema.definitions];
+    var _loop_1 = function (i) {
+        var schemaMap = subSchemaMaps[i];
+        if (schemaMap) {
+            Object.keys(schemaMap).forEach(function (key) { return addEnumCandidates(schemaMap[key], candidates); });
+        }
+    };
+    for (var i = 0; i < subSchemaMaps.length; i++) {
+        _loop_1(i);
+    }
+    var dependencies = schema.dependencies;
+    if (dependencies) {
+        Object.keys(dependencies).forEach(function (key) {
+            var dependency = dependencies[key];
+            if (!Array.isArray(dependency)) {
+                addEnumCandidates(dependency, candidates);
+            }
+        });
+    }
+}
+/**
+ * Creates the table that maps a property name to the enum of its values.
+ * A property name is only compressed when it has the same compressible enum
+ * at every place where it occurs in the schema. Otherwise the same value
+ * could mean different things depending on where it is stored.
+ */
+function getEnumCompressionTable(schema, ignoreProperties) {
+    var candidates = new Map();
+    addEnumCandidates(schema, candidates);
+    var table = new Map();
+    var propertyNames = Array.from(candidates.keys()).sort(util_1.alphabeticCompare);
+    for (var i = 0; i < propertyNames.length; i++) {
+        var property = propertyNames[i];
+        if (ignoreProperties.includes(property)) {
+            continue;
+        }
+        var occurrences = candidates.get(property);
+        var first = occurrences[0];
+        if (!first) {
+            continue;
+        }
+        var isAmbiguous = false;
+        for (var j = 1; j < occurrences.length; j++) {
+            var other = occurrences[j];
+            if (!other || !equalEnumValues(first, other)) {
+                isAmbiguous = true;
+                break;
+            }
+        }
+        if (!isAmbiguous) {
+            table.set(property, first);
+        }
+    }
+    return table;
+}
+/**
+ * Returns true if the given number can be an index of the enum.
+ * Number.isInteger() is not used to stay usable on old runtimes.
+ */
+function isEnumIndex(value, enumValues) {
+    return value >= 0 && value < enumValues.length && value % 1 === 0;
+}
+/**
+ * Replaces the enum-value by its index.
+ * Values that are not part of the enum are kept as they are,
+ * so that data which does not match the schema is not destroyed.
+ */
+function compressEnumValue(enumValues, value) {
+    if (typeof value === 'string') {
+        var index = enumValues.indexOf(value);
+        return index === -1 ? value : index;
+    }
+    if (Array.isArray(value)) {
+        var ret = new Array(value.length);
+        for (var i = 0; i < value.length; i++) {
+            var item = value[i];
+            if (typeof item === 'string') {
+                var index = enumValues.indexOf(item);
+                ret[i] = index === -1 ? item : index;
+            }
+            else {
+                ret[i] = item;
+            }
+        }
+        return ret;
+    }
+    return value;
+}
+/**
+ * Replaces the index by its enum-value.
+ * The exact counterpart of compressEnumValue().
+ */
+function decompressEnumValue(enumValues, value) {
+    if (typeof value === 'number') {
+        return isEnumIndex(value, enumValues) ? enumValues[value] : value;
+    }
+    if (Array.isArray(value)) {
+        var ret = new Array(value.length);
+        for (var i = 0; i < value.length; i++) {
+            var item = value[i];
+            ret[i] = (typeof item === 'number' && isEnumIndex(item, enumValues)) ? enumValues[item] : item;
+        }
+        return ret;
+    }
+    return value;
+}
+//# sourceMappingURL=enum-compression.js.map

package/dist/lib/enum-compression.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"enum-compression.js","sourceRoot":"","sources":["../../src/enum-compression.ts"],"names":[],"mappings":";;AAqBA,wDAeC;AAgHD,0DAgCC;AAeD,8CAsBC;AAMD,kDAgBC;AA3OD,+BAA2C;AAE3C;;;;;;;;;;;;;;GAcG;AACH,SAAgB,sBAAsB,CAAC,MAAa;IAChD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,IAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,IAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC5B,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC,IAAI,CAAC,wBAAiB,CAAC,CAAC;AAC1C,CAAC;AAED;;;;;GAKG;AACH,SAAS,iBAAiB,CAAC,MAAkB;IACzC,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7B,OAAO,sBAAsB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC/C,CAAC;IACD,IAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;IAC3B,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9D,OAAO,sBAAsB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC;AAED,SAAS,eAAe,CAAC,CAAW,EAAE,CAAW;IAC7C,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QACxB,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAChB,OAAO,KAAK,CAAC;QACjB,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,iBAAiB,CACtB,MAAkB,EAClB,UAA4C;IAE5C,IAAM,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC;IACrC,IAAI,UAAU,EAAE,CAAC;QACb,qDAAqD;QACrD,IAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,IAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAW,CAAC;YAC5C,IAAM,SAAS,GAAG,UAAU,CAAC,QAAQ,CAAe,CAAC;YACrD,IAAI,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACrC,IAAI,CAAC,KAAK,EAAE,CAAC;gBACT,KAAK,GAAG,EAAE,CAAC;gBACX,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YACpC,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC,CAAC;YACzC,iBAAiB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;QAC7C,CAAC;IACL,CAAC;IAED,IAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;IAC3B,IAAI,KAAK,EAAE,CAAC;QACR,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAe,EAAE,UAAU,CAAC,CAAC;YAC1D,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,iBAAiB,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QACzC,CAAC;IACL,CAAC;IACD,IAAI,MAAM,CAAC,eAAe,IAAI,OAAO,MAAM,CAAC,eAAe,KAAK,QAAQ,EAAE,CAAC;QACvE,iBAAiB,CAAC,MAAM,CAAC,eAAe,EAAE,UAAU,CAAC,CAAC;IAC1D,CAAC;IAED,IAAM,cAAc,GAAiC,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;IAChG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,IAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QACrC,IAAI,UAAU,EAAE,CAAC;YACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAe,EAAE,UAAU,CAAC,CAAC;YAC/D,CAAC;QACL,CAAC;IACL,CAAC;IACD,IAAI,MAAM,CAAC,GAAG,EAAE,CAAC;QACb,iBAAiB,CAAC,MAAM,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;IAC9C,CAAC;IAED,IAAM,aAAa,GAAgD,CAAC,MAAM,CAAC,iBAAiB,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;4BACzG,CAAC;QACN,IAAM,SAAS,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QACnC,IAAI,SAAS,EAAE,CAAC;YACZ,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,UAAA,GAAG,IAAI,OAAA,iBAAiB,CAAC,SAAS,CAAC,GAAG,CAAe,EAAE,UAAU,CAAC,EAA3D,CAA2D,CAAC,CAAC;QACvG,CAAC;;IAJL,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE;gBAApC,CAAC;KAKT;IAED,IAAM,YAAY,GAAG,MAAM,CAAC,YAAY,CAAC;IACzC,IAAI,YAAY,EAAE,CAAC;QACf,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,UAAA,GAAG;YACjC,IAAM,UAAU,GAAG,YAAY,CAAC,GAAG,CAA0B,CAAC;YAC9D,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC7B,iBAAiB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YAC9C,CAAC;QACL,CAAC,CAAC,CAAC;IACP,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,SAAgB,uBAAuB,CACnC,MAAkB,EAClB,gBAA0B;IAE1B,IAAM,UAAU,GAAqC,IAAI,GAAG,EAAE,CAAC;IAC/D,iBAAiB,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IAEtC,IAAM,KAAK,GAAyB,IAAI,GAAG,EAAE,CAAC;IAC9C,IAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,wBAAiB,CAAC,CAAC;IAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,IAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAW,CAAC;QAC5C,IAAI,gBAAgB,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;YACtC,SAAS;QACb,CAAC;QACD,IAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAwB,CAAC;QACpE,IAAM,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,CAAC,KAAK,EAAE,CAAC;YACT,SAAS;QACb,CAAC;QACD,IAAI,WAAW,GAAG,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAM,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,KAAK,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC3C,WAAW,GAAG,IAAI,CAAC;gBACnB,MAAM;YACV,CAAC;QACL,CAAC;QACD,IAAI,CAAC,WAAW,EAAE,CAAC;YACf,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QAC/B,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,SAAS,WAAW,CAAC,KAAa,EAAE,UAAoB;IACpD,OAAO,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,UAAU,CAAC,MAAM,IAAI,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;AACtE,CAAC;AAED;;;;GAIG;AACH,SAAgB,iBAAiB,CAC7B,UAAoB,EACpB,KAAU;IAEV,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC5B,IAAM,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACxC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;IACxC,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACvB,IAAM,GAAG,GAAU,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC3B,IAAM,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBACvC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;YACzC,CAAC;iBAAM,CAAC;gBACJ,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YAClB,CAAC;QACL,CAAC;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,SAAgB,mBAAmB,CAC/B,UAAoB,EACpB,KAAU;IAEV,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC5B,OAAO,WAAW,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IACtE,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACvB,IAAM,GAAG,GAAU,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,IAAI,KAAK,QAAQ,IAAI,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACnG,CAAC;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC"}

package/dist/lib/index.d.ts

@@ -1,4 +1,4 @@
-export type { TableType, CompressionTable, PlainJsonObjectNotArray, PlainJsonObject, SortDirection, MangoQuery, JsonSchemaTypes, JsonSchema } from './types';
+export type { TableType, CompressionTable, EnumCompressionTable, PlainJsonObjectNotArray, PlainJsonObject, SortDirection, MangoQuery, JsonSchemaTypes, JsonSchema } from './types';
 export { createCompressionTable, DEFAULT_COMPRESSION_FLAG } from './create-compression-table';
 export { compressObject, compressedPath, compressQuerySelector, compressQuery } from './compress';
 export { decompressObject, decompressedPath, } from './decompress';

package/dist/lib/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;AAWA,uEAGoC;AAFhC,kIAAA,sBAAsB,OAAA;AACtB,oIAAA,wBAAwB,OAAA;AAG5B,uCAKoB;AAJhB,0GAAA,cAAc,OAAA;AACd,0GAAA,cAAc,OAAA;AACd,iHAAA,qBAAqB,OAAA;AACrB,yGAAA,aAAa,OAAA;AAGjB,2CAGsB;AAFlB,8GAAA,gBAAgB,OAAA;AAChB,8GAAA,gBAAgB,OAAA;AAGpB,iFAEyC;AADrC,2IAAA,0BAA0B,OAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;AAYA,uEAGoC;AAFhC,kIAAA,sBAAsB,OAAA;AACtB,oIAAA,wBAAwB,OAAA;AAG5B,uCAKoB;AAJhB,0GAAA,cAAc,OAAA;AACd,0GAAA,cAAc,OAAA;AACd,iHAAA,qBAAqB,OAAA;AACrB,yGAAA,aAAa,OAAA;AAGjB,2CAGsB;AAFlB,8GAAA,gBAAgB,OAAA;AAChB,8GAAA,gBAAgB,OAAA;AAGpB,iFAEyC;AADrC,2IAAA,0BAA0B,OAAA"}

package/dist/lib/types.d.ts

@@ -1,9 +1,20 @@
 export type TableType = Map<string, string>;
 
+/**
+ * Maps a property name to the sorted enum-values of that property.
+ * A value is compressed by replacing it with its index in this list.
+ */
+export type EnumCompressionTable = Map<string, string[]>;
+
 export type CompressionTable = {
     compressedToUncompressed: TableType;
     uncompressedToCompressed: TableType;
     compressionFlag: string;
+    /**
+     * Only set when enum-compression is enabled
+     * and the schema has at least one compressible enum.
+     */
+    enumCompression?: EnumCompressionTable;
 };
 
 

package/dist/lib/util.d.ts

@@ -3,7 +3,7 @@
  * @link https://github.com/matthewmueller/number-to-letter/blob/master/index.js
  */
 export declare function numberToLetter(nr: number): string;
-export declare type SortComparator<T = any> = (a: T, y: T) => -1 | 1 | 0;
+export type SortComparator<T = any> = (a: T, y: T) => -1 | 1 | 0;
 export declare const alphabeticCompare: SortComparator;
 /**
  * does a flat copy on the objects,

package/dist/lib/util.js

@@ -1,6 +1,8 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.flatClone = exports.alphabeticCompare = exports.numberToLetter = void 0;
+exports.alphabeticCompare = void 0;
+exports.numberToLetter = numberToLetter;
+exports.flatClone = flatClone;
 /**
  * @link https://de.wikipedia.org/wiki/Base58
  * this does not start with the numbers to generate valid variable-names
@@ -23,7 +25,6 @@ function numberToLetter(nr) {
         .map(function (d) { return base58Chars[d]; })
         .join('');
 }
-exports.numberToLetter = numberToLetter;
 var alphabeticCompare = function (a, b) {
     if (a < b) {
         return -1;
@@ -42,5 +43,4 @@ exports.alphabeticCompare = alphabeticCompare;
 function flatClone(obj) {
     return Object.assign({}, obj);
 }
-exports.flatClone = flatClone;
 //# sourceMappingURL=util.js.map

package/dist/lib/util.js.map

@@ -1 +1 @@
-{"version":3,"file":"util.js","sourceRoot":"","sources":["../../src/util.ts"],"names":[],"mappings":";;;AAAA;;;GAGG;AACH,IAAM,WAAW,GAAG,4DAA4D,CAAC;AACjF,IAAM,YAAY,GAAG,WAAW,CAAC,MAAM,CAAC;AAExC;;;GAGG;AACH,SAAgB,cAAc,CAAC,EAAU;IACrC,IAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,GAAG;QACC,IAAM,CAAC,GAAG,EAAE,GAAG,YAAY,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACf,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,YAAY,CAAC,CAAC;KACtC,QAAQ,EAAE,EAAE,GAAG,CAAC,EAAE;IAEnB,OAAO,MAAM;SACR,OAAO,EAAE;SACT,GAAG,CAAC,UAAA,CAAC,IAAI,OAAA,WAAW,CAAC,CAAC,CAAC,EAAd,CAAc,CAAC;SACxB,IAAI,CAAC,EAAE,CAAC,CAAC;AAClB,CAAC;AAZD,wCAYC;AAIM,IAAM,iBAAiB,GAAmB,UAAC,CAAC,EAAE,CAAC;IAClD,IAAI,CAAC,GAAG,CAAC,EAAE;QACP,OAAO,CAAC,CAAC,CAAC;KACb;IACD,IAAI,CAAC,GAAG,CAAC,EAAE;QACP,OAAO,CAAC,CAAC;KACZ;IACD,OAAO,CAAC,CAAC;AACb,CAAC,CAAC;AARW,QAAA,iBAAiB,qBAQ5B;AAEF;;;;GAIG;AACH,SAAgB,SAAS,CAAI,GAAM;IAC/B,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;AAClC,CAAC;AAFD,8BAEC"}
+{"version":3,"file":"util.js","sourceRoot":"","sources":["../../src/util.ts"],"names":[],"mappings":";;;AAWA,wCAYC;AAmBD,8BAEC;AA5CD;;;GAGG;AACH,IAAM,WAAW,GAAG,4DAA4D,CAAC;AACjF,IAAM,YAAY,GAAG,WAAW,CAAC,MAAM,CAAC;AAExC;;;GAGG;AACH,SAAgB,cAAc,CAAC,EAAU;IACrC,IAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,GAAG,CAAC;QACA,IAAM,CAAC,GAAG,EAAE,GAAG,YAAY,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACf,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,YAAY,CAAC,CAAC;IACvC,CAAC,QAAQ,EAAE,EAAE,GAAG,CAAC,EAAE;IAEnB,OAAO,MAAM;SACR,OAAO,EAAE;SACT,GAAG,CAAC,UAAA,CAAC,IAAI,OAAA,WAAW,CAAC,CAAC,CAAC,EAAd,CAAc,CAAC;SACxB,IAAI,CAAC,EAAE,CAAC,CAAC;AAClB,CAAC;AAIM,IAAM,iBAAiB,GAAmB,UAAC,CAAC,EAAE,CAAC;IAClD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACR,OAAO,CAAC,CAAC,CAAC;IACd,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACR,OAAO,CAAC,CAAC;IACb,CAAC;IACD,OAAO,CAAC,CAAC;AACb,CAAC,CAAC;AARW,QAAA,iBAAiB,qBAQ5B;AAEF;;;;GAIG;AACH,SAAgB,SAAS,CAAI,GAAM;IAC/B,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;AAClC,CAAC"}