@loaders.gl/parquet 3.3.0-alpha.5 → 3.3.0-alpha.7

package/dist/es5/parquetjs/schema/shred.js

@@ -1,40 +1,29 @@
 "use strict";
 
 var _typeof = require("@babel/runtime/helpers/typeof");
-
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.shredBuffer = shredBuffer;
-exports.shredRecord = shredRecord;
-exports.materializeRecords = materializeRecords;
 Object.defineProperty(exports, "ParquetBuffer", {
   enumerable: true,
   get: function get() {
     return _declare.ParquetBuffer;
   }
 });
-
+exports.materializeRecords = materializeRecords;
+exports.shredBuffer = shredBuffer;
+exports.shredRecord = shredRecord;
 var _declare = require("./declare");
-
 var Types = _interopRequireWildcard(require("./types"));
-
 function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
-
 function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || _typeof(obj) !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
-
 function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
-
 function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
-
 function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
-
 function shredBuffer(schema) {
   var columnData = {};
-
   var _iterator = _createForOfIteratorHelper(schema.fieldList),
-      _step;
-
+    _step;
   try {
     for (_iterator.s(); !(_step = _iterator.n()).done;) {
       var field = _step.value;
@@ -51,7 +40,6 @@ function shredBuffer(schema) {
   } finally {
     _iterator.f();
   }
-
   return {
     rowCount: 0,
     columnData: columnData
@@ -67,12 +55,9 @@ function shredRecord(schema, record, buffer) {
     buffer.columnData = data;
     return;
   }
-
   buffer.rowCount += 1;
-
   var _iterator2 = _createForOfIteratorHelper(schema.fieldList),
-      _step2;
-
+    _step2;
   try {
     for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
       var field = _step2.value;
@@ -91,8 +76,8 @@ function shredRecord(schema, record, buffer) {
 function shredRecordFields(fields, record, data, rLevel, dLevel) {
   for (var name in fields) {
     var field = fields[name];
-    var values = [];
 
+    var values = [];
     if (record && field.name in record && record[field.name] !== undefined && record[field.name] !== null) {
       if (record[field.name].constructor === Array) {
         values = record[field.name];
@@ -100,11 +85,9 @@ function shredRecordFields(fields, record, data, rLevel, dLevel) {
         values.push(record[field.name]);
       }
     }
-
     if (values.length === 0 && Boolean(record) && field.repetitionType === 'REQUIRED') {
       throw new Error("missing required field: ".concat(field.name));
     }
-
     if (values.length > 1 && field.repetitionType !== 'REPEATED') {
       throw new Error("too many values for field: ".concat(field.name));
     }
@@ -117,13 +100,11 @@ function shredRecordFields(fields, record, data, rLevel, dLevel) {
         data[field.key].rlevels.push(rLevel);
         data[field.key].dlevels.push(dLevel);
       }
-
       continue;
     }
 
     for (var i = 0; i < values.length; i++) {
       var rlvl = i === 0 ? rLevel : field.rLevelMax;
-
       if (field.isNested) {
         shredRecordFields(field.fields, values[i], data, rlvl, field.dLevelMax);
       } else {
@@ -138,15 +119,12 @@ function shredRecordFields(fields, record, data, rLevel, dLevel) {
 
 function materializeRecords(schema, buffer) {
   var records = [];
-
   for (var i = 0; i < buffer.rowCount; i++) {
     records.push({});
   }
-
   for (var key in buffer.columnData) {
     materializeColumn(schema, buffer, key, records);
   }
-
   return records;
 }
 
@@ -155,9 +133,9 @@ function materializeColumn(schema, buffer, key, records) {
   if (!data.count) return;
   var field = schema.findField(key);
   var branch = schema.findFieldBranch(key);
+
   var rLevels = new Array(field.rLevelMax + 1).fill(0);
   var vIndex = 0;
-
   for (var i = 0; i < data.count; i++) {
     var dLevel = data.dlevels[i];
     var rLevel = data.rlevels[i];
@@ -167,52 +145,44 @@ function materializeColumn(schema, buffer, key, records) {
     var record = records[rLevels[rIndex++] - 1];
 
     var _iterator3 = _createForOfIteratorHelper(branch),
-        _step3;
-
+      _step3;
     try {
       for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
         var step = _step3.value;
         if (step === field) break;
         if (dLevel < step.dLevelMax) break;
-
         if (step.repetitionType === 'REPEATED') {
           if (!(step.name in record)) {
             record[step.name] = [];
           }
-
           var _ix = rLevels[rIndex++];
-
           while (record[step.name].length <= _ix) {
             record[step.name].push({});
           }
-
           record = record[step.name][_ix];
         } else {
           record[step.name] = record[step.name] || {};
           record = record[step.name];
         }
       }
+
     } catch (err) {
       _iterator3.e(err);
     } finally {
       _iterator3.f();
     }
-
     if (dLevel === field.dLevelMax) {
-      var value = Types.fromPrimitive(field.originalType || field.primitiveType, data.values[vIndex], field);
+      var value = Types.fromPrimitive(
+      field.originalType || field.primitiveType, data.values[vIndex], field);
       vIndex++;
-
       if (field.repetitionType === 'REPEATED') {
         if (!(field.name in record)) {
           record[field.name] = [];
         }
-
         var ix = rLevels[rIndex];
-
         while (record[field.name].length <= ix) {
           record[field.name].push(null);
         }
-
         record[field.name][ix] = value;
       } else {
         record[field.name] = value;

package/dist/es5/parquetjs/schema/shred.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../../src/parquetjs/schema/shred.ts"],"names":["shredBuffer","schema","columnData","fieldList","field","key","dlevels","rlevels","values","pageHeaders","count","rowCount","shredRecord","record","buffer","data","shredRecordFields","fields","Array","prototype","push","apply","rLevel","dLevel","name","undefined","constructor","length","Boolean","repetitionType","Error","isNested","i","rlvl","rLevelMax","dLevelMax","Types","toPrimitive","originalType","primitiveType","materializeRecords","records","materializeColumn","findField","branch","findFieldBranch","rLevels","fill","vIndex","rIndex","step","ix","value","fromPrimitive"],"mappings":";;;;;;;;;;;;;;;;;AAEA;;AAEA;;;;;;;;;;;;AAIO,SAASA,WAAT,CAAqBC,MAArB,EAA2D;AAChE,MAAMC,UAAuC,GAAG,EAAhD;;AADgE,6CAE5CD,MAAM,CAACE,SAFqC;AAAA;;AAAA;AAEhE,wDAAsC;AAAA,UAA3BC,KAA2B;AACpCF,MAAAA,UAAU,CAACE,KAAK,CAACC,GAAP,CAAV,GAAwB;AACtBC,QAAAA,OAAO,EAAE,EADa;AAEtBC,QAAAA,OAAO,EAAE,EAFa;AAGtBC,QAAAA,MAAM,EAAE,EAHc;AAItBC,QAAAA,WAAW,EAAE,EAJS;AAKtBC,QAAAA,KAAK,EAAE;AALe,OAAxB;AAOD;AAV+D;AAAA;AAAA;AAAA;AAAA;;AAWhE,SAAO;AAACC,IAAAA,QAAQ,EAAE,CAAX;AAAcT,IAAAA,UAAU,EAAVA;AAAd,GAAP;AACD;;AAwBM,SAASU,WAAT,CAAqBX,MAArB,EAA4CY,MAA5C,EAAyDC,MAAzD,EAAsF;AAE3F,MAAMC,IAAI,GAAGf,WAAW,CAACC,MAAD,CAAX,CAAoBC,UAAjC;AAEAc,EAAAA,iBAAiB,CAACf,MAAM,CAACgB,MAAR,EAAgBJ,MAAhB,EAAwBE,IAAxB,EAA8B,CAA9B,EAAiC,CAAjC,CAAjB;;AAGA,MAAID,MAAM,CAACH,QAAP,KAAoB,CAAxB,EAA2B;AACzBG,IAAAA,MAAM,CAACH,QAAP,GAAkB,CAAlB;AACAG,IAAAA,MAAM,CAACZ,UAAP,GAAoBa,IAApB;AACA;AACD;;AACDD,EAAAA,MAAM,CAACH,QAAP,IAAmB,CAAnB;;AAZ2F,8CAavEV,MAAM,CAACE,SAbgE;AAAA;;AAAA;AAa3F,2DAAsC;AAAA,UAA3BC,KAA2B;AACpCc,MAAAA,KAAK,CAACC,SAAN,CAAgBC,IAAhB,CAAqBC,KAArB,CAA2BP,MAAM,CAACZ,UAAP,CAAkBE,KAAK,CAACC,GAAxB,EAA6BE,OAAxD,EAAiEQ,IAAI,CAACX,KAAK,CAACC,GAAP,CAAJ,CAAgBE,OAAjF;AACAW,MAAAA,KAAK,CAACC,SAAN,CAAgBC,IAAhB,CAAqBC,KAArB,CAA2BP,MAAM,CAACZ,UAAP,CAAkBE,KAAK,CAACC,GAAxB,EAA6BC,OAAxD,EAAiES,IAAI,CAACX,KAAK,CAACC,GAAP,CAAJ,CAAgBC,OAAjF;AACAY,MAAAA,KAAK,CAACC,SAAN,CAAgBC,IAAhB,CAAqBC,KAArB,CAA2BP,MAAM,CAACZ,UAAP,CAAkBE,KAAK,CAACC,GAAxB,EAA6BG,MAAxD,EAAgEO,IAAI,CAACX,KAAK,CAACC,GAAP,CAAJ,CAAgBG,MAAhF;AACAM,MAAAA,MAAM,CAACZ,UAAP,CAAkBE,KAAK,CAACC,GAAxB,EAA6BK,KAA7B,IAAsCK,IAAI,CAACX,KAAK,CAACC,GAAP,CAAJ,CAAgBK,KAAtD;AACD;AAlB0F;AAAA;AAAA;AAAA;AAAA;AAmB5F;;AAGD,SAASM,iBAAT,CACEC,MADF,EAEEJ,MAFF,EAGEE,IAHF,EAIEO,MAJF,EAKEC,MALF,EAME;AACA,OAAK,IAAMC,IAAX,IAAmBP,MAAnB,EAA2B;AACzB,QAAMb,KAAK,GAAGa,MAAM,CAACO,IAAD,CAApB;AAGA,QAAIhB,MAAa,GAAG,EAApB;;AACA,QACEK,MAAM,IACNT,KAAK,CAACoB,IAAN,IAAcX,MADd,IAEAA,MAAM,CAACT,KAAK,CAACoB,IAAP,CAAN,KAAuBC,SAFvB,IAGAZ,MAAM,CAACT,KAAK,CAACoB,IAAP,CAAN,KAAuB,IAJzB,EAKE;AACA,UAAIX,MAAM,CAACT,KAAK,CAACoB,IAAP,CAAN,CAAmBE,WAAnB,KAAmCR,KAAvC,EAA8C;AAC5CV,QAAAA,MAAM,GAAGK,MAAM,CAACT,KAAK,CAACoB,IAAP,CAAf;AACD,OAFD,MAEO;AACLhB,QAAAA,MAAM,CAACY,IAAP,CAAYP,MAAM,CAACT,KAAK,CAACoB,IAAP,CAAlB;AACD;AACF;;AAED,QAAIhB,MAAM,CAACmB,MAAP,KAAkB,CAAlB,IAAuBC,OAAO,CAACf,MAAD,CAA9B,IAA0CT,KAAK,CAACyB,cAAN,KAAyB,UAAvE,EAAmF;AACjF,YAAM,IAAIC,KAAJ,mCAAqC1B,KAAK,CAACoB,IAA3C,EAAN;AACD;;AACD,QAAIhB,MAAM,CAACmB,MAAP,GAAgB,CAAhB,IAAqBvB,KAAK,CAACyB,cAAN,KAAyB,UAAlD,EAA8D;AAC5D,YAAM,IAAIC,KAAJ,sCAAwC1B,KAAK,CAACoB,IAA9C,EAAN;AACD;;AAGD,QAAIhB,MAAM,CAACmB,MAAP,KAAkB,CAAtB,EAAyB;AACvB,UAAIvB,KAAK,CAAC2B,QAAV,EAAoB;AAClBf,QAAAA,iBAAiB,CAACZ,KAAK,CAACa,MAAP,EAAgB,IAAhB,EAAsBF,IAAtB,EAA4BO,MAA5B,EAAoCC,MAApC,CAAjB;AACD,OAFD,MAEO;AACLR,QAAAA,IAAI,CAACX,KAAK,CAACC,GAAP,CAAJ,CAAgBK,KAAhB,IAAyB,CAAzB;AACAK,QAAAA,IAAI,CAACX,KAAK,CAACC,GAAP,CAAJ,CAAgBE,OAAhB,CAAwBa,IAAxB,CAA6BE,MAA7B;AACAP,QAAAA,IAAI,CAACX,KAAK,CAACC,GAAP,CAAJ,CAAgBC,OAAhB,CAAwBc,IAAxB,CAA6BG,MAA7B;AACD;;AACD;AACD;;AAGD,SAAK,IAAIS,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGxB,MAAM,CAACmB,MAA3B,EAAmCK,CAAC,EAApC,EAAwC;AACtC,UAAMC,IAAI,GAAGD,CAAC,KAAK,CAAN,GAAUV,MAAV,GAAmBlB,KAAK,CAAC8B,SAAtC;;AACA,UAAI9B,KAAK,CAAC2B,QAAV,EAAoB;AAClBf,QAAAA,iBAAiB,CAACZ,KAAK,CAACa,MAAP,EAAgBT,MAAM,CAACwB,CAAD,CAAtB,EAA2BjB,IAA3B,EAAiCkB,IAAjC,EAAuC7B,KAAK,CAAC+B,SAA7C,CAAjB;AACD,OAFD,MAEO;AACLpB,QAAAA,IAAI,CAACX,KAAK,CAACC,GAAP,CAAJ,CAAgBK,KAAhB,IAAyB,CAAzB;AACAK,QAAAA,IAAI,CAACX,KAAK,CAACC,GAAP,CAAJ,CAAgBE,OAAhB,CAAwBa,IAAxB,CAA6Ba,IAA7B;AACAlB,QAAAA,IAAI,CAACX,KAAK,CAACC,GAAP,CAAJ,CAAgBC,OAAhB,CAAwBc,IAAxB,CAA6BhB,KAAK,CAAC+B,SAAnC;AACApB,QAAAA,IAAI,CAACX,KAAK,CAACC,GAAP,CAAJ,CAAgBG,MAAhB,CAAuBY,IAAvB,CACEgB,KAAK,CAACC,WAAN,CAAmBjC,KAAK,CAACkC,YAAN,IAAsBlC,KAAK,CAACmC,aAA/C,EAAgE/B,MAAM,CAACwB,CAAD,CAAtE,CADF;AAGD;AACF;AACF;AACF;;AAqBM,SAASQ,kBAAT,CAA4BvC,MAA5B,EAAmDa,MAAnD,EAA2F;AAChG,MAAM2B,OAAwB,GAAG,EAAjC;;AACA,OAAK,IAAIT,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGlB,MAAM,CAACH,QAA3B,EAAqCqB,CAAC,EAAtC;AAA0CS,IAAAA,OAAO,CAACrB,IAAR,CAAa,EAAb;AAA1C;;AACA,OAAK,IAAMf,GAAX,IAAkBS,MAAM,CAACZ,UAAzB,EAAqC;AACnCwC,IAAAA,iBAAiB,CAACzC,MAAD,EAASa,MAAT,EAAiBT,GAAjB,EAAsBoC,OAAtB,CAAjB;AACD;;AACD,SAAOA,OAAP;AACD;;AAGD,SAASC,iBAAT,CACEzC,MADF,EAEEa,MAFF,EAGET,GAHF,EAIEoC,OAJF,EAKE;AACA,MAAM1B,IAAI,GAAGD,MAAM,CAACZ,UAAP,CAAkBG,GAAlB,CAAb;AACA,MAAI,CAACU,IAAI,CAACL,KAAV,EAAiB;AAEjB,MAAMN,KAAK,GAAGH,MAAM,CAAC0C,SAAP,CAAiBtC,GAAjB,CAAd;AACA,MAAMuC,MAAM,GAAG3C,MAAM,CAAC4C,eAAP,CAAuBxC,GAAvB,CAAf;AAGA,MAAMyC,OAAiB,GAAG,IAAI5B,KAAJ,CAAUd,KAAK,CAAC8B,SAAN,GAAkB,CAA5B,EAA+Ba,IAA/B,CAAoC,CAApC,CAA1B;AACA,MAAIC,MAAM,GAAG,CAAb;;AACA,OAAK,IAAIhB,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGjB,IAAI,CAACL,KAAzB,EAAgCsB,CAAC,EAAjC,EAAqC;AACnC,QAAMT,MAAM,GAAGR,IAAI,CAACT,OAAL,CAAa0B,CAAb,CAAf;AACA,QAAMV,MAAM,GAAGP,IAAI,CAACR,OAAL,CAAayB,CAAb,CAAf;AACAc,IAAAA,OAAO,CAACxB,MAAD,CAAP;AACAwB,IAAAA,OAAO,CAACC,IAAR,CAAa,CAAb,EAAgBzB,MAAM,GAAG,CAAzB;AAEA,QAAI2B,MAAM,GAAG,CAAb;AACA,QAAIpC,MAAM,GAAG4B,OAAO,CAACK,OAAO,CAACG,MAAM,EAAP,CAAP,GAAoB,CAArB,CAApB;;AAPmC,gDAUhBL,MAVgB;AAAA;;AAAA;AAUnC,6DAA2B;AAAA,YAAhBM,IAAgB;AACzB,YAAIA,IAAI,KAAK9C,KAAb,EAAoB;AACpB,YAAImB,MAAM,GAAG2B,IAAI,CAACf,SAAlB,EAA6B;;AAC7B,YAAIe,IAAI,CAACrB,cAAL,KAAwB,UAA5B,EAAwC;AACtC,cAAI,EAAEqB,IAAI,CAAC1B,IAAL,IAAaX,MAAf,CAAJ,EAA4B;AAE1BA,YAAAA,MAAM,CAACqC,IAAI,CAAC1B,IAAN,CAAN,GAAoB,EAApB;AACD;;AACD,cAAM2B,GAAE,GAAGL,OAAO,CAACG,MAAM,EAAP,CAAlB;;AACA,iBAAOpC,MAAM,CAACqC,IAAI,CAAC1B,IAAN,CAAN,CAAkBG,MAAlB,IAA4BwB,GAAnC,EAAuC;AAErCtC,YAAAA,MAAM,CAACqC,IAAI,CAAC1B,IAAN,CAAN,CAAkBJ,IAAlB,CAAuB,EAAvB;AACD;;AACDP,UAAAA,MAAM,GAAGA,MAAM,CAACqC,IAAI,CAAC1B,IAAN,CAAN,CAAkB2B,GAAlB,CAAT;AACD,SAXD,MAWO;AACLtC,UAAAA,MAAM,CAACqC,IAAI,CAAC1B,IAAN,CAAN,GAAoBX,MAAM,CAACqC,IAAI,CAAC1B,IAAN,CAAN,IAAqB,EAAzC;AACAX,UAAAA,MAAM,GAAGA,MAAM,CAACqC,IAAI,CAAC1B,IAAN,CAAf;AACD;AACF;AA5BkC;AAAA;AAAA;AAAA;AAAA;;AA+BnC,QAAID,MAAM,KAAKnB,KAAK,CAAC+B,SAArB,EAAgC;AAC9B,UAAMiB,KAAK,GAAGhB,KAAK,CAACiB,aAAN,CAEZjD,KAAK,CAACkC,YAAN,IAAsBlC,KAAK,CAACmC,aAFhB,EAGZxB,IAAI,CAACP,MAAL,CAAYwC,MAAZ,CAHY,EAIZ5C,KAJY,CAAd;AAMA4C,MAAAA,MAAM;;AACN,UAAI5C,KAAK,CAACyB,cAAN,KAAyB,UAA7B,EAAyC;AACvC,YAAI,EAAEzB,KAAK,CAACoB,IAAN,IAAcX,MAAhB,CAAJ,EAA6B;AAE3BA,UAAAA,MAAM,CAACT,KAAK,CAACoB,IAAP,CAAN,GAAqB,EAArB;AACD;;AACD,YAAM2B,EAAE,GAAGL,OAAO,CAACG,MAAD,CAAlB;;AACA,eAAOpC,MAAM,CAACT,KAAK,CAACoB,IAAP,CAAN,CAAmBG,MAAnB,IAA6BwB,EAApC,EAAwC;AAEtCtC,UAAAA,MAAM,CAACT,KAAK,CAACoB,IAAP,CAAN,CAAmBJ,IAAnB,CAAwB,IAAxB;AACD;;AACDP,QAAAA,MAAM,CAACT,KAAK,CAACoB,IAAP,CAAN,CAAmB2B,EAAnB,IAAyBC,KAAzB;AACD,OAXD,MAWO;AACLvC,QAAAA,MAAM,CAACT,KAAK,CAACoB,IAAP,CAAN,GAAqB4B,KAArB;AACD;AACF;AACF;AACF","sourcesContent":["// Forked from https://github.com/kbajalc/parquets under MIT license (Copyright (c) 2017 ironSource Ltd.)\n\nimport {ParquetBuffer, ParquetData, ParquetField, ParquetRecord} from './declare';\nimport {ParquetSchema} from './schema';\nimport * as Types from './types';\n\nexport {ParquetBuffer};\n\nexport function shredBuffer(schema: ParquetSchema): ParquetBuffer {\n  const columnData: Record<string, ParquetData> = {};\n  for (const field of schema.fieldList) {\n    columnData[field.key] = {\n      dlevels: [],\n      rlevels: [],\n      values: [],\n      pageHeaders: [],\n      count: 0\n    };\n  }\n  return {rowCount: 0, columnData};\n}\n\n/**\n * 'Shred' a record into a list of <value, repetition_level, definition_level>\n * tuples per column using the Google Dremel Algorithm..\n *\n * The buffer argument must point to an object into which the shredded record\n * will be returned. You may re-use the buffer for repeated calls to this function\n * to append to an existing buffer, as long as the schema is unchanged.\n *\n * The format in which the shredded records will be stored in the buffer is as\n * follows:\n *\n *   buffer = {\n *     columnData: [\n *       'my_col': {\n *          dlevels: [d1, d2, .. dN],\n *          rlevels: [r1, r2, .. rN],\n *          values: [v1, v2, .. vN],\n *        }, ...\n *      ],\n *      rowCount: X,\n *   }\n */\nexport function shredRecord(schema: ParquetSchema, record: any, buffer: ParquetBuffer): void {\n  /* shred the record, this may raise an exception */\n  const data = shredBuffer(schema).columnData;\n\n  shredRecordFields(schema.fields, record, data, 0, 0);\n\n  /* if no error during shredding, add the shredded record to the buffer */\n  if (buffer.rowCount === 0) {\n    buffer.rowCount = 1;\n    buffer.columnData = data;\n    return;\n  }\n  buffer.rowCount += 1;\n  for (const field of schema.fieldList) {\n    Array.prototype.push.apply(buffer.columnData[field.key].rlevels, data[field.key].rlevels);\n    Array.prototype.push.apply(buffer.columnData[field.key].dlevels, data[field.key].dlevels);\n    Array.prototype.push.apply(buffer.columnData[field.key].values, data[field.key].values);\n    buffer.columnData[field.key].count += data[field.key].count;\n  }\n}\n\n// eslint-disable-next-line max-statements, complexity\nfunction shredRecordFields(\n  fields: Record<string, ParquetField>,\n  record: any,\n  data: Record<string, ParquetData>,\n  rLevel: number,\n  dLevel: number\n) {\n  for (const name in fields) {\n    const field = fields[name];\n\n    // fetch values\n    let values: any[] = [];\n    if (\n      record &&\n      field.name in record &&\n      record[field.name] !== undefined &&\n      record[field.name] !== null\n    ) {\n      if (record[field.name].constructor === Array) {\n        values = record[field.name];\n      } else {\n        values.push(record[field.name]);\n      }\n    }\n    // check values\n    if (values.length === 0 && Boolean(record) && field.repetitionType === 'REQUIRED') {\n      throw new Error(`missing required field: ${field.name}`);\n    }\n    if (values.length > 1 && field.repetitionType !== 'REPEATED') {\n      throw new Error(`too many values for field: ${field.name}`);\n    }\n\n    // push null\n    if (values.length === 0) {\n      if (field.isNested) {\n        shredRecordFields(field.fields!, null, data, rLevel, dLevel);\n      } else {\n        data[field.key].count += 1;\n        data[field.key].rlevels.push(rLevel);\n        data[field.key].dlevels.push(dLevel);\n      }\n      continue; // eslint-disable-line no-continue\n    }\n\n    // push values\n    for (let i = 0; i < values.length; i++) {\n      const rlvl = i === 0 ? rLevel : field.rLevelMax;\n      if (field.isNested) {\n        shredRecordFields(field.fields!, values[i], data, rlvl, field.dLevelMax);\n      } else {\n        data[field.key].count += 1;\n        data[field.key].rlevels.push(rlvl);\n        data[field.key].dlevels.push(field.dLevelMax);\n        data[field.key].values.push(\n          Types.toPrimitive((field.originalType || field.primitiveType)!, values[i])\n        );\n      }\n    }\n  }\n}\n\n/**\n * 'Materialize' a list of <value, repetition_level, definition_level>\n * tuples back to nested records (objects/arrays) using the Google Dremel\n * Algorithm..\n *\n * The buffer argument must point to an object with the following structure (i.e.\n * the same structure that is returned by shredRecords):\n *\n *   buffer = {\n *     columnData: [\n *       'my_col': {\n *          dlevels: [d1, d2, .. dN],\n *          rlevels: [r1, r2, .. rN],\n *          values: [v1, v2, .. vN],\n *        }, ...\n *      ],\n *      rowCount: X,\n *   }\n */\nexport function materializeRecords(schema: ParquetSchema, buffer: ParquetBuffer): ParquetRecord[] {\n  const records: ParquetRecord[] = [];\n  for (let i = 0; i < buffer.rowCount; i++) records.push({});\n  for (const key in buffer.columnData) {\n    materializeColumn(schema, buffer, key, records);\n  }\n  return records;\n}\n\n// eslint-disable-next-line max-statements, complexity\nfunction materializeColumn(\n  schema: ParquetSchema,\n  buffer: ParquetBuffer,\n  key: string,\n  records: ParquetRecord[]\n) {\n  const data = buffer.columnData[key];\n  if (!data.count) return;\n\n  const field = schema.findField(key);\n  const branch = schema.findFieldBranch(key);\n\n  // tslint:disable-next-line:prefer-array-literal\n  const rLevels: number[] = new Array(field.rLevelMax + 1).fill(0);\n  let vIndex = 0;\n  for (let i = 0; i < data.count; i++) {\n    const dLevel = data.dlevels[i];\n    const rLevel = data.rlevels[i];\n    rLevels[rLevel]++;\n    rLevels.fill(0, rLevel + 1);\n\n    let rIndex = 0;\n    let record = records[rLevels[rIndex++] - 1];\n\n    // Internal nodes\n    for (const step of branch) {\n      if (step === field) break;\n      if (dLevel < step.dLevelMax) break;\n      if (step.repetitionType === 'REPEATED') {\n        if (!(step.name in record)) {\n          // eslint-disable max-depth\n          record[step.name] = [];\n        }\n        const ix = rLevels[rIndex++];\n        while (record[step.name].length <= ix) {\n          // eslint-disable max-depth\n          record[step.name].push({});\n        }\n        record = record[step.name][ix];\n      } else {\n        record[step.name] = record[step.name] || {};\n        record = record[step.name];\n      }\n    }\n\n    // Leaf node\n    if (dLevel === field.dLevelMax) {\n      const value = Types.fromPrimitive(\n        // @ts-ignore\n        field.originalType || field.primitiveType,\n        data.values[vIndex],\n        field\n      );\n      vIndex++;\n      if (field.repetitionType === 'REPEATED') {\n        if (!(field.name in record)) {\n          // eslint-disable max-depth\n          record[field.name] = [];\n        }\n        const ix = rLevels[rIndex];\n        while (record[field.name].length <= ix) {\n          // eslint-disable max-depth\n          record[field.name].push(null);\n        }\n        record[field.name][ix] = value;\n      } else {\n        record[field.name] = value;\n      }\n    }\n  }\n}\n"],"file":"shred.js"}
+{"version":3,"file":"shred.js","names":["shredBuffer","schema","columnData","fieldList","field","key","dlevels","rlevels","values","pageHeaders","count","rowCount","shredRecord","record","buffer","data","shredRecordFields","fields","Array","prototype","push","apply","rLevel","dLevel","name","undefined","constructor","length","Boolean","repetitionType","Error","isNested","i","rlvl","rLevelMax","dLevelMax","Types","toPrimitive","originalType","primitiveType","materializeRecords","records","materializeColumn","findField","branch","findFieldBranch","rLevels","fill","vIndex","rIndex","step","ix","value","fromPrimitive"],"sources":["../../../../src/parquetjs/schema/shred.ts"],"sourcesContent":["// Forked from https://github.com/kbajalc/parquets under MIT license (Copyright (c) 2017 ironSource Ltd.)\n\nimport {ParquetBuffer, ParquetData, ParquetField, ParquetRecord} from './declare';\nimport {ParquetSchema} from './schema';\nimport * as Types from './types';\n\nexport {ParquetBuffer};\n\nexport function shredBuffer(schema: ParquetSchema): ParquetBuffer {\n  const columnData: Record<string, ParquetData> = {};\n  for (const field of schema.fieldList) {\n    columnData[field.key] = {\n      dlevels: [],\n      rlevels: [],\n      values: [],\n      pageHeaders: [],\n      count: 0\n    };\n  }\n  return {rowCount: 0, columnData};\n}\n\n/**\n * 'Shred' a record into a list of <value, repetition_level, definition_level>\n * tuples per column using the Google Dremel Algorithm..\n *\n * The buffer argument must point to an object into which the shredded record\n * will be returned. You may re-use the buffer for repeated calls to this function\n * to append to an existing buffer, as long as the schema is unchanged.\n *\n * The format in which the shredded records will be stored in the buffer is as\n * follows:\n *\n *   buffer = {\n *     columnData: [\n *       'my_col': {\n *          dlevels: [d1, d2, .. dN],\n *          rlevels: [r1, r2, .. rN],\n *          values: [v1, v2, .. vN],\n *        }, ...\n *      ],\n *      rowCount: X,\n *   }\n */\nexport function shredRecord(schema: ParquetSchema, record: any, buffer: ParquetBuffer): void {\n  /* shred the record, this may raise an exception */\n  const data = shredBuffer(schema).columnData;\n\n  shredRecordFields(schema.fields, record, data, 0, 0);\n\n  /* if no error during shredding, add the shredded record to the buffer */\n  if (buffer.rowCount === 0) {\n    buffer.rowCount = 1;\n    buffer.columnData = data;\n    return;\n  }\n  buffer.rowCount += 1;\n  for (const field of schema.fieldList) {\n    Array.prototype.push.apply(buffer.columnData[field.key].rlevels, data[field.key].rlevels);\n    Array.prototype.push.apply(buffer.columnData[field.key].dlevels, data[field.key].dlevels);\n    Array.prototype.push.apply(buffer.columnData[field.key].values, data[field.key].values);\n    buffer.columnData[field.key].count += data[field.key].count;\n  }\n}\n\n// eslint-disable-next-line max-statements, complexity\nfunction shredRecordFields(\n  fields: Record<string, ParquetField>,\n  record: any,\n  data: Record<string, ParquetData>,\n  rLevel: number,\n  dLevel: number\n) {\n  for (const name in fields) {\n    const field = fields[name];\n\n    // fetch values\n    let values: any[] = [];\n    if (\n      record &&\n      field.name in record &&\n      record[field.name] !== undefined &&\n      record[field.name] !== null\n    ) {\n      if (record[field.name].constructor === Array) {\n        values = record[field.name];\n      } else {\n        values.push(record[field.name]);\n      }\n    }\n    // check values\n    if (values.length === 0 && Boolean(record) && field.repetitionType === 'REQUIRED') {\n      throw new Error(`missing required field: ${field.name}`);\n    }\n    if (values.length > 1 && field.repetitionType !== 'REPEATED') {\n      throw new Error(`too many values for field: ${field.name}`);\n    }\n\n    // push null\n    if (values.length === 0) {\n      if (field.isNested) {\n        shredRecordFields(field.fields!, null, data, rLevel, dLevel);\n      } else {\n        data[field.key].count += 1;\n        data[field.key].rlevels.push(rLevel);\n        data[field.key].dlevels.push(dLevel);\n      }\n      continue; // eslint-disable-line no-continue\n    }\n\n    // push values\n    for (let i = 0; i < values.length; i++) {\n      const rlvl = i === 0 ? rLevel : field.rLevelMax;\n      if (field.isNested) {\n        shredRecordFields(field.fields!, values[i], data, rlvl, field.dLevelMax);\n      } else {\n        data[field.key].count += 1;\n        data[field.key].rlevels.push(rlvl);\n        data[field.key].dlevels.push(field.dLevelMax);\n        data[field.key].values.push(\n          Types.toPrimitive((field.originalType || field.primitiveType)!, values[i])\n        );\n      }\n    }\n  }\n}\n\n/**\n * 'Materialize' a list of <value, repetition_level, definition_level>\n * tuples back to nested records (objects/arrays) using the Google Dremel\n * Algorithm..\n *\n * The buffer argument must point to an object with the following structure (i.e.\n * the same structure that is returned by shredRecords):\n *\n *   buffer = {\n *     columnData: [\n *       'my_col': {\n *          dlevels: [d1, d2, .. dN],\n *          rlevels: [r1, r2, .. rN],\n *          values: [v1, v2, .. vN],\n *        }, ...\n *      ],\n *      rowCount: X,\n *   }\n */\nexport function materializeRecords(schema: ParquetSchema, buffer: ParquetBuffer): ParquetRecord[] {\n  const records: ParquetRecord[] = [];\n  for (let i = 0; i < buffer.rowCount; i++) records.push({});\n  for (const key in buffer.columnData) {\n    materializeColumn(schema, buffer, key, records);\n  }\n  return records;\n}\n\n// eslint-disable-next-line max-statements, complexity\nfunction materializeColumn(\n  schema: ParquetSchema,\n  buffer: ParquetBuffer,\n  key: string,\n  records: ParquetRecord[]\n) {\n  const data = buffer.columnData[key];\n  if (!data.count) return;\n\n  const field = schema.findField(key);\n  const branch = schema.findFieldBranch(key);\n\n  // tslint:disable-next-line:prefer-array-literal\n  const rLevels: number[] = new Array(field.rLevelMax + 1).fill(0);\n  let vIndex = 0;\n  for (let i = 0; i < data.count; i++) {\n    const dLevel = data.dlevels[i];\n    const rLevel = data.rlevels[i];\n    rLevels[rLevel]++;\n    rLevels.fill(0, rLevel + 1);\n\n    let rIndex = 0;\n    let record = records[rLevels[rIndex++] - 1];\n\n    // Internal nodes\n    for (const step of branch) {\n      if (step === field) break;\n      if (dLevel < step.dLevelMax) break;\n      if (step.repetitionType === 'REPEATED') {\n        if (!(step.name in record)) {\n          // eslint-disable max-depth\n          record[step.name] = [];\n        }\n        const ix = rLevels[rIndex++];\n        while (record[step.name].length <= ix) {\n          // eslint-disable max-depth\n          record[step.name].push({});\n        }\n        record = record[step.name][ix];\n      } else {\n        record[step.name] = record[step.name] || {};\n        record = record[step.name];\n      }\n    }\n\n    // Leaf node\n    if (dLevel === field.dLevelMax) {\n      const value = Types.fromPrimitive(\n        // @ts-ignore\n        field.originalType || field.primitiveType,\n        data.values[vIndex],\n        field\n      );\n      vIndex++;\n      if (field.repetitionType === 'REPEATED') {\n        if (!(field.name in record)) {\n          // eslint-disable max-depth\n          record[field.name] = [];\n        }\n        const ix = rLevels[rIndex];\n        while (record[field.name].length <= ix) {\n          // eslint-disable max-depth\n          record[field.name].push(null);\n        }\n        record[field.name][ix] = value;\n      } else {\n        record[field.name] = value;\n      }\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;AAEA;AAEA;AAAiC;AAAA;AAAA;AAAA;AAAA;AAI1B,SAASA,WAAW,CAACC,MAAqB,EAAiB;EAChE,IAAMC,UAAuC,GAAG,CAAC,CAAC;EAAC,2CAC/BD,MAAM,CAACE,SAAS;IAAA;EAAA;IAApC,oDAAsC;MAAA,IAA3BC,KAAK;MACdF,UAAU,CAACE,KAAK,CAACC,GAAG,CAAC,GAAG;QACtBC,OAAO,EAAE,EAAE;QACXC,OAAO,EAAE,EAAE;QACXC,MAAM,EAAE,EAAE;QACVC,WAAW,EAAE,EAAE;QACfC,KAAK,EAAE;MACT,CAAC;IACH;EAAC;IAAA;EAAA;IAAA;EAAA;EACD,OAAO;IAACC,QAAQ,EAAE,CAAC;IAAET,UAAU,EAAVA;EAAU,CAAC;AAClC;;AAwBO,SAASU,WAAW,CAACX,MAAqB,EAAEY,MAAW,EAAEC,MAAqB,EAAQ;EAE3F,IAAMC,IAAI,GAAGf,WAAW,CAACC,MAAM,CAAC,CAACC,UAAU;EAE3Cc,iBAAiB,CAACf,MAAM,CAACgB,MAAM,EAAEJ,MAAM,EAAEE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;;EAGpD,IAAID,MAAM,CAACH,QAAQ,KAAK,CAAC,EAAE;IACzBG,MAAM,CAACH,QAAQ,GAAG,CAAC;IACnBG,MAAM,CAACZ,UAAU,GAAGa,IAAI;IACxB;EACF;EACAD,MAAM,CAACH,QAAQ,IAAI,CAAC;EAAC,4CACDV,MAAM,CAACE,SAAS;IAAA;EAAA;IAApC,uDAAsC;MAAA,IAA3BC,KAAK;MACdc,KAAK,CAACC,SAAS,CAACC,IAAI,CAACC,KAAK,CAACP,MAAM,CAACZ,UAAU,CAACE,KAAK,CAACC,GAAG,CAAC,CAACE,OAAO,EAAEQ,IAAI,CAACX,KAAK,CAACC,GAAG,CAAC,CAACE,OAAO,CAAC;MACzFW,KAAK,CAACC,SAAS,CAACC,IAAI,CAACC,KAAK,CAACP,MAAM,CAACZ,UAAU,CAACE,KAAK,CAACC,GAAG,CAAC,CAACC,OAAO,EAAES,IAAI,CAACX,KAAK,CAACC,GAAG,CAAC,CAACC,OAAO,CAAC;MACzFY,KAAK,CAACC,SAAS,CAACC,IAAI,CAACC,KAAK,CAACP,MAAM,CAACZ,UAAU,CAACE,KAAK,CAACC,GAAG,CAAC,CAACG,MAAM,EAAEO,IAAI,CAACX,KAAK,CAACC,GAAG,CAAC,CAACG,MAAM,CAAC;MACvFM,MAAM,CAACZ,UAAU,CAACE,KAAK,CAACC,GAAG,CAAC,CAACK,KAAK,IAAIK,IAAI,CAACX,KAAK,CAACC,GAAG,CAAC,CAACK,KAAK;IAC7D;EAAC;IAAA;EAAA;IAAA;EAAA;AACH;;AAGA,SAASM,iBAAiB,CACxBC,MAAoC,EACpCJ,MAAW,EACXE,IAAiC,EACjCO,MAAc,EACdC,MAAc,EACd;EACA,KAAK,IAAMC,IAAI,IAAIP,MAAM,EAAE;IACzB,IAAMb,KAAK,GAAGa,MAAM,CAACO,IAAI,CAAC;;IAG1B,IAAIhB,MAAa,GAAG,EAAE;IACtB,IACEK,MAAM,IACNT,KAAK,CAACoB,IAAI,IAAIX,MAAM,IACpBA,MAAM,CAACT,KAAK,CAACoB,IAAI,CAAC,KAAKC,SAAS,IAChCZ,MAAM,CAACT,KAAK,CAACoB,IAAI,CAAC,KAAK,IAAI,EAC3B;MACA,IAAIX,MAAM,CAACT,KAAK,CAACoB,IAAI,CAAC,CAACE,WAAW,KAAKR,KAAK,EAAE;QAC5CV,MAAM,GAAGK,MAAM,CAACT,KAAK,CAACoB,IAAI,CAAC;MAC7B,CAAC,MAAM;QACLhB,MAAM,CAACY,IAAI,CAACP,MAAM,CAACT,KAAK,CAACoB,IAAI,CAAC,CAAC;MACjC;IACF;IAEA,IAAIhB,MAAM,CAACmB,MAAM,KAAK,CAAC,IAAIC,OAAO,CAACf,MAAM,CAAC,IAAIT,KAAK,CAACyB,cAAc,KAAK,UAAU,EAAE;MACjF,MAAM,IAAIC,KAAK,mCAA4B1B,KAAK,CAACoB,IAAI,EAAG;IAC1D;IACA,IAAIhB,MAAM,CAACmB,MAAM,GAAG,CAAC,IAAIvB,KAAK,CAACyB,cAAc,KAAK,UAAU,EAAE;MAC5D,MAAM,IAAIC,KAAK,sCAA+B1B,KAAK,CAACoB,IAAI,EAAG;IAC7D;;IAGA,IAAIhB,MAAM,CAACmB,MAAM,KAAK,CAAC,EAAE;MACvB,IAAIvB,KAAK,CAAC2B,QAAQ,EAAE;QAClBf,iBAAiB,CAACZ,KAAK,CAACa,MAAM,EAAG,IAAI,EAAEF,IAAI,EAAEO,MAAM,EAAEC,MAAM,CAAC;MAC9D,CAAC,MAAM;QACLR,IAAI,CAACX,KAAK,CAACC,GAAG,CAAC,CAACK,KAAK,IAAI,CAAC;QAC1BK,IAAI,CAACX,KAAK,CAACC,GAAG,CAAC,CAACE,OAAO,CAACa,IAAI,CAACE,MAAM,CAAC;QACpCP,IAAI,CAACX,KAAK,CAACC,GAAG,CAAC,CAACC,OAAO,CAACc,IAAI,CAACG,MAAM,CAAC;MACtC;MACA;IACF;;IAGA,KAAK,IAAIS,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGxB,MAAM,CAACmB,MAAM,EAAEK,CAAC,EAAE,EAAE;MACtC,IAAMC,IAAI,GAAGD,CAAC,KAAK,CAAC,GAAGV,MAAM,GAAGlB,KAAK,CAAC8B,SAAS;MAC/C,IAAI9B,KAAK,CAAC2B,QAAQ,EAAE;QAClBf,iBAAiB,CAACZ,KAAK,CAACa,MAAM,EAAGT,MAAM,CAACwB,CAAC,CAAC,EAAEjB,IAAI,EAAEkB,IAAI,EAAE7B,KAAK,CAAC+B,SAAS,CAAC;MAC1E,CAAC,MAAM;QACLpB,IAAI,CAACX,KAAK,CAACC,GAAG,CAAC,CAACK,KAAK,IAAI,CAAC;QAC1BK,IAAI,CAACX,KAAK,CAACC,GAAG,CAAC,CAACE,OAAO,CAACa,IAAI,CAACa,IAAI,CAAC;QAClClB,IAAI,CAACX,KAAK,CAACC,GAAG,CAAC,CAACC,OAAO,CAACc,IAAI,CAAChB,KAAK,CAAC+B,SAAS,CAAC;QAC7CpB,IAAI,CAACX,KAAK,CAACC,GAAG,CAAC,CAACG,MAAM,CAACY,IAAI,CACzBgB,KAAK,CAACC,WAAW,CAAEjC,KAAK,CAACkC,YAAY,IAAIlC,KAAK,CAACmC,aAAa,EAAI/B,MAAM,CAACwB,CAAC,CAAC,CAAC,CAC3E;MACH;IACF;EACF;AACF;;AAqBO,SAASQ,kBAAkB,CAACvC,MAAqB,EAAEa,MAAqB,EAAmB;EAChG,IAAM2B,OAAwB,GAAG,EAAE;EACnC,KAAK,IAAIT,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGlB,MAAM,CAACH,QAAQ,EAAEqB,CAAC,EAAE;IAAES,OAAO,CAACrB,IAAI,CAAC,CAAC,CAAC,CAAC;EAAC;EAC3D,KAAK,IAAMf,GAAG,IAAIS,MAAM,CAACZ,UAAU,EAAE;IACnCwC,iBAAiB,CAACzC,MAAM,EAAEa,MAAM,EAAET,GAAG,EAAEoC,OAAO,CAAC;EACjD;EACA,OAAOA,OAAO;AAChB;;AAGA,SAASC,iBAAiB,CACxBzC,MAAqB,EACrBa,MAAqB,EACrBT,GAAW,EACXoC,OAAwB,EACxB;EACA,IAAM1B,IAAI,GAAGD,MAAM,CAACZ,UAAU,CAACG,GAAG,CAAC;EACnC,IAAI,CAACU,IAAI,CAACL,KAAK,EAAE;EAEjB,IAAMN,KAAK,GAAGH,MAAM,CAAC0C,SAAS,CAACtC,GAAG,CAAC;EACnC,IAAMuC,MAAM,GAAG3C,MAAM,CAAC4C,eAAe,CAACxC,GAAG,CAAC;;EAG1C,IAAMyC,OAAiB,GAAG,IAAI5B,KAAK,CAACd,KAAK,CAAC8B,SAAS,GAAG,CAAC,CAAC,CAACa,IAAI,CAAC,CAAC,CAAC;EAChE,IAAIC,MAAM,GAAG,CAAC;EACd,KAAK,IAAIhB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGjB,IAAI,CAACL,KAAK,EAAEsB,CAAC,EAAE,EAAE;IACnC,IAAMT,MAAM,GAAGR,IAAI,CAACT,OAAO,CAAC0B,CAAC,CAAC;IAC9B,IAAMV,MAAM,GAAGP,IAAI,CAACR,OAAO,CAACyB,CAAC,CAAC;IAC9Bc,OAAO,CAACxB,MAAM,CAAC,EAAE;IACjBwB,OAAO,CAACC,IAAI,CAAC,CAAC,EAAEzB,MAAM,GAAG,CAAC,CAAC;IAE3B,IAAI2B,MAAM,GAAG,CAAC;IACd,IAAIpC,MAAM,GAAG4B,OAAO,CAACK,OAAO,CAACG,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC;;IAAC,4CAGzBL,MAAM;MAAA;IAAA;MAAzB,uDAA2B;QAAA,IAAhBM,IAAI;QACb,IAAIA,IAAI,KAAK9C,KAAK,EAAE;QACpB,IAAImB,MAAM,GAAG2B,IAAI,CAACf,SAAS,EAAE;QAC7B,IAAIe,IAAI,CAACrB,cAAc,KAAK,UAAU,EAAE;UACtC,IAAI,EAAEqB,IAAI,CAAC1B,IAAI,IAAIX,MAAM,CAAC,EAAE;YAE1BA,MAAM,CAACqC,IAAI,CAAC1B,IAAI,CAAC,GAAG,EAAE;UACxB;UACA,IAAM2B,GAAE,GAAGL,OAAO,CAACG,MAAM,EAAE,CAAC;UAC5B,OAAOpC,MAAM,CAACqC,IAAI,CAAC1B,IAAI,CAAC,CAACG,MAAM,IAAIwB,GAAE,EAAE;YAErCtC,MAAM,CAACqC,IAAI,CAAC1B,IAAI,CAAC,CAACJ,IAAI,CAAC,CAAC,CAAC,CAAC;UAC5B;UACAP,MAAM,GAAGA,MAAM,CAACqC,IAAI,CAAC1B,IAAI,CAAC,CAAC2B,GAAE,CAAC;QAChC,CAAC,MAAM;UACLtC,MAAM,CAACqC,IAAI,CAAC1B,IAAI,CAAC,GAAGX,MAAM,CAACqC,IAAI,CAAC1B,IAAI,CAAC,IAAI,CAAC,CAAC;UAC3CX,MAAM,GAAGA,MAAM,CAACqC,IAAI,CAAC1B,IAAI,CAAC;QAC5B;MACF;;IAAC;MAAA;IAAA;MAAA;IAAA;IAGD,IAAID,MAAM,KAAKnB,KAAK,CAAC+B,SAAS,EAAE;MAC9B,IAAMiB,KAAK,GAAGhB,KAAK,CAACiB,aAAa;MAE/BjD,KAAK,CAACkC,YAAY,IAAIlC,KAAK,CAACmC,aAAa,EACzCxB,IAAI,CAACP,MAAM,CAACwC,MAAM,CAAC,EACnB5C,KAAK,CACN;MACD4C,MAAM,EAAE;MACR,IAAI5C,KAAK,CAACyB,cAAc,KAAK,UAAU,EAAE;QACvC,IAAI,EAAEzB,KAAK,CAACoB,IAAI,IAAIX,MAAM,CAAC,EAAE;UAE3BA,MAAM,CAACT,KAAK,CAACoB,IAAI,CAAC,GAAG,EAAE;QACzB;QACA,IAAM2B,EAAE,GAAGL,OAAO,CAACG,MAAM,CAAC;QAC1B,OAAOpC,MAAM,CAACT,KAAK,CAACoB,IAAI,CAAC,CAACG,MAAM,IAAIwB,EAAE,EAAE;UAEtCtC,MAAM,CAACT,KAAK,CAACoB,IAAI,CAAC,CAACJ,IAAI,CAAC,IAAI,CAAC;QAC/B;QACAP,MAAM,CAACT,KAAK,CAACoB,IAAI,CAAC,CAAC2B,EAAE,CAAC,GAAGC,KAAK;MAChC,CAAC,MAAM;QACLvC,MAAM,CAACT,KAAK,CAACoB,IAAI,CAAC,GAAG4B,KAAK;MAC5B;IACF;EACF;AACF"}

package/dist/es5/parquetjs/schema/types.js

@@ -1,14 +1,12 @@
 "use strict";
 
 var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.toPrimitive = toPrimitive;
-exports.fromPrimitive = fromPrimitive;
 exports.PARQUET_LOGICAL_TYPES = void 0;
-
+exports.fromPrimitive = fromPrimitive;
+exports.toPrimitive = toPrimitive;
 var _bson = _interopRequireDefault(require("bson"));
 
 var PARQUET_LOGICAL_TYPES = {
@@ -163,13 +161,12 @@ var PARQUET_LOGICAL_TYPES = {
     fromPrimitive: decimalFromPrimitive_BYTE_ARRAY
   }
 };
-exports.PARQUET_LOGICAL_TYPES = PARQUET_LOGICAL_TYPES;
 
+exports.PARQUET_LOGICAL_TYPES = PARQUET_LOGICAL_TYPES;
 function toPrimitive(type, value, field) {
   if (!(type in PARQUET_LOGICAL_TYPES)) {
     throw new Error("invalid type: ".concat(type));
   }
-
   return PARQUET_LOGICAL_TYPES[type].toPrimitive(value, field);
 }
 
@@ -177,210 +174,151 @@ function fromPrimitive(type, value, field) {
   if (!(type in PARQUET_LOGICAL_TYPES)) {
     throw new Error("invalid type: ".concat(type));
   }
-
   if ('fromPrimitive' in PARQUET_LOGICAL_TYPES[type]) {
     var _PARQUET_LOGICAL_TYPE, _PARQUET_LOGICAL_TYPE2;
-
     return (_PARQUET_LOGICAL_TYPE = (_PARQUET_LOGICAL_TYPE2 = PARQUET_LOGICAL_TYPES[type]).fromPrimitive) === null || _PARQUET_LOGICAL_TYPE === void 0 ? void 0 : _PARQUET_LOGICAL_TYPE.call(_PARQUET_LOGICAL_TYPE2, value, field);
   }
 
   return value;
 }
-
 function toPrimitive_BOOLEAN(value) {
   return Boolean(value);
 }
-
 function fromPrimitive_BOOLEAN(value) {
   return Boolean(value);
 }
-
 function toPrimitive_FLOAT(value) {
   var v = parseFloat(value);
-
   if (isNaN(v)) {
     throw new Error("invalid value for FLOAT: ".concat(value));
   }
-
   return v;
 }
-
 function toPrimitive_DOUBLE(value) {
   var v = parseFloat(value);
-
   if (isNaN(v)) {
     throw new Error("invalid value for DOUBLE: ".concat(value));
   }
-
   return v;
 }
-
 function toPrimitive_INT8(value) {
   var v = parseInt(value, 10);
-
   if (v < -0x80 || v > 0x7f || isNaN(v)) {
     throw new Error("invalid value for INT8: ".concat(value));
   }
-
   return v;
 }
-
 function toPrimitive_UINT8(value) {
   var v = parseInt(value, 10);
-
   if (v < 0 || v > 0xff || isNaN(v)) {
     throw new Error("invalid value for UINT8: ".concat(value));
   }
-
   return v;
 }
-
 function toPrimitive_INT16(value) {
   var v = parseInt(value, 10);
-
   if (v < -0x8000 || v > 0x7fff || isNaN(v)) {
     throw new Error("invalid value for INT16: ".concat(value));
   }
-
   return v;
 }
-
 function toPrimitive_UINT16(value) {
   var v = parseInt(value, 10);
-
   if (v < 0 || v > 0xffff || isNaN(v)) {
     throw new Error("invalid value for UINT16: ".concat(value));
   }
-
   return v;
 }
-
 function toPrimitive_INT32(value) {
   var v = parseInt(value, 10);
-
   if (v < -0x80000000 || v > 0x7fffffff || isNaN(v)) {
     throw new Error("invalid value for INT32: ".concat(value));
   }
-
   return v;
 }
-
 function decimalToPrimitive_INT32(value, field) {
   var primitiveValue = value * Math.pow(10, field.scale || 0);
   var v = Math.round(primitiveValue * Math.pow(10, -field.presision) % 1 * Math.pow(10, field.presision));
-
   if (v < -0x80000000 || v > 0x7fffffff || isNaN(v)) {
     throw new Error("invalid value for INT32: ".concat(value));
   }
-
   return v;
 }
-
 function toPrimitive_UINT32(value) {
   var v = parseInt(value, 10);
-
   if (v < 0 || v > 0xffffffffffff || isNaN(v)) {
     throw new Error("invalid value for UINT32: ".concat(value));
   }
-
   return v;
 }
-
 function toPrimitive_INT64(value) {
   var v = parseInt(value, 10);
-
   if (isNaN(v)) {
     throw new Error("invalid value for INT64: ".concat(value));
   }
-
   return v;
 }
-
 function decimalToPrimitive_INT64(value, field) {
   var primitiveValue = value * Math.pow(10, field.scale || 0);
   var v = Math.round(primitiveValue * Math.pow(10, -field.presision) % 1 * Math.pow(10, field.presision));
-
   if (isNaN(v)) {
     throw new Error("invalid value for INT64: ".concat(value));
   }
-
   return v;
 }
-
 function toPrimitive_UINT64(value) {
   var v = parseInt(value, 10);
-
   if (v < 0 || isNaN(v)) {
     throw new Error("invalid value for UINT64: ".concat(value));
   }
-
   return v;
 }
-
 function toPrimitive_INT96(value) {
   var v = parseInt(value, 10);
-
   if (isNaN(v)) {
     throw new Error("invalid value for INT96: ".concat(value));
   }
-
   return v;
 }
-
 function toPrimitive_BYTE_ARRAY(value) {
   return Buffer.from(value);
 }
-
 function decimalToPrimitive_BYTE_ARRAY(value) {
   return Buffer.from(value);
 }
-
 function toPrimitive_UTF8(value) {
   return Buffer.from(value, 'utf8');
 }
-
 function fromPrimitive_UTF8(value) {
   return value.toString();
 }
-
 function toPrimitive_JSON(value) {
   return Buffer.from(JSON.stringify(value));
 }
-
 function fromPrimitive_JSON(value) {
   return JSON.parse(value);
 }
-
 function toPrimitive_BSON(value) {
   return Buffer.from(_bson.default.serialize(value));
 }
-
 function fromPrimitive_BSON(value) {
   return _bson.default.deserialize(value);
 }
-
 function toPrimitive_TIME_MILLIS(value) {
   var v = parseInt(value, 10);
-
   if (v < 0 || v > 0xffffffffffffffff || isNaN(v)) {
     throw new Error("invalid value for TIME_MILLIS: ".concat(value));
   }
-
   return v;
 }
-
 function toPrimitive_TIME_MICROS(value) {
   var v = parseInt(value, 10);
-
   if (v < 0 || isNaN(v)) {
     throw new Error("invalid value for TIME_MICROS: ".concat(value));
   }
-
   return v;
 }
-
 var kMillisPerDay = 86400000;
-
 function toPrimitive_DATE(value) {
   if (value instanceof Date) {
     return value.getTime() / kMillisPerDay;
@@ -388,19 +326,15 @@ function toPrimitive_DATE(value) {
 
   {
     var v = parseInt(value, 10);
-
     if (v < 0 || isNaN(v)) {
       throw new Error("invalid value for DATE: ".concat(value));
     }
-
     return v;
   }
 }
-
 function fromPrimitive_DATE(value) {
   return new Date(value * kMillisPerDay);
 }
-
 function toPrimitive_TIMESTAMP_MILLIS(value) {
   if (value instanceof Date) {
     return value.getTime();
@@ -408,19 +342,15 @@ function toPrimitive_TIMESTAMP_MILLIS(value) {
 
   {
     var v = parseInt(value, 10);
-
     if (v < 0 || isNaN(v)) {
       throw new Error("invalid value for TIMESTAMP_MILLIS: ".concat(value));
     }
-
     return v;
   }
 }
-
 function fromPrimitive_TIMESTAMP_MILLIS(value) {
   return new Date(value);
 }
-
 function toPrimitive_TIMESTAMP_MICROS(value) {
   if (value instanceof Date) {
     return value.getTime() * 1000;
@@ -428,31 +358,25 @@ function toPrimitive_TIMESTAMP_MICROS(value) {
 
   {
     var v = parseInt(value, 10);
-
     if (v < 0 || isNaN(v)) {
       throw new Error("invalid value for TIMESTAMP_MICROS: ".concat(value));
     }
-
     return v;
   }
 }
-
 function fromPrimitive_TIMESTAMP_MICROS(value) {
   return new Date(value / 1000);
 }
-
 function toPrimitive_INTERVAL(value) {
   if (!value.months || !value.days || !value.milliseconds) {
     throw new Error('value for INTERVAL must be object { months: ..., days: ..., milliseconds: ... }');
   }
-
   var buf = Buffer.alloc(12);
   buf.writeUInt32LE(value.months, 0);
   buf.writeUInt32LE(value.days, 4);
   buf.writeUInt32LE(value.milliseconds, 8);
   return buf;
 }
-
 function fromPrimitive_INTERVAL(value) {
   var buf = Buffer.from(value);
   var months = buf.readUInt32LE(0);
@@ -464,15 +388,12 @@ function fromPrimitive_INTERVAL(value) {
     milliseconds: millis
   };
 }
-
 function decimalFromPrimitive_INT(value, field) {
   var presisionInt = Math.round(value * Math.pow(10, -field.presision) % 1 * Math.pow(10, field.presision));
   return presisionInt * Math.pow(10, -(field.scale || 0));
 }
-
 function decimalFromPrimitive_BYTE_ARRAY(value, field) {
   var number = 0;
-
   if (value.length <= 4) {
     for (var i = 0; i < value.length; i++) {
       var component = value[i] << 8 * (value.length - i - 1);
@@ -481,11 +402,9 @@ function decimalFromPrimitive_BYTE_ARRAY(value, field) {
   } else {
     for (var _i = 0; _i < value.length; _i++) {
       var _component = value[_i] * Math.pow(2, 8 * (value.length - 1 - _i));
-
       number += _component;
     }
   }
-
   var presisionInt = Math.round(number * Math.pow(10, -field.presision) % 1 * Math.pow(10, field.presision));
   return presisionInt * Math.pow(10, -(field.scale || 0));
 }