@loaders.gl/parquet 3.4.13 → 3.4.15

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

@@ -1,12 +1,11 @@
 "use strict";
 
-var _typeof = require("@babel/runtime/helpers/typeof");
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
 Object.defineProperty(exports, "ParquetBuffer", {
   enumerable: true,
-  get: function get() {
+  get: function () {
     return _declare.ParquetBuffer;
   }
 });
@@ -15,38 +14,26 @@ 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 _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function (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 shredBuffer(schema) {
-  var columnData = {};
-  var _iterator = _createForOfIteratorHelper(schema.fieldList),
-    _step;
-  try {
-    for (_iterator.s(); !(_step = _iterator.n()).done;) {
-      var field = _step.value;
-      columnData[field.key] = {
-        dlevels: [],
-        rlevels: [],
-        values: [],
-        pageHeaders: [],
-        count: 0
-      };
-    }
-  } catch (err) {
-    _iterator.e(err);
-  } finally {
-    _iterator.f();
+  const columnData = {};
+  for (const field of schema.fieldList) {
+    columnData[field.key] = {
+      dlevels: [],
+      rlevels: [],
+      values: [],
+      pageHeaders: [],
+      count: 0
+    };
   }
   return {
     rowCount: 0,
-    columnData: columnData
+    columnData
   };
 }
 function shredRecord(schema, record, buffer) {
-  var data = shredBuffer(schema).columnData;
+  const data = shredBuffer(schema).columnData;
   shredRecordFields(schema.fields, record, data, 0, 0);
   if (buffer.rowCount === 0) {
     buffer.rowCount = 1;
@@ -54,26 +41,17 @@ function shredRecord(schema, record, buffer) {
     return;
   }
   buffer.rowCount += 1;
-  var _iterator2 = _createForOfIteratorHelper(schema.fieldList),
-    _step2;
-  try {
-    for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
-      var field = _step2.value;
-      Array.prototype.push.apply(buffer.columnData[field.key].rlevels, data[field.key].rlevels);
-      Array.prototype.push.apply(buffer.columnData[field.key].dlevels, data[field.key].dlevels);
-      Array.prototype.push.apply(buffer.columnData[field.key].values, data[field.key].values);
-      buffer.columnData[field.key].count += data[field.key].count;
-    }
-  } catch (err) {
-    _iterator2.e(err);
-  } finally {
-    _iterator2.f();
+  for (const field of schema.fieldList) {
+    Array.prototype.push.apply(buffer.columnData[field.key].rlevels, data[field.key].rlevels);
+    Array.prototype.push.apply(buffer.columnData[field.key].dlevels, data[field.key].dlevels);
+    Array.prototype.push.apply(buffer.columnData[field.key].values, data[field.key].values);
+    buffer.columnData[field.key].count += data[field.key].count;
   }
 }
 function shredRecordFields(fields, record, data, rLevel, dLevel) {
-  for (var name in fields) {
-    var field = fields[name];
-    var values = [];
+  for (const name in fields) {
+    const field = fields[name];
+    let 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];
@@ -97,8 +75,8 @@ function shredRecordFields(fields, record, data, rLevel, dLevel) {
       }
       continue;
     }
-    for (var i = 0; i < values.length; i++) {
-      var rlvl = i === 0 ? rLevel : field.rLevelMax;
+    for (let i = 0; i < values.length; i++) {
+      const rlvl = i === 0 ? rLevel : field.rLevelMax;
       if (field.isNested) {
         shredRecordFields(field.fields, values[i], data, rlvl, field.dLevelMax);
       } else {
@@ -111,12 +89,12 @@ function shredRecordFields(fields, record, data, rLevel, dLevel) {
   }
 }
 function materializeRecords(schema, buffer) {
-  var records = [];
-  for (var i = 0; i < buffer.rowCount; i++) {
+  const records = [];
+  for (let i = 0; i < buffer.rowCount; i++) {
     records.push({});
   }
-  for (var key in buffer.columnData) {
-    var columnData = buffer.columnData[key];
+  for (const key in buffer.columnData) {
+    const columnData = buffer.columnData[key];
     if (columnData.count) {
       materializeColumn(schema, columnData, key, records);
     }
@@ -124,55 +102,46 @@ function materializeRecords(schema, buffer) {
   return records;
 }
 function materializeColumn(schema, columnData, key, records) {
-  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 < columnData.count; i++) {
-    var dLevel = columnData.dlevels[i];
-    var rLevel = columnData.rlevels[i];
+  const field = schema.findField(key);
+  const branch = schema.findFieldBranch(key);
+  const rLevels = new Array(field.rLevelMax + 1).fill(0);
+  let vIndex = 0;
+  for (let i = 0; i < columnData.count; i++) {
+    const dLevel = columnData.dlevels[i];
+    const rLevel = columnData.rlevels[i];
     rLevels[rLevel]++;
     rLevels.fill(0, rLevel + 1);
-    var rIndex = 0;
-    var record = records[rLevels[rIndex++] - 1];
-    var _iterator3 = _createForOfIteratorHelper(branch),
-      _step3;
-    try {
-      for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
-        var step = _step3.value;
-        if (step === field || dLevel < step.dLevelMax) {
+    let rIndex = 0;
+    let record = records[rLevels[rIndex++] - 1];
+    for (const step of branch) {
+      if (step === field || dLevel < step.dLevelMax) {
+        break;
+      }
+      switch (step.repetitionType) {
+        case 'REPEATED':
+          if (!(step.name in record)) {
+            record[step.name] = [];
+          }
+          const ix = rLevels[rIndex++];
+          while (record[step.name].length <= ix) {
+            record[step.name].push({});
+          }
+          record = record[step.name][ix];
           break;
-        }
-        switch (step.repetitionType) {
-          case '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];
-            break;
-          default:
-            record[step.name] = record[step.name] || {};
-            record = record[step.name];
-        }
+        default:
+          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, columnData.values[vIndex], field);
+      const value = Types.fromPrimitive(field.originalType || field.primitiveType, columnData.values[vIndex], field);
       vIndex++;
       switch (field.repetitionType) {
         case 'REPEATED':
           if (!(field.name in record)) {
             record[field.name] = [];
           }
-          var ix = rLevels[rIndex];
+          const ix = rLevels[rIndex];
           while (record[field.name].length <= ix) {
             record[field.name].push(null);
           }

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

@@ -1 +1 @@
-{"version":3,"file":"shred.js","names":["_declare","require","Types","_interopRequireWildcard","_getRequireWildcardCache","nodeInterop","WeakMap","cacheBabelInterop","cacheNodeInterop","obj","__esModule","_typeof","default","cache","has","get","newObj","hasPropertyDescriptor","Object","defineProperty","getOwnPropertyDescriptor","key","prototype","hasOwnProperty","call","desc","set","_createForOfIteratorHelper","o","allowArrayLike","it","Symbol","iterator","Array","isArray","_unsupportedIterableToArray","length","i","F","s","n","done","value","e","_e","f","TypeError","normalCompletion","didErr","err","step","next","_e2","return","minLen","_arrayLikeToArray","toString","slice","constructor","name","from","test","arr","len","arr2","shredBuffer","schema","columnData","_iterator","fieldList","_step","field","dlevels","rlevels","values","pageHeaders","count","rowCount","shredRecord","record","buffer","data","shredRecordFields","fields","_iterator2","_step2","push","apply","rLevel","dLevel","undefined","Boolean","repetitionType","Error","concat","isNested","rlvl","rLevelMax","dLevelMax","toPrimitive","originalType","primitiveType","materializeRecords","records","materializeColumn","findField","branch","findFieldBranch","rLevels","fill","vIndex","rIndex","_iterator3","_step3","ix","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++) {\n    records.push({});\n  }\n  for (const key in buffer.columnData) {\n    const columnData = buffer.columnData[key];\n    if (columnData.count) {\n      materializeColumn(schema, columnData, key, records);\n    }\n  }\n  return records;\n}\n\n// eslint-disable-next-line max-statements, complexity\nfunction materializeColumn(\n  schema: ParquetSchema,\n  columnData: ParquetData,\n  key: string,\n  records: ParquetRecord[]\n): void {\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 < columnData.count; i++) {\n    const dLevel = columnData.dlevels[i];\n    const rLevel = columnData.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 - Build a nested row object\n    for (const step of branch) {\n      if (step === field || dLevel < step.dLevelMax) {\n        break;\n      }\n\n      switch (step.repetitionType) {\n        case '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          break;\n\n        default:\n          record[step.name] = record[step.name] || {};\n          record = record[step.name];\n      }\n    }\n\n    // Leaf node - Add the value\n    if (dLevel === field.dLevelMax) {\n      const value = Types.fromPrimitive(\n        // @ts-ignore\n        field.originalType || field.primitiveType,\n        columnData.values[vIndex],\n        field\n      );\n      vIndex++;\n\n      switch (field.repetitionType) {\n        case '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          break;\n\n        default:\n          record[field.name] = value;\n      }\n    }\n  }\n}\n\n// Columnar export\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 extractColumns(schema: ParquetSchema, buffer: ParquetBuffer): Record<string, unknown> {\n  const columns: ParquetRecord = {};\n  for (const key in buffer.columnData) {\n    const columnData = buffer.columnData[key];\n    if (columnData.count) {\n      extractColumn(schema, columnData, key, columns);\n    }\n  }\n  return columns;\n}\n\n// eslint-disable-next-line max-statements, complexity\nfunction extractColumn(\n  schema: ParquetSchema,\n  columnData: ParquetData,\n  key: string,\n  columns: Record<string, unknown> \n) {\n  if (columnData.count <= 0) {\n    return;\n  }\n\n  const record = columns;\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\n  let i = 0;\n  const dLevel = columnData.dlevels[i];\n  const rLevel = columnData.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 || dLevel < step.dLevelMax) {\n      break;\n    }\n\n    switch (step.repetitionType) {\n      case '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        break;\n\n      default:\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      columnData.values[vIndex],\n      field\n    );\n    vIndex++;\n\n    switch (field.repetitionType) {\n      case '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        break;\n\n      default:\n        record[field.name] = value;\n    }\n  }\n}\n*/\n"],"mappings":";;;;;;;;;;;;;;;AAEA,IAAAA,QAAA,GAAAC,OAAA;AAEA,IAAAC,KAAA,GAAAC,uBAAA,CAAAF,OAAA;AAAiC,SAAAG,yBAAAC,WAAA,eAAAC,OAAA,kCAAAC,iBAAA,OAAAD,OAAA,QAAAE,gBAAA,OAAAF,OAAA,YAAAF,wBAAA,YAAAA,yBAAAC,WAAA,WAAAA,WAAA,GAAAG,gBAAA,GAAAD,iBAAA,KAAAF,WAAA;AAAA,SAAAF,wBAAAM,GAAA,EAAAJ,WAAA,SAAAA,WAAA,IAAAI,GAAA,IAAAA,GAAA,CAAAC,UAAA,WAAAD,GAAA,QAAAA,GAAA,aAAAE,OAAA,CAAAF,GAAA,yBAAAA,GAAA,4BAAAG,OAAA,EAAAH,GAAA,UAAAI,KAAA,GAAAT,wBAAA,CAAAC,WAAA,OAAAQ,KAAA,IAAAA,KAAA,CAAAC,GAAA,CAAAL,GAAA,YAAAI,KAAA,CAAAE,GAAA,CAAAN,GAAA,SAAAO,MAAA,WAAAC,qBAAA,GAAAC,MAAA,CAAAC,cAAA,IAAAD,MAAA,CAAAE,wBAAA,WAAAC,GAAA,IAAAZ,GAAA,QAAAY,GAAA,kBAAAH,MAAA,CAAAI,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAf,GAAA,EAAAY,GAAA,SAAAI,IAAA,GAAAR,qBAAA,GAAAC,MAAA,CAAAE,wBAAA,CAAAX,GAAA,EAAAY,GAAA,cAAAI,IAAA,KAAAA,IAAA,CAAAV,GAAA,IAAAU,IAAA,CAAAC,GAAA,KAAAR,MAAA,CAAAC,cAAA,CAAAH,MAAA,EAAAK,GAAA,EAAAI,IAAA,YAAAT,MAAA,CAAAK,GAAA,IAAAZ,GAAA,CAAAY,GAAA,SAAAL,MAAA,CAAAJ,OAAA,GAAAH,GAAA,MAAAI,KAAA,IAAAA,KAAA,CAAAa,GAAA,CAAAjB,GAAA,EAAAO,MAAA,YAAAA,MAAA;AAAA,SAAAW,2BAAAC,CAAA,EAAAC,cAAA,QAAAC,EAAA,UAAAC,MAAA,oBAAAH,CAAA,CAAAG,MAAA,CAAAC,QAAA,KAAAJ,CAAA,qBAAAE,EAAA,QAAAG,KAAA,CAAAC,OAAA,CAAAN,CAAA,MAAAE,EAAA,GAAAK,2BAAA,CAAAP,CAAA,MAAAC,cAAA,IAAAD,CAAA,WAAAA,CAAA,CAAAQ,MAAA,qBAAAN,EAAA,EAAAF,CAAA,GAAAE,EAAA,MAAAO,CAAA,UAAAC,CAAA,YAAAA,EAAA,eAAAC,CAAA,EAAAD,CAAA,EAAAE,CAAA,WAAAA,EAAA,QAAAH,CAAA,IAAAT,CAAA,CAAAQ,MAAA,WAAAK,IAAA,mBAAAA,IAAA,SAAAC,KAAA,EAAAd,CAAA,CAAAS,CAAA,UAAAM,CAAA,WAAAA,EAAAC,EAAA,UAAAA,EAAA,KAAAC,CAAA,EAAAP,CAAA,gBAAAQ,SAAA,iJAAAC,gBAAA,SAAAC,MAAA,UAAAC,GAAA,WAAAV,CAAA,WAAAA,EAAA,IAAAT,EAAA,GAAAA,EAAA,CAAAN,IAAA,CAAAI,CAAA,MAAAY,CAAA,WAAAA,EAAA,QAAAU,IAAA,GAAApB,EAAA,CAAAqB,IAAA,IAAAJ,gBAAA,GAAAG,IAAA,CAAAT,IAAA,SAAAS,IAAA,KAAAP,CAAA,WAAAA,EAAAS,GAAA,IAAAJ,MAAA,SAAAC,GAAA,GAAAG,GAAA,KAAAP,CAAA,WAAAA,EAAA,eAAAE,gBAAA,IAAAjB,EAAA,CAAAuB,MAAA,UAAAvB,EAAA,CAAAuB,MAAA,oBAAAL,MAAA,QAAAC,GAAA;AAAA,SAAAd,4BAAAP,CAAA,EAAA0B,MAAA,SAAA1B,CAAA,qBAAAA,CAAA,sBAAA2B,iBAAA,CAAA3B,CAAA,EAAA0B,MAAA,OAAAd,CAAA,GAAAtB,MAAA,CAAAI,SAAA,CAAAkC,QAAA,CAAAhC,IAAA,CAAAI,CAAA,EAAA6B,KAAA,aAAAjB,CAAA,iBAAAZ,CAAA,CAAA8B,WAAA,EAAAlB,CAAA,GAAAZ,CAAA,CAAA8B,WAAA,CAAAC,IAAA,MAAAnB,CAAA,cAAAA,CAAA,mBAAAP,KAAA,CAAA2B,IAAA,CAAAhC,CAAA,OAAAY,CAAA,+DAAAqB,IAAA,CAAArB,CAAA,UAAAe,iBAAA,CAAA3B,CAAA,EAAA0B,MAAA;AAAA,SAAAC,kBAAAO,GAAA,EAAAC,GAAA,QAAAA,GAAA,YAAAA,GAAA,GAAAD,GAAA,CAAA1B,MAAA,EAAA2B,GAAA,GAAAD,GAAA,CAAA1B,MAAA,WAAAC,CAAA,MAAA2B,IAAA,OAAA/B,KAAA,CAAA8B,GAAA,GAAA1B,CAAA,GAAA0B,GAAA,EAAA1B,CAAA,IAAA2B,IAAA,CAAA3B,CAAA,IAAAyB,GAAA,CAAAzB,CAAA,UAAA2B,IAAA;AAI1B,SAASC,WAAWA,CAACC,MAAqB,EAAiB;EAChE,IAAMC,UAAuC,GAAG,CAAC,CAAC;EAAC,IAAAC,SAAA,GAAAzC,0BAAA,CAC/BuC,MAAM,CAACG,SAAS;IAAAC,KAAA;EAAA;IAApC,KAAAF,SAAA,CAAA7B,CAAA,MAAA+B,KAAA,GAAAF,SAAA,CAAA5B,CAAA,IAAAC,IAAA,GAAsC;MAAA,IAA3B8B,KAAK,GAAAD,KAAA,CAAA5B,KAAA;MACdyB,UAAU,CAACI,KAAK,CAAClD,GAAG,CAAC,GAAG;QACtBmD,OAAO,EAAE,EAAE;QACXC,OAAO,EAAE,EAAE;QACXC,MAAM,EAAE,EAAE;QACVC,WAAW,EAAE,EAAE;QACfC,KAAK,EAAE;MACT,CAAC;IACH;EAAC,SAAA3B,GAAA;IAAAmB,SAAA,CAAAzB,CAAA,CAAAM,GAAA;EAAA;IAAAmB,SAAA,CAAAvB,CAAA;EAAA;EACD,OAAO;IAACgC,QAAQ,EAAE,CAAC;IAAEV,UAAU,EAAVA;EAAU,CAAC;AAClC;AAwBO,SAASW,WAAWA,CAACZ,MAAqB,EAAEa,MAAW,EAAEC,MAAqB,EAAQ;EAE3F,IAAMC,IAAI,GAAGhB,WAAW,CAACC,MAAM,CAAC,CAACC,UAAU;EAE3Ce,iBAAiB,CAAChB,MAAM,CAACiB,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,CAACb,UAAU,GAAGc,IAAI;IACxB;EACF;EACAD,MAAM,CAACH,QAAQ,IAAI,CAAC;EAAC,IAAAO,UAAA,GAAAzD,0BAAA,CACDuC,MAAM,CAACG,SAAS;IAAAgB,MAAA;EAAA;IAApC,KAAAD,UAAA,CAAA7C,CAAA,MAAA8C,MAAA,GAAAD,UAAA,CAAA5C,CAAA,IAAAC,IAAA,GAAsC;MAAA,IAA3B8B,KAAK,GAAAc,MAAA,CAAA3C,KAAA;MACdT,KAAK,CAACX,SAAS,CAACgE,IAAI,CAACC,KAAK,CAACP,MAAM,CAACb,UAAU,CAACI,KAAK,CAAClD,GAAG,CAAC,CAACoD,OAAO,EAAEQ,IAAI,CAACV,KAAK,CAAClD,GAAG,CAAC,CAACoD,OAAO,CAAC;MACzFxC,KAAK,CAACX,SAAS,CAACgE,IAAI,CAACC,KAAK,CAACP,MAAM,CAACb,UAAU,CAACI,KAAK,CAAClD,GAAG,CAAC,CAACmD,OAAO,EAAES,IAAI,CAACV,KAAK,CAAClD,GAAG,CAAC,CAACmD,OAAO,CAAC;MACzFvC,KAAK,CAACX,SAAS,CAACgE,IAAI,CAACC,KAAK,CAACP,MAAM,CAACb,UAAU,CAACI,KAAK,CAAClD,GAAG,CAAC,CAACqD,MAAM,EAAEO,IAAI,CAACV,KAAK,CAAClD,GAAG,CAAC,CAACqD,MAAM,CAAC;MACvFM,MAAM,CAACb,UAAU,CAACI,KAAK,CAAClD,GAAG,CAAC,CAACuD,KAAK,IAAIK,IAAI,CAACV,KAAK,CAAClD,GAAG,CAAC,CAACuD,KAAK;IAC7D;EAAC,SAAA3B,GAAA;IAAAmC,UAAA,CAAAzC,CAAA,CAAAM,GAAA;EAAA;IAAAmC,UAAA,CAAAvC,CAAA;EAAA;AACH;AAGA,SAASqC,iBAAiBA,CACxBC,MAAoC,EACpCJ,MAAW,EACXE,IAAiC,EACjCO,MAAc,EACdC,MAAc,EACd;EACA,KAAK,IAAM9B,IAAI,IAAIwB,MAAM,EAAE;IACzB,IAAMZ,KAAK,GAAGY,MAAM,CAACxB,IAAI,CAAC;IAG1B,IAAIe,MAAa,GAAG,EAAE;IACtB,IACEK,MAAM,IACNR,KAAK,CAACZ,IAAI,IAAIoB,MAAM,IACpBA,MAAM,CAACR,KAAK,CAACZ,IAAI,CAAC,KAAK+B,SAAS,IAChCX,MAAM,CAACR,KAAK,CAACZ,IAAI,CAAC,KAAK,IAAI,EAC3B;MACA,IAAIoB,MAAM,CAACR,KAAK,CAACZ,IAAI,CAAC,CAACD,WAAW,KAAKzB,KAAK,EAAE;QAC5CyC,MAAM,GAAGK,MAAM,CAACR,KAAK,CAACZ,IAAI,CAAC;MAC7B,CAAC,MAAM;QACLe,MAAM,CAACY,IAAI,CAACP,MAAM,CAACR,KAAK,CAACZ,IAAI,CAAC,CAAC;MACjC;IACF;IAEA,IAAIe,MAAM,CAACtC,MAAM,KAAK,CAAC,IAAIuD,OAAO,CAACZ,MAAM,CAAC,IAAIR,KAAK,CAACqB,cAAc,KAAK,UAAU,EAAE;MACjF,MAAM,IAAIC,KAAK,4BAAAC,MAAA,CAA4BvB,KAAK,CAACZ,IAAI,CAAE,CAAC;IAC1D;IACA,IAAIe,MAAM,CAACtC,MAAM,GAAG,CAAC,IAAImC,KAAK,CAACqB,cAAc,KAAK,UAAU,EAAE;MAC5D,MAAM,IAAIC,KAAK,+BAAAC,MAAA,CAA+BvB,KAAK,CAACZ,IAAI,CAAE,CAAC;IAC7D;IAGA,IAAIe,MAAM,CAACtC,MAAM,KAAK,CAAC,EAAE;MACvB,IAAImC,KAAK,CAACwB,QAAQ,EAAE;QAClBb,iBAAiB,CAACX,KAAK,CAACY,MAAM,EAAG,IAAI,EAAEF,IAAI,EAAEO,MAAM,EAAEC,MAAM,CAAC;MAC9D,CAAC,MAAM;QACLR,IAAI,CAACV,KAAK,CAAClD,GAAG,CAAC,CAACuD,KAAK,IAAI,CAAC;QAC1BK,IAAI,CAACV,KAAK,CAAClD,GAAG,CAAC,CAACoD,OAAO,CAACa,IAAI,CAACE,MAAM,CAAC;QACpCP,IAAI,CAACV,KAAK,CAAClD,GAAG,CAAC,CAACmD,OAAO,CAACc,IAAI,CAACG,MAAM,CAAC;MACtC;MACA;IACF;IAGA,KAAK,IAAIpD,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGqC,MAAM,CAACtC,MAAM,EAAEC,CAAC,EAAE,EAAE;MACtC,IAAM2D,IAAI,GAAG3D,CAAC,KAAK,CAAC,GAAGmD,MAAM,GAAGjB,KAAK,CAAC0B,SAAS;MAC/C,IAAI1B,KAAK,CAACwB,QAAQ,EAAE;QAClBb,iBAAiB,CAACX,KAAK,CAACY,MAAM,EAAGT,MAAM,CAACrC,CAAC,CAAC,EAAE4C,IAAI,EAAEe,IAAI,EAAEzB,KAAK,CAAC2B,SAAS,CAAC;MAC1E,CAAC,MAAM;QACLjB,IAAI,CAACV,KAAK,CAAClD,GAAG,CAAC,CAACuD,KAAK,IAAI,CAAC;QAC1BK,IAAI,CAACV,KAAK,CAAClD,GAAG,CAAC,CAACoD,OAAO,CAACa,IAAI,CAACU,IAAI,CAAC;QAClCf,IAAI,CAACV,KAAK,CAAClD,GAAG,CAAC,CAACmD,OAAO,CAACc,IAAI,CAACf,KAAK,CAAC2B,SAAS,CAAC;QAC7CjB,IAAI,CAACV,KAAK,CAAClD,GAAG,CAAC,CAACqD,MAAM,CAACY,IAAI,CACzBpF,KAAK,CAACiG,WAAW,CAAE5B,KAAK,CAAC6B,YAAY,IAAI7B,KAAK,CAAC8B,aAAa,EAAI3B,MAAM,CAACrC,CAAC,CAAC,CAC3E,CAAC;MACH;IACF;EACF;AACF;AAqBO,SAASiE,kBAAkBA,CAACpC,MAAqB,EAAEc,MAAqB,EAAmB;EAChG,IAAMuB,OAAwB,GAAG,EAAE;EACnC,KAAK,IAAIlE,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG2C,MAAM,CAACH,QAAQ,EAAExC,CAAC,EAAE,EAAE;IACxCkE,OAAO,CAACjB,IAAI,CAAC,CAAC,CAAC,CAAC;EAClB;EACA,KAAK,IAAMjE,GAAG,IAAI2D,MAAM,CAACb,UAAU,EAAE;IACnC,IAAMA,UAAU,GAAGa,MAAM,CAACb,UAAU,CAAC9C,GAAG,CAAC;IACzC,IAAI8C,UAAU,CAACS,KAAK,EAAE;MACpB4B,iBAAiB,CAACtC,MAAM,EAAEC,UAAU,EAAE9C,GAAG,EAAEkF,OAAO,CAAC;IACrD;EACF;EACA,OAAOA,OAAO;AAChB;AAGA,SAASC,iBAAiBA,CACxBtC,MAAqB,EACrBC,UAAuB,EACvB9C,GAAW,EACXkF,OAAwB,EAClB;EACN,IAAMhC,KAAK,GAAGL,MAAM,CAACuC,SAAS,CAACpF,GAAG,CAAC;EACnC,IAAMqF,MAAM,GAAGxC,MAAM,CAACyC,eAAe,CAACtF,GAAG,CAAC;EAG1C,IAAMuF,OAAiB,GAAG,IAAI3E,KAAK,CAACsC,KAAK,CAAC0B,SAAS,GAAG,CAAC,CAAC,CAACY,IAAI,CAAC,CAAC,CAAC;EAChE,IAAIC,MAAM,GAAG,CAAC;EACd,KAAK,IAAIzE,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG8B,UAAU,CAACS,KAAK,EAAEvC,CAAC,EAAE,EAAE;IACzC,IAAMoD,MAAM,GAAGtB,UAAU,CAACK,OAAO,CAACnC,CAAC,CAAC;IACpC,IAAMmD,MAAM,GAAGrB,UAAU,CAACM,OAAO,CAACpC,CAAC,CAAC;IACpCuE,OAAO,CAACpB,MAAM,CAAC,EAAE;IACjBoB,OAAO,CAACC,IAAI,CAAC,CAAC,EAAErB,MAAM,GAAG,CAAC,CAAC;IAE3B,IAAIuB,MAAM,GAAG,CAAC;IACd,IAAIhC,MAAM,GAAGwB,OAAO,CAACK,OAAO,CAACG,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC;IAAC,IAAAC,UAAA,GAAArF,0BAAA,CAGzB+E,MAAM;MAAAO,MAAA;IAAA;MAAzB,KAAAD,UAAA,CAAAzE,CAAA,MAAA0E,MAAA,GAAAD,UAAA,CAAAxE,CAAA,IAAAC,IAAA,GAA2B;QAAA,IAAhBS,IAAI,GAAA+D,MAAA,CAAAvE,KAAA;QACb,IAAIQ,IAAI,KAAKqB,KAAK,IAAIkB,MAAM,GAAGvC,IAAI,CAACgD,SAAS,EAAE;UAC7C;QACF;QAEA,QAAQhD,IAAI,CAAC0C,cAAc;UACzB,KAAK,UAAU;YACb,IAAI,EAAE1C,IAAI,CAACS,IAAI,IAAIoB,MAAM,CAAC,EAAE;cAE1BA,MAAM,CAAC7B,IAAI,CAACS,IAAI,CAAC,GAAG,EAAE;YACxB;YACA,IAAMuD,GAAE,GAAGN,OAAO,CAACG,MAAM,EAAE,CAAC;YAC5B,OAAOhC,MAAM,CAAC7B,IAAI,CAACS,IAAI,CAAC,CAACvB,MAAM,IAAI8E,GAAE,EAAE;cAErCnC,MAAM,CAAC7B,IAAI,CAACS,IAAI,CAAC,CAAC2B,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B;YACAP,MAAM,GAAGA,MAAM,CAAC7B,IAAI,CAACS,IAAI,CAAC,CAACuD,GAAE,CAAC;YAC9B;UAEF;YACEnC,MAAM,CAAC7B,IAAI,CAACS,IAAI,CAAC,GAAGoB,MAAM,CAAC7B,IAAI,CAACS,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3CoB,MAAM,GAAGA,MAAM,CAAC7B,IAAI,CAACS,IAAI,CAAC;QAC9B;MACF;IAAC,SAAAV,GAAA;MAAA+D,UAAA,CAAArE,CAAA,CAAAM,GAAA;IAAA;MAAA+D,UAAA,CAAAnE,CAAA;IAAA;IAGD,IAAI4C,MAAM,KAAKlB,KAAK,CAAC2B,SAAS,EAAE;MAC9B,IAAMxD,KAAK,GAAGxC,KAAK,CAACiH,aAAa,CAE/B5C,KAAK,CAAC6B,YAAY,IAAI7B,KAAK,CAAC8B,aAAa,EACzClC,UAAU,CAACO,MAAM,CAACoC,MAAM,CAAC,EACzBvC,KACF,CAAC;MACDuC,MAAM,EAAE;MAER,QAAQvC,KAAK,CAACqB,cAAc;QAC1B,KAAK,UAAU;UACb,IAAI,EAAErB,KAAK,CAACZ,IAAI,IAAIoB,MAAM,CAAC,EAAE;YAE3BA,MAAM,CAACR,KAAK,CAACZ,IAAI,CAAC,GAAG,EAAE;UACzB;UACA,IAAMuD,EAAE,GAAGN,OAAO,CAACG,MAAM,CAAC;UAC1B,OAAOhC,MAAM,CAACR,KAAK,CAACZ,IAAI,CAAC,CAACvB,MAAM,IAAI8E,EAAE,EAAE;YAEtCnC,MAAM,CAACR,KAAK,CAACZ,IAAI,CAAC,CAAC2B,IAAI,CAAC,IAAI,CAAC;UAC/B;UACAP,MAAM,CAACR,KAAK,CAACZ,IAAI,CAAC,CAACuD,EAAE,CAAC,GAAGxE,KAAK;UAC9B;QAEF;UACEqC,MAAM,CAACR,KAAK,CAACZ,IAAI,CAAC,GAAGjB,KAAK;MAC9B;IACF;EACF;AACF"}
+{"version":3,"file":"shred.js","names":["_declare","require","Types","_interopRequireWildcard","_getRequireWildcardCache","nodeInterop","WeakMap","cacheBabelInterop","cacheNodeInterop","obj","__esModule","default","cache","has","get","newObj","hasPropertyDescriptor","Object","defineProperty","getOwnPropertyDescriptor","key","prototype","hasOwnProperty","call","desc","set","shredBuffer","schema","columnData","field","fieldList","dlevels","rlevels","values","pageHeaders","count","rowCount","shredRecord","record","buffer","data","shredRecordFields","fields","Array","push","apply","rLevel","dLevel","name","undefined","constructor","length","Boolean","repetitionType","Error","concat","isNested","i","rlvl","rLevelMax","dLevelMax","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++) {\n    records.push({});\n  }\n  for (const key in buffer.columnData) {\n    const columnData = buffer.columnData[key];\n    if (columnData.count) {\n      materializeColumn(schema, columnData, key, records);\n    }\n  }\n  return records;\n}\n\n// eslint-disable-next-line max-statements, complexity\nfunction materializeColumn(\n  schema: ParquetSchema,\n  columnData: ParquetData,\n  key: string,\n  records: ParquetRecord[]\n): void {\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 < columnData.count; i++) {\n    const dLevel = columnData.dlevels[i];\n    const rLevel = columnData.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 - Build a nested row object\n    for (const step of branch) {\n      if (step === field || dLevel < step.dLevelMax) {\n        break;\n      }\n\n      switch (step.repetitionType) {\n        case '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          break;\n\n        default:\n          record[step.name] = record[step.name] || {};\n          record = record[step.name];\n      }\n    }\n\n    // Leaf node - Add the value\n    if (dLevel === field.dLevelMax) {\n      const value = Types.fromPrimitive(\n        // @ts-ignore\n        field.originalType || field.primitiveType,\n        columnData.values[vIndex],\n        field\n      );\n      vIndex++;\n\n      switch (field.repetitionType) {\n        case '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          break;\n\n        default:\n          record[field.name] = value;\n      }\n    }\n  }\n}\n\n// Columnar export\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 extractColumns(schema: ParquetSchema, buffer: ParquetBuffer): Record<string, unknown> {\n  const columns: ParquetRecord = {};\n  for (const key in buffer.columnData) {\n    const columnData = buffer.columnData[key];\n    if (columnData.count) {\n      extractColumn(schema, columnData, key, columns);\n    }\n  }\n  return columns;\n}\n\n// eslint-disable-next-line max-statements, complexity\nfunction extractColumn(\n  schema: ParquetSchema,\n  columnData: ParquetData,\n  key: string,\n  columns: Record<string, unknown> \n) {\n  if (columnData.count <= 0) {\n    return;\n  }\n\n  const record = columns;\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\n  let i = 0;\n  const dLevel = columnData.dlevels[i];\n  const rLevel = columnData.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 || dLevel < step.dLevelMax) {\n      break;\n    }\n\n    switch (step.repetitionType) {\n      case '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        break;\n\n      default:\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      columnData.values[vIndex],\n      field\n    );\n    vIndex++;\n\n    switch (field.repetitionType) {\n      case '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        break;\n\n      default:\n        record[field.name] = value;\n    }\n  }\n}\n*/\n"],"mappings":";;;;;;;;;;;;;;AAEA,IAAAA,QAAA,GAAAC,OAAA;AAEA,IAAAC,KAAA,GAAAC,uBAAA,CAAAF,OAAA;AAAiC,SAAAG,yBAAAC,WAAA,eAAAC,OAAA,kCAAAC,iBAAA,OAAAD,OAAA,QAAAE,gBAAA,OAAAF,OAAA,YAAAF,wBAAA,YAAAA,CAAAC,WAAA,WAAAA,WAAA,GAAAG,gBAAA,GAAAD,iBAAA,KAAAF,WAAA;AAAA,SAAAF,wBAAAM,GAAA,EAAAJ,WAAA,SAAAA,WAAA,IAAAI,GAAA,IAAAA,GAAA,CAAAC,UAAA,WAAAD,GAAA,QAAAA,GAAA,oBAAAA,GAAA,wBAAAA,GAAA,4BAAAE,OAAA,EAAAF,GAAA,UAAAG,KAAA,GAAAR,wBAAA,CAAAC,WAAA,OAAAO,KAAA,IAAAA,KAAA,CAAAC,GAAA,CAAAJ,GAAA,YAAAG,KAAA,CAAAE,GAAA,CAAAL,GAAA,SAAAM,MAAA,WAAAC,qBAAA,GAAAC,MAAA,CAAAC,cAAA,IAAAD,MAAA,CAAAE,wBAAA,WAAAC,GAAA,IAAAX,GAAA,QAAAW,GAAA,kBAAAH,MAAA,CAAAI,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAd,GAAA,EAAAW,GAAA,SAAAI,IAAA,GAAAR,qBAAA,GAAAC,MAAA,CAAAE,wBAAA,CAAAV,GAAA,EAAAW,GAAA,cAAAI,IAAA,KAAAA,IAAA,CAAAV,GAAA,IAAAU,IAAA,CAAAC,GAAA,KAAAR,MAAA,CAAAC,cAAA,CAAAH,MAAA,EAAAK,GAAA,EAAAI,IAAA,YAAAT,MAAA,CAAAK,GAAA,IAAAX,GAAA,CAAAW,GAAA,SAAAL,MAAA,CAAAJ,OAAA,GAAAF,GAAA,MAAAG,KAAA,IAAAA,KAAA,CAAAa,GAAA,CAAAhB,GAAA,EAAAM,MAAA,YAAAA,MAAA;AAI1B,SAASW,WAAWA,CAACC,MAAqB,EAAiB;EAChE,MAAMC,UAAuC,GAAG,CAAC,CAAC;EAClD,KAAK,MAAMC,KAAK,IAAIF,MAAM,CAACG,SAAS,EAAE;IACpCF,UAAU,CAACC,KAAK,CAACT,GAAG,CAAC,GAAG;MACtBW,OAAO,EAAE,EAAE;MACXC,OAAO,EAAE,EAAE;MACXC,MAAM,EAAE,EAAE;MACVC,WAAW,EAAE,EAAE;MACfC,KAAK,EAAE;IACT,CAAC;EACH;EACA,OAAO;IAACC,QAAQ,EAAE,CAAC;IAAER;EAAU,CAAC;AAClC;AAwBO,SAASS,WAAWA,CAACV,MAAqB,EAAEW,MAAW,EAAEC,MAAqB,EAAQ;EAE3F,MAAMC,IAAI,GAAGd,WAAW,CAACC,MAAM,CAAC,CAACC,UAAU;EAE3Ca,iBAAiB,CAACd,MAAM,CAACe,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,CAACX,UAAU,GAAGY,IAAI;IACxB;EACF;EACAD,MAAM,CAACH,QAAQ,IAAI,CAAC;EACpB,KAAK,MAAMP,KAAK,IAAIF,MAAM,CAACG,SAAS,EAAE;IACpCa,KAAK,CAACtB,SAAS,CAACuB,IAAI,CAACC,KAAK,CAACN,MAAM,CAACX,UAAU,CAACC,KAAK,CAACT,GAAG,CAAC,CAACY,OAAO,EAAEQ,IAAI,CAACX,KAAK,CAACT,GAAG,CAAC,CAACY,OAAO,CAAC;IACzFW,KAAK,CAACtB,SAAS,CAACuB,IAAI,CAACC,KAAK,CAACN,MAAM,CAACX,UAAU,CAACC,KAAK,CAACT,GAAG,CAAC,CAACW,OAAO,EAAES,IAAI,CAACX,KAAK,CAACT,GAAG,CAAC,CAACW,OAAO,CAAC;IACzFY,KAAK,CAACtB,SAAS,CAACuB,IAAI,CAACC,KAAK,CAACN,MAAM,CAACX,UAAU,CAACC,KAAK,CAACT,GAAG,CAAC,CAACa,MAAM,EAAEO,IAAI,CAACX,KAAK,CAACT,GAAG,CAAC,CAACa,MAAM,CAAC;IACvFM,MAAM,CAACX,UAAU,CAACC,KAAK,CAACT,GAAG,CAAC,CAACe,KAAK,IAAIK,IAAI,CAACX,KAAK,CAACT,GAAG,CAAC,CAACe,KAAK;EAC7D;AACF;AAGA,SAASM,iBAAiBA,CACxBC,MAAoC,EACpCJ,MAAW,EACXE,IAAiC,EACjCM,MAAc,EACdC,MAAc,EACd;EACA,KAAK,MAAMC,IAAI,IAAIN,MAAM,EAAE;IACzB,MAAMb,KAAK,GAAGa,MAAM,CAACM,IAAI,CAAC;IAG1B,IAAIf,MAAa,GAAG,EAAE;IACtB,IACEK,MAAM,IACNT,KAAK,CAACmB,IAAI,IAAIV,MAAM,IACpBA,MAAM,CAACT,KAAK,CAACmB,IAAI,CAAC,KAAKC,SAAS,IAChCX,MAAM,CAACT,KAAK,CAACmB,IAAI,CAAC,KAAK,IAAI,EAC3B;MACA,IAAIV,MAAM,CAACT,KAAK,CAACmB,IAAI,CAAC,CAACE,WAAW,KAAKP,KAAK,EAAE;QAC5CV,MAAM,GAAGK,MAAM,CAACT,KAAK,CAACmB,IAAI,CAAC;MAC7B,CAAC,MAAM;QACLf,MAAM,CAACW,IAAI,CAACN,MAAM,CAACT,KAAK,CAACmB,IAAI,CAAC,CAAC;MACjC;IACF;IAEA,IAAIf,MAAM,CAACkB,MAAM,KAAK,CAAC,IAAIC,OAAO,CAACd,MAAM,CAAC,IAAIT,KAAK,CAACwB,cAAc,KAAK,UAAU,EAAE;MACjF,MAAM,IAAIC,KAAK,4BAAAC,MAAA,CAA4B1B,KAAK,CAACmB,IAAI,CAAE,CAAC;IAC1D;IACA,IAAIf,MAAM,CAACkB,MAAM,GAAG,CAAC,IAAItB,KAAK,CAACwB,cAAc,KAAK,UAAU,EAAE;MAC5D,MAAM,IAAIC,KAAK,+BAAAC,MAAA,CAA+B1B,KAAK,CAACmB,IAAI,CAAE,CAAC;IAC7D;IAGA,IAAIf,MAAM,CAACkB,MAAM,KAAK,CAAC,EAAE;MACvB,IAAItB,KAAK,CAAC2B,QAAQ,EAAE;QAClBf,iBAAiB,CAACZ,KAAK,CAACa,MAAM,EAAG,IAAI,EAAEF,IAAI,EAAEM,MAAM,EAAEC,MAAM,CAAC;MAC9D,CAAC,MAAM;QACLP,IAAI,CAACX,KAAK,CAACT,GAAG,CAAC,CAACe,KAAK,IAAI,CAAC;QAC1BK,IAAI,CAACX,KAAK,CAACT,GAAG,CAAC,CAACY,OAAO,CAACY,IAAI,CAACE,MAAM,CAAC;QACpCN,IAAI,CAACX,KAAK,CAACT,GAAG,CAAC,CAACW,OAAO,CAACa,IAAI,CAACG,MAAM,CAAC;MACtC;MACA;IACF;IAGA,KAAK,IAAIU,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGxB,MAAM,CAACkB,MAAM,EAAEM,CAAC,EAAE,EAAE;MACtC,MAAMC,IAAI,GAAGD,CAAC,KAAK,CAAC,GAAGX,MAAM,GAAGjB,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,CAACT,GAAG,CAAC,CAACe,KAAK,IAAI,CAAC;QAC1BK,IAAI,CAACX,KAAK,CAACT,GAAG,CAAC,CAACY,OAAO,CAACY,IAAI,CAACc,IAAI,CAAC;QAClClB,IAAI,CAACX,KAAK,CAACT,GAAG,CAAC,CAACW,OAAO,CAACa,IAAI,CAACf,KAAK,CAAC+B,SAAS,CAAC;QAC7CpB,IAAI,CAACX,KAAK,CAACT,GAAG,CAAC,CAACa,MAAM,CAACW,IAAI,CACzB1C,KAAK,CAAC2D,WAAW,CAAEhC,KAAK,CAACiC,YAAY,IAAIjC,KAAK,CAACkC,aAAa,EAAI9B,MAAM,CAACwB,CAAC,CAAC,CAC3E,CAAC;MACH;IACF;EACF;AACF;AAqBO,SAASO,kBAAkBA,CAACrC,MAAqB,EAAEY,MAAqB,EAAmB;EAChG,MAAM0B,OAAwB,GAAG,EAAE;EACnC,KAAK,IAAIR,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGlB,MAAM,CAACH,QAAQ,EAAEqB,CAAC,EAAE,EAAE;IACxCQ,OAAO,CAACrB,IAAI,CAAC,CAAC,CAAC,CAAC;EAClB;EACA,KAAK,MAAMxB,GAAG,IAAImB,MAAM,CAACX,UAAU,EAAE;IACnC,MAAMA,UAAU,GAAGW,MAAM,CAACX,UAAU,CAACR,GAAG,CAAC;IACzC,IAAIQ,UAAU,CAACO,KAAK,EAAE;MACpB+B,iBAAiB,CAACvC,MAAM,EAAEC,UAAU,EAAER,GAAG,EAAE6C,OAAO,CAAC;IACrD;EACF;EACA,OAAOA,OAAO;AAChB;AAGA,SAASC,iBAAiBA,CACxBvC,MAAqB,EACrBC,UAAuB,EACvBR,GAAW,EACX6C,OAAwB,EAClB;EACN,MAAMpC,KAAK,GAAGF,MAAM,CAACwC,SAAS,CAAC/C,GAAG,CAAC;EACnC,MAAMgD,MAAM,GAAGzC,MAAM,CAAC0C,eAAe,CAACjD,GAAG,CAAC;EAG1C,MAAMkD,OAAiB,GAAG,IAAI3B,KAAK,CAACd,KAAK,CAAC8B,SAAS,GAAG,CAAC,CAAC,CAACY,IAAI,CAAC,CAAC,CAAC;EAChE,IAAIC,MAAM,GAAG,CAAC;EACd,KAAK,IAAIf,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG7B,UAAU,CAACO,KAAK,EAAEsB,CAAC,EAAE,EAAE;IACzC,MAAMV,MAAM,GAAGnB,UAAU,CAACG,OAAO,CAAC0B,CAAC,CAAC;IACpC,MAAMX,MAAM,GAAGlB,UAAU,CAACI,OAAO,CAACyB,CAAC,CAAC;IACpCa,OAAO,CAACxB,MAAM,CAAC,EAAE;IACjBwB,OAAO,CAACC,IAAI,CAAC,CAAC,EAAEzB,MAAM,GAAG,CAAC,CAAC;IAE3B,IAAI2B,MAAM,GAAG,CAAC;IACd,IAAInC,MAAM,GAAG2B,OAAO,CAACK,OAAO,CAACG,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC;IAG3C,KAAK,MAAMC,IAAI,IAAIN,MAAM,EAAE;MACzB,IAAIM,IAAI,KAAK7C,KAAK,IAAIkB,MAAM,GAAG2B,IAAI,CAACd,SAAS,EAAE;QAC7C;MACF;MAEA,QAAQc,IAAI,CAACrB,cAAc;QACzB,KAAK,UAAU;UACb,IAAI,EAAEqB,IAAI,CAAC1B,IAAI,IAAIV,MAAM,CAAC,EAAE;YAE1BA,MAAM,CAACoC,IAAI,CAAC1B,IAAI,CAAC,GAAG,EAAE;UACxB;UACA,MAAM2B,EAAE,GAAGL,OAAO,CAACG,MAAM,EAAE,CAAC;UAC5B,OAAOnC,MAAM,CAACoC,IAAI,CAAC1B,IAAI,CAAC,CAACG,MAAM,IAAIwB,EAAE,EAAE;YAErCrC,MAAM,CAACoC,IAAI,CAAC1B,IAAI,CAAC,CAACJ,IAAI,CAAC,CAAC,CAAC,CAAC;UAC5B;UACAN,MAAM,GAAGA,MAAM,CAACoC,IAAI,CAAC1B,IAAI,CAAC,CAAC2B,EAAE,CAAC;UAC9B;QAEF;UACErC,MAAM,CAACoC,IAAI,CAAC1B,IAAI,CAAC,GAAGV,MAAM,CAACoC,IAAI,CAAC1B,IAAI,CAAC,IAAI,CAAC,CAAC;UAC3CV,MAAM,GAAGA,MAAM,CAACoC,IAAI,CAAC1B,IAAI,CAAC;MAC9B;IACF;IAGA,IAAID,MAAM,KAAKlB,KAAK,CAAC+B,SAAS,EAAE;MAC9B,MAAMgB,KAAK,GAAG1E,KAAK,CAAC2E,aAAa,CAE/BhD,KAAK,CAACiC,YAAY,IAAIjC,KAAK,CAACkC,aAAa,EACzCnC,UAAU,CAACK,MAAM,CAACuC,MAAM,CAAC,EACzB3C,KACF,CAAC;MACD2C,MAAM,EAAE;MAER,QAAQ3C,KAAK,CAACwB,cAAc;QAC1B,KAAK,UAAU;UACb,IAAI,EAAExB,KAAK,CAACmB,IAAI,IAAIV,MAAM,CAAC,EAAE;YAE3BA,MAAM,CAACT,KAAK,CAACmB,IAAI,CAAC,GAAG,EAAE;UACzB;UACA,MAAM2B,EAAE,GAAGL,OAAO,CAACG,MAAM,CAAC;UAC1B,OAAOnC,MAAM,CAACT,KAAK,CAACmB,IAAI,CAAC,CAACG,MAAM,IAAIwB,EAAE,EAAE;YAEtCrC,MAAM,CAACT,KAAK,CAACmB,IAAI,CAAC,CAACJ,IAAI,CAAC,IAAI,CAAC;UAC/B;UACAN,MAAM,CAACT,KAAK,CAACmB,IAAI,CAAC,CAAC2B,EAAE,CAAC,GAAGC,KAAK;UAC9B;QAEF;UACEtC,MAAM,CAACT,KAAK,CAACmB,IAAI,CAAC,GAAG4B,KAAK;MAC9B;IACF;EACF;AACF"}

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

@@ -7,7 +7,7 @@ exports.PARQUET_LOGICAL_TYPES = void 0;
 exports.fromPrimitive = fromPrimitive;
 exports.toPrimitive = toPrimitive;
 var _bson = require("@loaders.gl/bson");
-var PARQUET_LOGICAL_TYPES = {
+const PARQUET_LOGICAL_TYPES = {
   BOOLEAN: {
     primitiveType: 'BOOLEAN',
     toPrimitive: toPrimitive_BOOLEAN,
@@ -183,93 +183,93 @@ function fromPrimitive_BOOLEAN(value) {
   return Boolean(value);
 }
 function toPrimitive_FLOAT(value) {
-  var v = parseFloat(value);
+  const 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);
+  const 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);
+  const 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);
+  const 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);
+  const 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);
+  const 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);
+  const 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));
+  const primitiveValue = value * 10 ** (field.scale || 0);
+  const v = Math.round(primitiveValue * 10 ** -field.presision % 1 * 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);
+  const 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);
+  const 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));
+  const primitiveValue = value * 10 ** (field.scale || 0);
+  const v = Math.round(primitiveValue * 10 ** -field.presision % 1 * 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);
+  const 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);
+  const v = parseInt(value, 10);
   if (isNaN(v)) {
     throw new Error("invalid value for INT96: ".concat(value));
   }
@@ -295,7 +295,7 @@ function fromPrimitive_JSON(value) {
 }
 function toPrimitive_BSON(value) {
   var _BSONWriter$encodeSyn;
-  var arrayBuffer = (_BSONWriter$encodeSyn = _bson.BSONWriter.encodeSync) === null || _BSONWriter$encodeSyn === void 0 ? void 0 : _BSONWriter$encodeSyn.call(_bson.BSONWriter, value);
+  const arrayBuffer = (_BSONWriter$encodeSyn = _bson.BSONWriter.encodeSync) === null || _BSONWriter$encodeSyn === void 0 ? void 0 : _BSONWriter$encodeSyn.call(_bson.BSONWriter, value);
   return Buffer.from(arrayBuffer);
 }
 function fromPrimitive_BSON(value) {
@@ -303,26 +303,26 @@ function fromPrimitive_BSON(value) {
   return (_BSONLoader$parseSync = _bson.BSONLoader.parseSync) === null || _BSONLoader$parseSync === void 0 ? void 0 : _BSONLoader$parseSync.call(_bson.BSONLoader, value);
 }
 function toPrimitive_TIME_MILLIS(value) {
-  var v = parseInt(value, 10);
+  const 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);
+  const v = parseInt(value, 10);
   if (v < 0 || isNaN(v)) {
     throw new Error("invalid value for TIME_MICROS: ".concat(value));
   }
   return v;
 }
-var kMillisPerDay = 86400000;
+const kMillisPerDay = 86400000;
 function toPrimitive_DATE(value) {
   if (value instanceof Date) {
     return value.getTime() / kMillisPerDay;
   }
   {
-    var v = parseInt(value, 10);
+    const v = parseInt(value, 10);
     if (v < 0 || isNaN(v)) {
       throw new Error("invalid value for DATE: ".concat(value));
     }
@@ -337,7 +337,7 @@ function toPrimitive_TIMESTAMP_MILLIS(value) {
     return value.getTime();
   }
   {
-    var v = parseInt(value, 10);
+    const v = parseInt(value, 10);
     if (v < 0 || isNaN(v)) {
       throw new Error("invalid value for TIMESTAMP_MILLIS: ".concat(value));
     }
@@ -352,7 +352,7 @@ function toPrimitive_TIMESTAMP_MICROS(value) {
     return value.getTime() * 1000;
   }
   {
-    var v = parseInt(value, 10);
+    const v = parseInt(value, 10);
     if (v < 0 || isNaN(v)) {
       throw new Error("invalid value for TIMESTAMP_MICROS: ".concat(value));
     }
@@ -366,41 +366,41 @@ 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);
+  const 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);
-  var days = buf.readUInt32LE(4);
-  var millis = buf.readUInt32LE(8);
+  const buf = Buffer.from(value);
+  const months = buf.readUInt32LE(0);
+  const days = buf.readUInt32LE(4);
+  const millis = buf.readUInt32LE(8);
   return {
-    months: months,
-    days: days,
+    months,
+    days,
     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));
+  const presisionInt = Math.round(value * 10 ** -field.presision % 1 * 10 ** field.presision);
+  return presisionInt * 10 ** -(field.scale || 0);
 }
 function decimalFromPrimitive_BYTE_ARRAY(value, field) {
-  var number = 0;
+  let number = 0;
   if (value.length <= 4) {
-    for (var i = 0; i < value.length; i++) {
-      var component = value[i] << 8 * (value.length - i - 1);
+    for (let i = 0; i < value.length; i++) {
+      const component = value[i] << 8 * (value.length - i - 1);
       number += component;
     }
   } else {
-    for (var _i = 0; _i < value.length; _i++) {
-      var _component = value[_i] * Math.pow(2, 8 * (value.length - 1 - _i));
-      number += _component;
+    for (let i = 0; i < value.length; i++) {
+      const component = value[i] * 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));
+  const presisionInt = Math.round(number * 10 ** -field.presision % 1 * 10 ** field.presision);
+  return presisionInt * 10 ** -(field.scale || 0);
 }
 //# sourceMappingURL=types.js.map