@loaders.gl/shapefile 3.4.14 → 3.4.15
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/dbf-worker.js +1 -1
- package/dist/es5/bundle.js +1 -1
- package/dist/es5/bundle.js.map +1 -1
- package/dist/es5/dbf-loader.js +6 -27
- package/dist/es5/dbf-loader.js.map +1 -1
- package/dist/es5/index.js +5 -5
- package/dist/es5/lib/parsers/parse-dbf.js +89 -179
- package/dist/es5/lib/parsers/parse-dbf.js.map +1 -1
- package/dist/es5/lib/parsers/parse-shapefile.js +137 -314
- package/dist/es5/lib/parsers/parse-shapefile.js.map +1 -1
- package/dist/es5/lib/parsers/parse-shp-geometry.js +49 -72
- package/dist/es5/lib/parsers/parse-shp-geometry.js.map +1 -1
- package/dist/es5/lib/parsers/parse-shp-header.js +4 -4
- package/dist/es5/lib/parsers/parse-shp-header.js.map +1 -1
- package/dist/es5/lib/parsers/parse-shp.js +45 -130
- package/dist/es5/lib/parsers/parse-shp.js.map +1 -1
- package/dist/es5/lib/parsers/parse-shx.js +11 -11
- package/dist/es5/lib/parsers/parse-shx.js.map +1 -1
- package/dist/es5/lib/streaming/binary-chunk-reader.js +82 -146
- package/dist/es5/lib/streaming/binary-chunk-reader.js.map +1 -1
- package/dist/es5/lib/streaming/binary-reader.js +19 -32
- package/dist/es5/lib/streaming/binary-reader.js.map +1 -1
- package/dist/es5/lib/streaming/zip-batch-iterators.js +33 -74
- package/dist/es5/lib/streaming/zip-batch-iterators.js.map +1 -1
- package/dist/es5/shapefile-loader.js +3 -3
- package/dist/es5/shapefile-loader.js.map +1 -1
- package/dist/es5/shp-loader.js +7 -28
- package/dist/es5/shp-loader.js.map +1 -1
- package/dist/esm/dbf-loader.js +1 -1
- package/dist/esm/shapefile-loader.js +1 -1
- package/dist/esm/shp-loader.js +1 -1
- package/dist/shp-worker.js +1 -1
- package/package.json +5 -5
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"parse-shp.js","names":["_binaryChunkReader","_interopRequireDefault","require","_parseShpHeader","_parseShpGeometry","_asyncIterator","iterable","method","async","sync","retry","Symbol","asyncIterator","iterator","call","AsyncFromSyncIterator","TypeError","s","AsyncFromSyncIteratorContinuation","r","Object","Promise","reject","done","resolve","value","then","n","next","prototype","apply","arguments","return","_return","ret","throw","_throw","thr","LITTLE_ENDIAN","BIG_ENDIAN","SHP_HEADER_SIZE","SHP_RECORD_HEADER_SIZE","STATE","EXPECTING_HEADER","EXPECTING_RECORD","END","ERROR","SHPParser","options","_classCallCheck2","default","_defineProperty2","BinaryChunkReader","maxRewindBytes","geometries","progress","bytesTotal","NaN","bytesUsed","rows","currentIndex","_createClass2","key","write","arrayBuffer","binaryReader","state","parseState","result","end","error","parseSHP","shpParser","parseSHPInBatches","_x","_x2","_parseSHPInBatches","_wrapAsyncGenerator2","_regenerator","mark","_callee","parser","headerReturned","_iteratorAbruptCompletion","_didIteratorError","_iteratorError","_iterator","_step","wrap","_callee$","_context","prev","_awaitAsyncGenerator2","sent","header","length","t0","finish","abrupt","stop","dataView","getDataView","parseSHPHeader","hasAvailableBytes","_result$header","recordHeaderView","recordHeader","recordNumber","getInt32","byteLength","type","rewind","invalidRecord","recordView","geometry","parseRecord","push","ended","concat","message"],"sources":["../../../../src/lib/parsers/parse-shp.ts"],"sourcesContent":["import type {BinaryGeometry} from '@loaders.gl/schema';\nimport BinaryChunkReader from '../streaming/binary-chunk-reader';\nimport {parseSHPHeader, SHPHeader} from './parse-shp-header';\nimport {parseRecord} from './parse-shp-geometry';\nimport {SHPLoaderOptions} from './types';\n\nconst LITTLE_ENDIAN = true;\nconst BIG_ENDIAN = false;\n\nconst SHP_HEADER_SIZE = 100;\n// According to the spec, the record header is just 8 bytes, but here we set it\n// to 12 so that we can also access the record's type\nconst SHP_RECORD_HEADER_SIZE = 12;\n\nconst STATE = {\n EXPECTING_HEADER: 0,\n EXPECTING_RECORD: 1,\n END: 2,\n ERROR: 3\n};\n\ntype SHPResult = {\n geometries: (BinaryGeometry | null)[];\n header?: SHPHeader;\n error?: string;\n progress: {\n bytesUsed: number;\n bytesTotal: number;\n rows: number;\n };\n currentIndex: number;\n};\n\nclass SHPParser {\n options?: SHPLoaderOptions = {};\n binaryReader = new BinaryChunkReader({maxRewindBytes: SHP_RECORD_HEADER_SIZE});\n state = STATE.EXPECTING_HEADER;\n result: SHPResult = {\n geometries: [],\n // Initialize with number values to make TS happy\n // These are initialized for real in STATE.EXPECTING_HEADER\n progress: {\n bytesTotal: NaN,\n bytesUsed: NaN,\n rows: NaN\n },\n currentIndex: NaN\n };\n\n constructor(options?: SHPLoaderOptions) {\n this.options = options;\n }\n\n write(arrayBuffer: ArrayBuffer) {\n this.binaryReader.write(arrayBuffer);\n this.state = parseState(this.state, this.result, this.binaryReader, this.options);\n }\n\n end() {\n this.binaryReader.end();\n this.state = parseState(this.state, this.result, this.binaryReader, this.options);\n // this.result.progress.bytesUsed = this.binaryReader.bytesUsed();\n if (this.state !== STATE.END) {\n this.state = STATE.ERROR;\n this.result.error = 'SHP incomplete file';\n }\n }\n}\n\nexport function parseSHP(arrayBuffer: ArrayBuffer, options?: SHPLoaderOptions): BinaryGeometry[] {\n const shpParser = new SHPParser(options);\n shpParser.write(arrayBuffer);\n shpParser.end();\n\n // @ts-ignore\n return shpParser.result;\n}\n\n/**\n * @param asyncIterator\n * @param options\n * @returns\n */\nexport async function* parseSHPInBatches(\n asyncIterator: AsyncIterable<ArrayBuffer> | Iterable<ArrayBuffer>,\n options?: SHPLoaderOptions\n): AsyncIterable<BinaryGeometry | object> {\n const parser = new SHPParser(options);\n let headerReturned = false;\n for await (const arrayBuffer of asyncIterator) {\n parser.write(arrayBuffer);\n if (!headerReturned && parser.result.header) {\n headerReturned = true;\n yield parser.result.header;\n }\n\n if (parser.result.geometries.length > 0) {\n yield parser.result.geometries;\n parser.result.geometries = [];\n }\n }\n parser.end();\n if (parser.result.geometries.length > 0) {\n yield parser.result.geometries;\n }\n\n return;\n}\n\n/**\n * State-machine parser for SHP data\n *\n * Note that whenever more data is needed, a `return`, not a `break`, is\n * necessary, as the `break` keeps the context within `parseState`, while\n * `return` releases context so that more data can be written into the\n * BinaryChunkReader.\n *\n * @param state Current state\n * @param result An object to hold result data\n * @param binaryReader\n * @return State at end of current parsing\n */\n/* eslint-disable complexity, max-depth */\nfunction parseState(\n state: number,\n result: SHPResult,\n binaryReader: BinaryChunkReader,\n options?: SHPLoaderOptions\n): number {\n // eslint-disable-next-line no-constant-condition\n while (true) {\n try {\n switch (state) {\n case STATE.ERROR:\n case STATE.END:\n return state;\n\n case STATE.EXPECTING_HEADER:\n // Parse initial file header\n const dataView = binaryReader.getDataView(SHP_HEADER_SIZE);\n if (!dataView) {\n return state;\n }\n\n result.header = parseSHPHeader(dataView);\n result.progress = {\n bytesUsed: 0,\n bytesTotal: result.header.length,\n rows: 0\n };\n // index numbering starts at 1\n result.currentIndex = 1;\n state = STATE.EXPECTING_RECORD;\n break;\n\n case STATE.EXPECTING_RECORD:\n while (binaryReader.hasAvailableBytes(SHP_RECORD_HEADER_SIZE)) {\n const recordHeaderView = binaryReader.getDataView(SHP_RECORD_HEADER_SIZE) as DataView;\n const recordHeader = {\n recordNumber: recordHeaderView.getInt32(0, BIG_ENDIAN),\n // 2 byte words; includes the four words of record header\n byteLength: recordHeaderView.getInt32(4, BIG_ENDIAN) * 2,\n // This is actually part of the record, not the header...\n type: recordHeaderView.getInt32(8, LITTLE_ENDIAN)\n };\n\n if (!binaryReader.hasAvailableBytes(recordHeader.byteLength - 4)) {\n binaryReader.rewind(SHP_RECORD_HEADER_SIZE);\n return state;\n }\n\n const invalidRecord =\n recordHeader.byteLength < 4 ||\n recordHeader.type !== result.header?.type ||\n recordHeader.recordNumber !== result.currentIndex;\n\n // All records must have at least four bytes (for the record shape type)\n if (invalidRecord) {\n // Malformed record, try again, advancing just 4 bytes\n // Note: this is a rewind because binaryReader.getDataView above\n // moved the pointer forward 12 bytes, so rewinding 8 bytes still\n // leaves us 4 bytes ahead\n binaryReader.rewind(SHP_RECORD_HEADER_SIZE - 4);\n } else {\n // Note: type is actually part of the record, not the header, so\n // rewind 4 bytes before reading record\n binaryReader.rewind(4);\n\n const recordView = binaryReader.getDataView(recordHeader.byteLength) as DataView;\n const geometry = parseRecord(recordView, options);\n result.geometries.push(geometry);\n\n result.currentIndex++;\n result.progress.rows = result.currentIndex - 1;\n }\n }\n\n if (binaryReader.ended) {\n state = STATE.END;\n }\n\n return state;\n\n default:\n state = STATE.ERROR;\n result.error = `illegal parser state ${state}`;\n return state;\n }\n } catch (error) {\n state = STATE.ERROR;\n result.error = `SHP parsing failed: ${(error as Error)?.message}`;\n return state;\n }\n }\n}\n"],"mappings":";;;;;;;;;;;;;;AACA,IAAAA,kBAAA,GAAAC,sBAAA,CAAAC,OAAA;AACA,IAAAC,eAAA,GAAAD,OAAA;AACA,IAAAE,iBAAA,GAAAF,OAAA;AAAiD,SAAAG,eAAAC,QAAA,QAAAC,MAAA,EAAAC,KAAA,EAAAC,IAAA,EAAAC,KAAA,iCAAAC,MAAA,KAAAH,KAAA,GAAAG,MAAA,CAAAC,aAAA,EAAAH,IAAA,GAAAE,MAAA,CAAAE,QAAA,GAAAH,KAAA,WAAAF,KAAA,aAAAD,MAAA,GAAAD,QAAA,CAAAE,KAAA,WAAAD,MAAA,CAAAO,IAAA,CAAAR,QAAA,OAAAG,IAAA,aAAAF,MAAA,GAAAD,QAAA,CAAAG,IAAA,eAAAM,qBAAA,CAAAR,MAAA,CAAAO,IAAA,CAAAR,QAAA,IAAAE,KAAA,sBAAAC,IAAA,6BAAAO,SAAA;AAAA,SAAAD,sBAAAE,CAAA,aAAAC,kCAAAC,CAAA,QAAAC,MAAA,CAAAD,CAAA,MAAAA,CAAA,SAAAE,OAAA,CAAAC,MAAA,KAAAN,SAAA,CAAAG,CAAA,+BAAAI,IAAA,GAAAJ,CAAA,CAAAI,IAAA,SAAAF,OAAA,CAAAG,OAAA,CAAAL,CAAA,CAAAM,KAAA,EAAAC,IAAA,WAAAD,KAAA,aAAAA,KAAA,EAAAA,KAAA,EAAAF,IAAA,EAAAA,IAAA,iBAAAR,qBAAA,YAAAA,sBAAAE,CAAA,SAAAA,CAAA,GAAAA,CAAA,OAAAU,CAAA,GAAAV,CAAA,CAAAW,IAAA,KAAAb,qBAAA,CAAAc,SAAA,KAAAZ,CAAA,QAAAU,CAAA,QAAAC,IAAA,WAAAA,KAAA,WAAAV,iCAAA,MAAAS,CAAA,CAAAG,KAAA,MAAAb,CAAA,EAAAc,SAAA,OAAAC,MAAA,WAAAC,QAAAR,KAAA,QAAAS,GAAA,QAAAjB,CAAA,CAAAe,MAAA,oBAAAE,GAAA,GAAAb,OAAA,CAAAG,OAAA,GAAAC,KAAA,EAAAA,KAAA,EAAAF,IAAA,UAAAL,iCAAA,CAAAgB,GAAA,CAAAJ,KAAA,MAAAb,CAAA,EAAAc,SAAA,OAAAI,KAAA,WAAAC,OAAAX,KAAA,QAAAY,GAAA,QAAApB,CAAA,CAAAe,MAAA,oBAAAK,GAAA,GAAAhB,OAAA,CAAAC,MAAA,CAAAG,KAAA,IAAAP,iCAAA,CAAAmB,GAAA,CAAAP,KAAA,MAAAb,CAAA,EAAAc,SAAA,aAAAhB,qBAAA,CAAAE,CAAA;AAGjD,IAAMqB,aAAa,GAAG,IAAI;AAC1B,IAAMC,UAAU,GAAG,KAAK;AAExB,IAAMC,eAAe,GAAG,GAAG;AAG3B,IAAMC,sBAAsB,GAAG,EAAE;AAEjC,IAAMC,KAAK,GAAG;EACZC,gBAAgB,EAAE,CAAC;EACnBC,gBAAgB,EAAE,CAAC;EACnBC,GAAG,EAAE,CAAC;EACNC,KAAK,EAAE;AACT,CAAC;AAAC,IAcIC,SAAS;EAgBb,SAAAA,UAAYC,OAA0B,EAAE;IAAA,IAAAC,gBAAA,CAAAC,OAAA,QAAAH,SAAA;IAAA,IAAAI,gBAAA,CAAAD,OAAA,mBAfX,CAAC,CAAC;IAAA,IAAAC,gBAAA,CAAAD,OAAA,wBAChB,IAAIE,0BAAiB,CAAC;MAACC,cAAc,EAAEZ;IAAsB,CAAC,CAAC;IAAA,IAAAU,gBAAA,CAAAD,OAAA,iBACtER,KAAK,CAACC,gBAAgB;IAAA,IAAAQ,gBAAA,CAAAD,OAAA,kBACV;MAClBI,UAAU,EAAE,EAAE;MAGdC,QAAQ,EAAE;QACRC,UAAU,EAAEC,GAAG;QACfC,SAAS,EAAED,GAAG;QACdE,IAAI,EAAEF;MACR,CAAC;MACDG,YAAY,EAAEH;IAChB,CAAC;IAGC,IAAI,CAACT,OAAO,GAAGA,OAAO;EACxB;EAAC,IAAAa,aAAA,CAAAX,OAAA,EAAAH,SAAA;IAAAe,GAAA;IAAArC,KAAA,EAED,SAAAsC,MAAMC,WAAwB,EAAE;MAC9B,IAAI,CAACC,YAAY,CAACF,KAAK,CAACC,WAAW,CAAC;MACpC,IAAI,CAACE,KAAK,GAAGC,UAAU,CAAC,IAAI,CAACD,KAAK,EAAE,IAAI,CAACE,MAAM,EAAE,IAAI,CAACH,YAAY,EAAE,IAAI,CAACjB,OAAO,CAAC;IACnF;EAAC;IAAAc,GAAA;IAAArC,KAAA,EAED,SAAA4C,IAAA,EAAM;MACJ,IAAI,CAACJ,YAAY,CAACI,GAAG,CAAC,CAAC;MACvB,IAAI,CAACH,KAAK,GAAGC,UAAU,CAAC,IAAI,CAACD,KAAK,EAAE,IAAI,CAACE,MAAM,EAAE,IAAI,CAACH,YAAY,EAAE,IAAI,CAACjB,OAAO,CAAC;MAEjF,IAAI,IAAI,CAACkB,KAAK,KAAKxB,KAAK,CAACG,GAAG,EAAE;QAC5B,IAAI,CAACqB,KAAK,GAAGxB,KAAK,CAACI,KAAK;QACxB,IAAI,CAACsB,MAAM,CAACE,KAAK,GAAG,qBAAqB;MAC3C;IACF;EAAC;EAAA,OAAAvB,SAAA;AAAA;AAGI,SAASwB,QAAQA,CAACP,WAAwB,EAAEhB,OAA0B,EAAoB;EAC/F,IAAMwB,SAAS,GAAG,IAAIzB,SAAS,CAACC,OAAO,CAAC;EACxCwB,SAAS,CAACT,KAAK,CAACC,WAAW,CAAC;EAC5BQ,SAAS,CAACH,GAAG,CAAC,CAAC;EAGf,OAAOG,SAAS,CAACJ,MAAM;AACzB;AAAC,SAOsBK,iBAAiBA,CAAAC,EAAA,EAAAC,GAAA;EAAA,OAAAC,kBAAA,CAAA9C,KAAA,OAAAC,SAAA;AAAA;AAAA,SAAA6C,mBAAA;EAAAA,kBAAA,OAAAC,oBAAA,CAAA3B,OAAA,EAAA4B,YAAA,CAAA5B,OAAA,CAAA6B,IAAA,CAAjC,SAAAC,QACLpE,aAAiE,EACjEoC,OAA0B;IAAA,IAAAiC,MAAA,EAAAC,cAAA,EAAAC,yBAAA,EAAAC,iBAAA,EAAAC,cAAA,EAAAC,SAAA,EAAAC,KAAA,EAAAvB,WAAA;IAAA,OAAAc,YAAA,CAAA5B,OAAA,CAAAsC,IAAA,UAAAC,SAAAC,QAAA;MAAA,kBAAAA,QAAA,CAAAC,IAAA,GAAAD,QAAA,CAAA9D,IAAA;QAAA;UAEpBqD,MAAM,GAAG,IAAIlC,SAAS,CAACC,OAAO,CAAC;UACjCkC,cAAc,GAAG,KAAK;UAAAC,yBAAA;UAAAC,iBAAA;UAAAM,QAAA,CAAAC,IAAA;UAAAL,SAAA,GAAAjF,cAAA,CACMO,aAAa;QAAA;UAAA8E,QAAA,CAAA9D,IAAA;UAAA,WAAAgE,qBAAA,CAAA1C,OAAA,EAAAoC,SAAA,CAAA1D,IAAA;QAAA;UAAA,MAAAuD,yBAAA,KAAAI,KAAA,GAAAG,QAAA,CAAAG,IAAA,EAAAtE,IAAA;YAAAmE,QAAA,CAAA9D,IAAA;YAAA;UAAA;UAA5BoC,WAAW,GAAAuB,KAAA,CAAA9D,KAAA;UAC1BwD,MAAM,CAAClB,KAAK,CAACC,WAAW,CAAC;UAAC,MACtB,CAACkB,cAAc,IAAID,MAAM,CAACb,MAAM,CAAC0B,MAAM;YAAAJ,QAAA,CAAA9D,IAAA;YAAA;UAAA;UACzCsD,cAAc,GAAG,IAAI;UAACQ,QAAA,CAAA9D,IAAA;UACtB,OAAMqD,MAAM,CAACb,MAAM,CAAC0B,MAAM;QAAA;UAAA,MAGxBb,MAAM,CAACb,MAAM,CAACd,UAAU,CAACyC,MAAM,GAAG,CAAC;YAAAL,QAAA,CAAA9D,IAAA;YAAA;UAAA;UAAA8D,QAAA,CAAA9D,IAAA;UACrC,OAAMqD,MAAM,CAACb,MAAM,CAACd,UAAU;QAAA;UAC9B2B,MAAM,CAACb,MAAM,CAACd,UAAU,GAAG,EAAE;QAAC;UAAA6B,yBAAA;UAAAO,QAAA,CAAA9D,IAAA;UAAA;QAAA;UAAA8D,QAAA,CAAA9D,IAAA;UAAA;QAAA;UAAA8D,QAAA,CAAAC,IAAA;UAAAD,QAAA,CAAAM,EAAA,GAAAN,QAAA;UAAAN,iBAAA;UAAAC,cAAA,GAAAK,QAAA,CAAAM,EAAA;QAAA;UAAAN,QAAA,CAAAC,IAAA;UAAAD,QAAA,CAAAC,IAAA;UAAA,MAAAR,yBAAA,IAAAG,SAAA,CAAAtD,MAAA;YAAA0D,QAAA,CAAA9D,IAAA;YAAA;UAAA;UAAA8D,QAAA,CAAA9D,IAAA;UAAA,WAAAgE,qBAAA,CAAA1C,OAAA,EAAAoC,SAAA,CAAAtD,MAAA;QAAA;UAAA0D,QAAA,CAAAC,IAAA;UAAA,KAAAP,iBAAA;YAAAM,QAAA,CAAA9D,IAAA;YAAA;UAAA;UAAA,MAAAyD,cAAA;QAAA;UAAA,OAAAK,QAAA,CAAAO,MAAA;QAAA;UAAA,OAAAP,QAAA,CAAAO,MAAA;QAAA;UAGlChB,MAAM,CAACZ,GAAG,CAAC,CAAC;UAAC,MACTY,MAAM,CAACb,MAAM,CAACd,UAAU,CAACyC,MAAM,GAAG,CAAC;YAAAL,QAAA,CAAA9D,IAAA;YAAA;UAAA;UAAA8D,QAAA,CAAA9D,IAAA;UACrC,OAAMqD,MAAM,CAACb,MAAM,CAACd,UAAU;QAAA;UAAA,OAAAoC,QAAA,CAAAQ,MAAA;QAAA;QAAA;UAAA,OAAAR,QAAA,CAAAS,IAAA;MAAA;IAAA,GAAAnB,OAAA;EAAA,CAIjC;EAAA,OAAAJ,kBAAA,CAAA9C,KAAA,OAAAC,SAAA;AAAA;AAgBD,SAASoC,UAAUA,CACjBD,KAAa,EACbE,MAAiB,EACjBH,YAA+B,EAC/BjB,OAA0B,EAClB;EAER,OAAO,IAAI,EAAE;IACX,IAAI;MACF,QAAQkB,KAAK;QACX,KAAKxB,KAAK,CAACI,KAAK;QAChB,KAAKJ,KAAK,CAACG,GAAG;UACZ,OAAOqB,KAAK;QAEd,KAAKxB,KAAK,CAACC,gBAAgB;UAEzB,IAAMyD,QAAQ,GAAGnC,YAAY,CAACoC,WAAW,CAAC7D,eAAe,CAAC;UAC1D,IAAI,CAAC4D,QAAQ,EAAE;YACb,OAAOlC,KAAK;UACd;UAEAE,MAAM,CAAC0B,MAAM,GAAG,IAAAQ,8BAAc,EAACF,QAAQ,CAAC;UACxChC,MAAM,CAACb,QAAQ,GAAG;YAChBG,SAAS,EAAE,CAAC;YACZF,UAAU,EAAEY,MAAM,CAAC0B,MAAM,CAACC,MAAM;YAChCpC,IAAI,EAAE;UACR,CAAC;UAEDS,MAAM,CAACR,YAAY,GAAG,CAAC;UACvBM,KAAK,GAAGxB,KAAK,CAACE,gBAAgB;UAC9B;QAEF,KAAKF,KAAK,CAACE,gBAAgB;UACzB,OAAOqB,YAAY,CAACsC,iBAAiB,CAAC9D,sBAAsB,CAAC,EAAE;YAAA,IAAA+D,cAAA;YAC7D,IAAMC,gBAAgB,GAAGxC,YAAY,CAACoC,WAAW,CAAC5D,sBAAsB,CAAa;YACrF,IAAMiE,YAAY,GAAG;cACnBC,YAAY,EAAEF,gBAAgB,CAACG,QAAQ,CAAC,CAAC,EAAErE,UAAU,CAAC;cAEtDsE,UAAU,EAAEJ,gBAAgB,CAACG,QAAQ,CAAC,CAAC,EAAErE,UAAU,CAAC,GAAG,CAAC;cAExDuE,IAAI,EAAEL,gBAAgB,CAACG,QAAQ,CAAC,CAAC,EAAEtE,aAAa;YAClD,CAAC;YAED,IAAI,CAAC2B,YAAY,CAACsC,iBAAiB,CAACG,YAAY,CAACG,UAAU,GAAG,CAAC,CAAC,EAAE;cAChE5C,YAAY,CAAC8C,MAAM,CAACtE,sBAAsB,CAAC;cAC3C,OAAOyB,KAAK;YACd;YAEA,IAAM8C,aAAa,GACjBN,YAAY,CAACG,UAAU,GAAG,CAAC,IAC3BH,YAAY,CAACI,IAAI,OAAAN,cAAA,GAAKpC,MAAM,CAAC0B,MAAM,cAAAU,cAAA,uBAAbA,cAAA,CAAeM,IAAI,KACzCJ,YAAY,CAACC,YAAY,KAAKvC,MAAM,CAACR,YAAY;YAGnD,IAAIoD,aAAa,EAAE;cAKjB/C,YAAY,CAAC8C,MAAM,CAACtE,sBAAsB,GAAG,CAAC,CAAC;YACjD,CAAC,MAAM;cAGLwB,YAAY,CAAC8C,MAAM,CAAC,CAAC,CAAC;cAEtB,IAAME,UAAU,GAAGhD,YAAY,CAACoC,WAAW,CAACK,YAAY,CAACG,UAAU,CAAa;cAChF,IAAMK,QAAQ,GAAG,IAAAC,6BAAW,EAACF,UAAU,EAAEjE,OAAO,CAAC;cACjDoB,MAAM,CAACd,UAAU,CAAC8D,IAAI,CAACF,QAAQ,CAAC;cAEhC9C,MAAM,CAACR,YAAY,EAAE;cACrBQ,MAAM,CAACb,QAAQ,CAACI,IAAI,GAAGS,MAAM,CAACR,YAAY,GAAG,CAAC;YAChD;UACF;UAEA,IAAIK,YAAY,CAACoD,KAAK,EAAE;YACtBnD,KAAK,GAAGxB,KAAK,CAACG,GAAG;UACnB;UAEA,OAAOqB,KAAK;QAEd;UACEA,KAAK,GAAGxB,KAAK,CAACI,KAAK;UACnBsB,MAAM,CAACE,KAAK,2BAAAgD,MAAA,CAA2BpD,KAAK,CAAE;UAC9C,OAAOA,KAAK;MAChB;IACF,CAAC,CAAC,OAAOI,KAAK,EAAE;MACdJ,KAAK,GAAGxB,KAAK,CAACI,KAAK;MACnBsB,MAAM,CAACE,KAAK,0BAAAgD,MAAA,CAA2BhD,KAAK,aAALA,KAAK,uBAALA,KAAK,CAAYiD,OAAO,CAAE;MACjE,OAAOrD,KAAK;IACd;EACF;AACF"}
|
|
1
|
+
{"version":3,"file":"parse-shp.js","names":["_binaryChunkReader","_interopRequireDefault","require","_parseShpHeader","_parseShpGeometry","LITTLE_ENDIAN","BIG_ENDIAN","SHP_HEADER_SIZE","SHP_RECORD_HEADER_SIZE","STATE","EXPECTING_HEADER","EXPECTING_RECORD","END","ERROR","SHPParser","constructor","options","_defineProperty2","default","BinaryChunkReader","maxRewindBytes","geometries","progress","bytesTotal","NaN","bytesUsed","rows","currentIndex","write","arrayBuffer","binaryReader","state","parseState","result","end","error","parseSHP","shpParser","parseSHPInBatches","asyncIterator","parser","headerReturned","header","length","dataView","getDataView","parseSHPHeader","hasAvailableBytes","_result$header","recordHeaderView","recordHeader","recordNumber","getInt32","byteLength","type","rewind","invalidRecord","recordView","geometry","parseRecord","push","ended","concat","message"],"sources":["../../../../src/lib/parsers/parse-shp.ts"],"sourcesContent":["import type {BinaryGeometry} from '@loaders.gl/schema';\nimport BinaryChunkReader from '../streaming/binary-chunk-reader';\nimport {parseSHPHeader, SHPHeader} from './parse-shp-header';\nimport {parseRecord} from './parse-shp-geometry';\nimport {SHPLoaderOptions} from './types';\n\nconst LITTLE_ENDIAN = true;\nconst BIG_ENDIAN = false;\n\nconst SHP_HEADER_SIZE = 100;\n// According to the spec, the record header is just 8 bytes, but here we set it\n// to 12 so that we can also access the record's type\nconst SHP_RECORD_HEADER_SIZE = 12;\n\nconst STATE = {\n EXPECTING_HEADER: 0,\n EXPECTING_RECORD: 1,\n END: 2,\n ERROR: 3\n};\n\ntype SHPResult = {\n geometries: (BinaryGeometry | null)[];\n header?: SHPHeader;\n error?: string;\n progress: {\n bytesUsed: number;\n bytesTotal: number;\n rows: number;\n };\n currentIndex: number;\n};\n\nclass SHPParser {\n options?: SHPLoaderOptions = {};\n binaryReader = new BinaryChunkReader({maxRewindBytes: SHP_RECORD_HEADER_SIZE});\n state = STATE.EXPECTING_HEADER;\n result: SHPResult = {\n geometries: [],\n // Initialize with number values to make TS happy\n // These are initialized for real in STATE.EXPECTING_HEADER\n progress: {\n bytesTotal: NaN,\n bytesUsed: NaN,\n rows: NaN\n },\n currentIndex: NaN\n };\n\n constructor(options?: SHPLoaderOptions) {\n this.options = options;\n }\n\n write(arrayBuffer: ArrayBuffer) {\n this.binaryReader.write(arrayBuffer);\n this.state = parseState(this.state, this.result, this.binaryReader, this.options);\n }\n\n end() {\n this.binaryReader.end();\n this.state = parseState(this.state, this.result, this.binaryReader, this.options);\n // this.result.progress.bytesUsed = this.binaryReader.bytesUsed();\n if (this.state !== STATE.END) {\n this.state = STATE.ERROR;\n this.result.error = 'SHP incomplete file';\n }\n }\n}\n\nexport function parseSHP(arrayBuffer: ArrayBuffer, options?: SHPLoaderOptions): BinaryGeometry[] {\n const shpParser = new SHPParser(options);\n shpParser.write(arrayBuffer);\n shpParser.end();\n\n // @ts-ignore\n return shpParser.result;\n}\n\n/**\n * @param asyncIterator\n * @param options\n * @returns\n */\nexport async function* parseSHPInBatches(\n asyncIterator: AsyncIterable<ArrayBuffer> | Iterable<ArrayBuffer>,\n options?: SHPLoaderOptions\n): AsyncIterable<BinaryGeometry | object> {\n const parser = new SHPParser(options);\n let headerReturned = false;\n for await (const arrayBuffer of asyncIterator) {\n parser.write(arrayBuffer);\n if (!headerReturned && parser.result.header) {\n headerReturned = true;\n yield parser.result.header;\n }\n\n if (parser.result.geometries.length > 0) {\n yield parser.result.geometries;\n parser.result.geometries = [];\n }\n }\n parser.end();\n if (parser.result.geometries.length > 0) {\n yield parser.result.geometries;\n }\n\n return;\n}\n\n/**\n * State-machine parser for SHP data\n *\n * Note that whenever more data is needed, a `return`, not a `break`, is\n * necessary, as the `break` keeps the context within `parseState`, while\n * `return` releases context so that more data can be written into the\n * BinaryChunkReader.\n *\n * @param state Current state\n * @param result An object to hold result data\n * @param binaryReader\n * @return State at end of current parsing\n */\n/* eslint-disable complexity, max-depth */\nfunction parseState(\n state: number,\n result: SHPResult,\n binaryReader: BinaryChunkReader,\n options?: SHPLoaderOptions\n): number {\n // eslint-disable-next-line no-constant-condition\n while (true) {\n try {\n switch (state) {\n case STATE.ERROR:\n case STATE.END:\n return state;\n\n case STATE.EXPECTING_HEADER:\n // Parse initial file header\n const dataView = binaryReader.getDataView(SHP_HEADER_SIZE);\n if (!dataView) {\n return state;\n }\n\n result.header = parseSHPHeader(dataView);\n result.progress = {\n bytesUsed: 0,\n bytesTotal: result.header.length,\n rows: 0\n };\n // index numbering starts at 1\n result.currentIndex = 1;\n state = STATE.EXPECTING_RECORD;\n break;\n\n case STATE.EXPECTING_RECORD:\n while (binaryReader.hasAvailableBytes(SHP_RECORD_HEADER_SIZE)) {\n const recordHeaderView = binaryReader.getDataView(SHP_RECORD_HEADER_SIZE) as DataView;\n const recordHeader = {\n recordNumber: recordHeaderView.getInt32(0, BIG_ENDIAN),\n // 2 byte words; includes the four words of record header\n byteLength: recordHeaderView.getInt32(4, BIG_ENDIAN) * 2,\n // This is actually part of the record, not the header...\n type: recordHeaderView.getInt32(8, LITTLE_ENDIAN)\n };\n\n if (!binaryReader.hasAvailableBytes(recordHeader.byteLength - 4)) {\n binaryReader.rewind(SHP_RECORD_HEADER_SIZE);\n return state;\n }\n\n const invalidRecord =\n recordHeader.byteLength < 4 ||\n recordHeader.type !== result.header?.type ||\n recordHeader.recordNumber !== result.currentIndex;\n\n // All records must have at least four bytes (for the record shape type)\n if (invalidRecord) {\n // Malformed record, try again, advancing just 4 bytes\n // Note: this is a rewind because binaryReader.getDataView above\n // moved the pointer forward 12 bytes, so rewinding 8 bytes still\n // leaves us 4 bytes ahead\n binaryReader.rewind(SHP_RECORD_HEADER_SIZE - 4);\n } else {\n // Note: type is actually part of the record, not the header, so\n // rewind 4 bytes before reading record\n binaryReader.rewind(4);\n\n const recordView = binaryReader.getDataView(recordHeader.byteLength) as DataView;\n const geometry = parseRecord(recordView, options);\n result.geometries.push(geometry);\n\n result.currentIndex++;\n result.progress.rows = result.currentIndex - 1;\n }\n }\n\n if (binaryReader.ended) {\n state = STATE.END;\n }\n\n return state;\n\n default:\n state = STATE.ERROR;\n result.error = `illegal parser state ${state}`;\n return state;\n }\n } catch (error) {\n state = STATE.ERROR;\n result.error = `SHP parsing failed: ${(error as Error)?.message}`;\n return state;\n }\n }\n}\n"],"mappings":";;;;;;;;;AACA,IAAAA,kBAAA,GAAAC,sBAAA,CAAAC,OAAA;AACA,IAAAC,eAAA,GAAAD,OAAA;AACA,IAAAE,iBAAA,GAAAF,OAAA;AAGA,MAAMG,aAAa,GAAG,IAAI;AAC1B,MAAMC,UAAU,GAAG,KAAK;AAExB,MAAMC,eAAe,GAAG,GAAG;AAG3B,MAAMC,sBAAsB,GAAG,EAAE;AAEjC,MAAMC,KAAK,GAAG;EACZC,gBAAgB,EAAE,CAAC;EACnBC,gBAAgB,EAAE,CAAC;EACnBC,GAAG,EAAE,CAAC;EACNC,KAAK,EAAE;AACT,CAAC;AAcD,MAAMC,SAAS,CAAC;EAgBdC,WAAWA,CAACC,OAA0B,EAAE;IAAA,IAAAC,gBAAA,CAAAC,OAAA,mBAfX,CAAC,CAAC;IAAA,IAAAD,gBAAA,CAAAC,OAAA,wBAChB,IAAIC,0BAAiB,CAAC;MAACC,cAAc,EAAEZ;IAAsB,CAAC,CAAC;IAAA,IAAAS,gBAAA,CAAAC,OAAA,iBACtET,KAAK,CAACC,gBAAgB;IAAA,IAAAO,gBAAA,CAAAC,OAAA,kBACV;MAClBG,UAAU,EAAE,EAAE;MAGdC,QAAQ,EAAE;QACRC,UAAU,EAAEC,GAAG;QACfC,SAAS,EAAED,GAAG;QACdE,IAAI,EAAEF;MACR,CAAC;MACDG,YAAY,EAAEH;IAChB,CAAC;IAGC,IAAI,CAACR,OAAO,GAAGA,OAAO;EACxB;EAEAY,KAAKA,CAACC,WAAwB,EAAE;IAC9B,IAAI,CAACC,YAAY,CAACF,KAAK,CAACC,WAAW,CAAC;IACpC,IAAI,CAACE,KAAK,GAAGC,UAAU,CAAC,IAAI,CAACD,KAAK,EAAE,IAAI,CAACE,MAAM,EAAE,IAAI,CAACH,YAAY,EAAE,IAAI,CAACd,OAAO,CAAC;EACnF;EAEAkB,GAAGA,CAAA,EAAG;IACJ,IAAI,CAACJ,YAAY,CAACI,GAAG,CAAC,CAAC;IACvB,IAAI,CAACH,KAAK,GAAGC,UAAU,CAAC,IAAI,CAACD,KAAK,EAAE,IAAI,CAACE,MAAM,EAAE,IAAI,CAACH,YAAY,EAAE,IAAI,CAACd,OAAO,CAAC;IAEjF,IAAI,IAAI,CAACe,KAAK,KAAKtB,KAAK,CAACG,GAAG,EAAE;MAC5B,IAAI,CAACmB,KAAK,GAAGtB,KAAK,CAACI,KAAK;MACxB,IAAI,CAACoB,MAAM,CAACE,KAAK,GAAG,qBAAqB;IAC3C;EACF;AACF;AAEO,SAASC,QAAQA,CAACP,WAAwB,EAAEb,OAA0B,EAAoB;EAC/F,MAAMqB,SAAS,GAAG,IAAIvB,SAAS,CAACE,OAAO,CAAC;EACxCqB,SAAS,CAACT,KAAK,CAACC,WAAW,CAAC;EAC5BQ,SAAS,CAACH,GAAG,CAAC,CAAC;EAGf,OAAOG,SAAS,CAACJ,MAAM;AACzB;AAOO,gBAAgBK,iBAAiBA,CACtCC,aAAiE,EACjEvB,OAA0B,EACc;EACxC,MAAMwB,MAAM,GAAG,IAAI1B,SAAS,CAACE,OAAO,CAAC;EACrC,IAAIyB,cAAc,GAAG,KAAK;EAC1B,WAAW,MAAMZ,WAAW,IAAIU,aAAa,EAAE;IAC7CC,MAAM,CAACZ,KAAK,CAACC,WAAW,CAAC;IACzB,IAAI,CAACY,cAAc,IAAID,MAAM,CAACP,MAAM,CAACS,MAAM,EAAE;MAC3CD,cAAc,GAAG,IAAI;MACrB,MAAMD,MAAM,CAACP,MAAM,CAACS,MAAM;IAC5B;IAEA,IAAIF,MAAM,CAACP,MAAM,CAACZ,UAAU,CAACsB,MAAM,GAAG,CAAC,EAAE;MACvC,MAAMH,MAAM,CAACP,MAAM,CAACZ,UAAU;MAC9BmB,MAAM,CAACP,MAAM,CAACZ,UAAU,GAAG,EAAE;IAC/B;EACF;EACAmB,MAAM,CAACN,GAAG,CAAC,CAAC;EACZ,IAAIM,MAAM,CAACP,MAAM,CAACZ,UAAU,CAACsB,MAAM,GAAG,CAAC,EAAE;IACvC,MAAMH,MAAM,CAACP,MAAM,CAACZ,UAAU;EAChC;EAEA;AACF;AAgBA,SAASW,UAAUA,CACjBD,KAAa,EACbE,MAAiB,EACjBH,YAA+B,EAC/Bd,OAA0B,EAClB;EAER,OAAO,IAAI,EAAE;IACX,IAAI;MACF,QAAQe,KAAK;QACX,KAAKtB,KAAK,CAACI,KAAK;QAChB,KAAKJ,KAAK,CAACG,GAAG;UACZ,OAAOmB,KAAK;QAEd,KAAKtB,KAAK,CAACC,gBAAgB;UAEzB,MAAMkC,QAAQ,GAAGd,YAAY,CAACe,WAAW,CAACtC,eAAe,CAAC;UAC1D,IAAI,CAACqC,QAAQ,EAAE;YACb,OAAOb,KAAK;UACd;UAEAE,MAAM,CAACS,MAAM,GAAG,IAAAI,8BAAc,EAACF,QAAQ,CAAC;UACxCX,MAAM,CAACX,QAAQ,GAAG;YAChBG,SAAS,EAAE,CAAC;YACZF,UAAU,EAAEU,MAAM,CAACS,MAAM,CAACC,MAAM;YAChCjB,IAAI,EAAE;UACR,CAAC;UAEDO,MAAM,CAACN,YAAY,GAAG,CAAC;UACvBI,KAAK,GAAGtB,KAAK,CAACE,gBAAgB;UAC9B;QAEF,KAAKF,KAAK,CAACE,gBAAgB;UACzB,OAAOmB,YAAY,CAACiB,iBAAiB,CAACvC,sBAAsB,CAAC,EAAE;YAAA,IAAAwC,cAAA;YAC7D,MAAMC,gBAAgB,GAAGnB,YAAY,CAACe,WAAW,CAACrC,sBAAsB,CAAa;YACrF,MAAM0C,YAAY,GAAG;cACnBC,YAAY,EAAEF,gBAAgB,CAACG,QAAQ,CAAC,CAAC,EAAE9C,UAAU,CAAC;cAEtD+C,UAAU,EAAEJ,gBAAgB,CAACG,QAAQ,CAAC,CAAC,EAAE9C,UAAU,CAAC,GAAG,CAAC;cAExDgD,IAAI,EAAEL,gBAAgB,CAACG,QAAQ,CAAC,CAAC,EAAE/C,aAAa;YAClD,CAAC;YAED,IAAI,CAACyB,YAAY,CAACiB,iBAAiB,CAACG,YAAY,CAACG,UAAU,GAAG,CAAC,CAAC,EAAE;cAChEvB,YAAY,CAACyB,MAAM,CAAC/C,sBAAsB,CAAC;cAC3C,OAAOuB,KAAK;YACd;YAEA,MAAMyB,aAAa,GACjBN,YAAY,CAACG,UAAU,GAAG,CAAC,IAC3BH,YAAY,CAACI,IAAI,OAAAN,cAAA,GAAKf,MAAM,CAACS,MAAM,cAAAM,cAAA,uBAAbA,cAAA,CAAeM,IAAI,KACzCJ,YAAY,CAACC,YAAY,KAAKlB,MAAM,CAACN,YAAY;YAGnD,IAAI6B,aAAa,EAAE;cAKjB1B,YAAY,CAACyB,MAAM,CAAC/C,sBAAsB,GAAG,CAAC,CAAC;YACjD,CAAC,MAAM;cAGLsB,YAAY,CAACyB,MAAM,CAAC,CAAC,CAAC;cAEtB,MAAME,UAAU,GAAG3B,YAAY,CAACe,WAAW,CAACK,YAAY,CAACG,UAAU,CAAa;cAChF,MAAMK,QAAQ,GAAG,IAAAC,6BAAW,EAACF,UAAU,EAAEzC,OAAO,CAAC;cACjDiB,MAAM,CAACZ,UAAU,CAACuC,IAAI,CAACF,QAAQ,CAAC;cAEhCzB,MAAM,CAACN,YAAY,EAAE;cACrBM,MAAM,CAACX,QAAQ,CAACI,IAAI,GAAGO,MAAM,CAACN,YAAY,GAAG,CAAC;YAChD;UACF;UAEA,IAAIG,YAAY,CAAC+B,KAAK,EAAE;YACtB9B,KAAK,GAAGtB,KAAK,CAACG,GAAG;UACnB;UAEA,OAAOmB,KAAK;QAEd;UACEA,KAAK,GAAGtB,KAAK,CAACI,KAAK;UACnBoB,MAAM,CAACE,KAAK,2BAAA2B,MAAA,CAA2B/B,KAAK,CAAE;UAC9C,OAAOA,KAAK;MAChB;IACF,CAAC,CAAC,OAAOI,KAAK,EAAE;MACdJ,KAAK,GAAGtB,KAAK,CAACI,KAAK;MACnBoB,MAAM,CAACE,KAAK,0BAAA2B,MAAA,CAA2B3B,KAAK,aAALA,KAAK,uBAALA,KAAK,CAAY4B,OAAO,CAAE;MACjE,OAAOhC,KAAK;IACd;EACF;AACF"}
|
|
@@ -5,22 +5,22 @@ Object.defineProperty(exports, "__esModule", {
|
|
|
5
5
|
});
|
|
6
6
|
exports.parseShx = parseShx;
|
|
7
7
|
var _parseShpHeader = require("./parse-shp-header");
|
|
8
|
-
|
|
9
|
-
|
|
8
|
+
const SHX_HEADER_SIZE = 100;
|
|
9
|
+
const BIG_ENDIAN = false;
|
|
10
10
|
function parseShx(arrayBuffer) {
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
for (
|
|
11
|
+
const headerView = new DataView(arrayBuffer, 0, SHX_HEADER_SIZE);
|
|
12
|
+
const header = (0, _parseShpHeader.parseSHPHeader)(headerView);
|
|
13
|
+
const contentLength = header.length - SHX_HEADER_SIZE;
|
|
14
|
+
const contentView = new DataView(arrayBuffer, SHX_HEADER_SIZE, contentLength);
|
|
15
|
+
const offsets = new Int32Array(contentLength);
|
|
16
|
+
const lengths = new Int32Array(contentLength);
|
|
17
|
+
for (let i = 0; i < contentLength / 8; i++) {
|
|
18
18
|
offsets[i] = contentView.getInt32(i * 8, BIG_ENDIAN);
|
|
19
19
|
lengths[i] = contentView.getInt32(i * 8 + 4, BIG_ENDIAN);
|
|
20
20
|
}
|
|
21
21
|
return {
|
|
22
|
-
offsets
|
|
23
|
-
lengths
|
|
22
|
+
offsets,
|
|
23
|
+
lengths
|
|
24
24
|
};
|
|
25
25
|
}
|
|
26
26
|
//# sourceMappingURL=parse-shx.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"parse-shx.js","names":["_parseShpHeader","require","SHX_HEADER_SIZE","BIG_ENDIAN","parseShx","arrayBuffer","headerView","DataView","header","parseSHPHeader","contentLength","length","contentView","offsets","Int32Array","lengths","i","getInt32"],"sources":["../../../../src/lib/parsers/parse-shx.ts"],"sourcesContent":["import {parseSHPHeader} from './parse-shp-header';\n\nexport interface SHXOutput {\n offsets: Int32Array;\n lengths: Int32Array;\n}\n\nconst SHX_HEADER_SIZE = 100;\nconst BIG_ENDIAN = false;\n\n/**\n * @param arrayBuffer\n * @returns SHXOutput\n */\nexport function parseShx(arrayBuffer: ArrayBuffer): SHXOutput {\n // SHX header is identical to SHP Header\n const headerView = new DataView(arrayBuffer, 0, SHX_HEADER_SIZE);\n const header = parseSHPHeader(headerView);\n const contentLength = header.length - SHX_HEADER_SIZE;\n\n const contentView = new DataView(arrayBuffer, SHX_HEADER_SIZE, contentLength);\n\n const offsets = new Int32Array(contentLength);\n const lengths = new Int32Array(contentLength);\n\n for (let i = 0; i < contentLength / 8; i++) {\n offsets[i] = contentView.getInt32(i * 8, BIG_ENDIAN);\n lengths[i] = contentView.getInt32(i * 8 + 4, BIG_ENDIAN);\n }\n\n return {\n offsets,\n lengths\n };\n}\n"],"mappings":";;;;;;AAAA,IAAAA,eAAA,GAAAC,OAAA;AAOA,
|
|
1
|
+
{"version":3,"file":"parse-shx.js","names":["_parseShpHeader","require","SHX_HEADER_SIZE","BIG_ENDIAN","parseShx","arrayBuffer","headerView","DataView","header","parseSHPHeader","contentLength","length","contentView","offsets","Int32Array","lengths","i","getInt32"],"sources":["../../../../src/lib/parsers/parse-shx.ts"],"sourcesContent":["import {parseSHPHeader} from './parse-shp-header';\n\nexport interface SHXOutput {\n offsets: Int32Array;\n lengths: Int32Array;\n}\n\nconst SHX_HEADER_SIZE = 100;\nconst BIG_ENDIAN = false;\n\n/**\n * @param arrayBuffer\n * @returns SHXOutput\n */\nexport function parseShx(arrayBuffer: ArrayBuffer): SHXOutput {\n // SHX header is identical to SHP Header\n const headerView = new DataView(arrayBuffer, 0, SHX_HEADER_SIZE);\n const header = parseSHPHeader(headerView);\n const contentLength = header.length - SHX_HEADER_SIZE;\n\n const contentView = new DataView(arrayBuffer, SHX_HEADER_SIZE, contentLength);\n\n const offsets = new Int32Array(contentLength);\n const lengths = new Int32Array(contentLength);\n\n for (let i = 0; i < contentLength / 8; i++) {\n offsets[i] = contentView.getInt32(i * 8, BIG_ENDIAN);\n lengths[i] = contentView.getInt32(i * 8 + 4, BIG_ENDIAN);\n }\n\n return {\n offsets,\n lengths\n };\n}\n"],"mappings":";;;;;;AAAA,IAAAA,eAAA,GAAAC,OAAA;AAOA,MAAMC,eAAe,GAAG,GAAG;AAC3B,MAAMC,UAAU,GAAG,KAAK;AAMjB,SAASC,QAAQA,CAACC,WAAwB,EAAa;EAE5D,MAAMC,UAAU,GAAG,IAAIC,QAAQ,CAACF,WAAW,EAAE,CAAC,EAAEH,eAAe,CAAC;EAChE,MAAMM,MAAM,GAAG,IAAAC,8BAAc,EAACH,UAAU,CAAC;EACzC,MAAMI,aAAa,GAAGF,MAAM,CAACG,MAAM,GAAGT,eAAe;EAErD,MAAMU,WAAW,GAAG,IAAIL,QAAQ,CAACF,WAAW,EAAEH,eAAe,EAAEQ,aAAa,CAAC;EAE7E,MAAMG,OAAO,GAAG,IAAIC,UAAU,CAACJ,aAAa,CAAC;EAC7C,MAAMK,OAAO,GAAG,IAAID,UAAU,CAACJ,aAAa,CAAC;EAE7C,KAAK,IAAIM,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGN,aAAa,GAAG,CAAC,EAAEM,CAAC,EAAE,EAAE;IAC1CH,OAAO,CAACG,CAAC,CAAC,GAAGJ,WAAW,CAACK,QAAQ,CAACD,CAAC,GAAG,CAAC,EAAEb,UAAU,CAAC;IACpDY,OAAO,CAACC,CAAC,CAAC,GAAGJ,WAAW,CAACK,QAAQ,CAACD,CAAC,GAAG,CAAC,GAAG,CAAC,EAAEb,UAAU,CAAC;EAC1D;EAEA,OAAO;IACLU,OAAO;IACPE;EACF,CAAC;AACH"}
|
|
@@ -5,174 +5,110 @@ Object.defineProperty(exports, "__esModule", {
|
|
|
5
5
|
value: true
|
|
6
6
|
});
|
|
7
7
|
exports.default = void 0;
|
|
8
|
-
var _slicedToArray2 = _interopRequireDefault(require("@babel/runtime/helpers/slicedToArray"));
|
|
9
|
-
var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime/helpers/classCallCheck"));
|
|
10
|
-
var _createClass2 = _interopRequireDefault(require("@babel/runtime/helpers/createClass"));
|
|
11
8
|
var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
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; }
|
|
15
|
-
var BinaryChunkReader = function () {
|
|
16
|
-
function BinaryChunkReader(options) {
|
|
17
|
-
(0, _classCallCheck2.default)(this, BinaryChunkReader);
|
|
9
|
+
class BinaryChunkReader {
|
|
10
|
+
constructor(options) {
|
|
18
11
|
(0, _defineProperty2.default)(this, "offset", void 0);
|
|
19
12
|
(0, _defineProperty2.default)(this, "arrayBuffers", void 0);
|
|
20
13
|
(0, _defineProperty2.default)(this, "ended", void 0);
|
|
21
14
|
(0, _defineProperty2.default)(this, "maxRewindBytes", void 0);
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
15
|
+
const {
|
|
16
|
+
maxRewindBytes = 0
|
|
17
|
+
} = options || {};
|
|
25
18
|
this.offset = 0;
|
|
26
19
|
this.arrayBuffers = [];
|
|
27
20
|
this.ended = false;
|
|
28
21
|
this.maxRewindBytes = maxRewindBytes;
|
|
29
22
|
}
|
|
30
|
-
(
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
value: function hasAvailableBytes(bytes) {
|
|
44
|
-
var bytesAvailable = -this.offset;
|
|
45
|
-
var _iterator = _createForOfIteratorHelper(this.arrayBuffers),
|
|
46
|
-
_step;
|
|
47
|
-
try {
|
|
48
|
-
for (_iterator.s(); !(_step = _iterator.n()).done;) {
|
|
49
|
-
var arrayBuffer = _step.value;
|
|
50
|
-
bytesAvailable += arrayBuffer.byteLength;
|
|
51
|
-
if (bytesAvailable >= bytes) {
|
|
52
|
-
return true;
|
|
53
|
-
}
|
|
54
|
-
}
|
|
55
|
-
} catch (err) {
|
|
56
|
-
_iterator.e(err);
|
|
57
|
-
} finally {
|
|
58
|
-
_iterator.f();
|
|
23
|
+
write(arrayBuffer) {
|
|
24
|
+
this.arrayBuffers.push(arrayBuffer);
|
|
25
|
+
}
|
|
26
|
+
end() {
|
|
27
|
+
this.arrayBuffers = [];
|
|
28
|
+
this.ended = true;
|
|
29
|
+
}
|
|
30
|
+
hasAvailableBytes(bytes) {
|
|
31
|
+
let bytesAvailable = -this.offset;
|
|
32
|
+
for (const arrayBuffer of this.arrayBuffers) {
|
|
33
|
+
bytesAvailable += arrayBuffer.byteLength;
|
|
34
|
+
if (bytesAvailable >= bytes) {
|
|
35
|
+
return true;
|
|
59
36
|
}
|
|
60
|
-
return false;
|
|
61
37
|
}
|
|
62
|
-
|
|
63
|
-
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
offset += buf.byteLength;
|
|
71
|
-
continue;
|
|
72
|
-
}
|
|
73
|
-
var start = offset <= 0 ? Math.abs(offset) : 0;
|
|
74
|
-
var end = void 0;
|
|
75
|
-
if (start + bytes <= buf.byteLength) {
|
|
76
|
-
end = start + bytes;
|
|
77
|
-
selectedBuffers.push([i, [start, end]]);
|
|
78
|
-
return selectedBuffers;
|
|
79
|
-
}
|
|
80
|
-
end = buf.byteLength;
|
|
81
|
-
selectedBuffers.push([i, [start, end]]);
|
|
82
|
-
bytes -= buf.byteLength - start;
|
|
38
|
+
return false;
|
|
39
|
+
}
|
|
40
|
+
findBufferOffsets(bytes) {
|
|
41
|
+
let offset = -this.offset;
|
|
42
|
+
const selectedBuffers = [];
|
|
43
|
+
for (let i = 0; i < this.arrayBuffers.length; i++) {
|
|
44
|
+
const buf = this.arrayBuffers[i];
|
|
45
|
+
if (offset + buf.byteLength <= 0) {
|
|
83
46
|
offset += buf.byteLength;
|
|
47
|
+
continue;
|
|
84
48
|
}
|
|
49
|
+
const start = offset <= 0 ? Math.abs(offset) : 0;
|
|
50
|
+
let end;
|
|
51
|
+
if (start + bytes <= buf.byteLength) {
|
|
52
|
+
end = start + bytes;
|
|
53
|
+
selectedBuffers.push([i, [start, end]]);
|
|
54
|
+
return selectedBuffers;
|
|
55
|
+
}
|
|
56
|
+
end = buf.byteLength;
|
|
57
|
+
selectedBuffers.push([i, [start, end]]);
|
|
58
|
+
bytes -= buf.byteLength - start;
|
|
59
|
+
offset += buf.byteLength;
|
|
60
|
+
}
|
|
61
|
+
return null;
|
|
62
|
+
}
|
|
63
|
+
getDataView(bytes) {
|
|
64
|
+
const bufferOffsets = this.findBufferOffsets(bytes);
|
|
65
|
+
if (!bufferOffsets && this.ended) {
|
|
66
|
+
throw new Error('binary data exhausted');
|
|
67
|
+
}
|
|
68
|
+
if (!bufferOffsets) {
|
|
85
69
|
return null;
|
|
86
70
|
}
|
|
87
|
-
|
|
88
|
-
|
|
89
|
-
|
|
90
|
-
|
|
91
|
-
if (!bufferOffsets && this.ended) {
|
|
92
|
-
throw new Error('binary data exhausted');
|
|
93
|
-
}
|
|
94
|
-
if (!bufferOffsets) {
|
|
95
|
-
return null;
|
|
96
|
-
}
|
|
97
|
-
if (bufferOffsets.length === 1) {
|
|
98
|
-
var _bufferOffsets$ = (0, _slicedToArray2.default)(bufferOffsets[0], 2),
|
|
99
|
-
bufferIndex = _bufferOffsets$[0],
|
|
100
|
-
_bufferOffsets$$ = (0, _slicedToArray2.default)(_bufferOffsets$[1], 2),
|
|
101
|
-
start = _bufferOffsets$$[0],
|
|
102
|
-
end = _bufferOffsets$$[1];
|
|
103
|
-
var arrayBuffer = this.arrayBuffers[bufferIndex];
|
|
104
|
-
var _view = new DataView(arrayBuffer, start, end - start);
|
|
105
|
-
this.offset += bytes;
|
|
106
|
-
this.disposeBuffers();
|
|
107
|
-
return _view;
|
|
108
|
-
}
|
|
109
|
-
var view = new DataView(this._combineArrayBuffers(bufferOffsets));
|
|
71
|
+
if (bufferOffsets.length === 1) {
|
|
72
|
+
const [bufferIndex, [start, end]] = bufferOffsets[0];
|
|
73
|
+
const arrayBuffer = this.arrayBuffers[bufferIndex];
|
|
74
|
+
const view = new DataView(arrayBuffer, start, end - start);
|
|
110
75
|
this.offset += bytes;
|
|
111
76
|
this.disposeBuffers();
|
|
112
77
|
return view;
|
|
113
78
|
}
|
|
114
|
-
|
|
115
|
-
|
|
116
|
-
|
|
117
|
-
|
|
118
|
-
|
|
119
|
-
|
|
120
|
-
|
|
121
|
-
|
|
122
|
-
|
|
123
|
-
key: "_combineArrayBuffers",
|
|
124
|
-
value: function _combineArrayBuffers(bufferOffsets) {
|
|
125
|
-
var byteLength = 0;
|
|
126
|
-
var _iterator2 = _createForOfIteratorHelper(bufferOffsets),
|
|
127
|
-
_step2;
|
|
128
|
-
try {
|
|
129
|
-
for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
|
|
130
|
-
var bufferOffset = _step2.value;
|
|
131
|
-
var _bufferOffset$ = (0, _slicedToArray2.default)(bufferOffset[1], 2),
|
|
132
|
-
start = _bufferOffset$[0],
|
|
133
|
-
end = _bufferOffset$[1];
|
|
134
|
-
byteLength += end - start;
|
|
135
|
-
}
|
|
136
|
-
} catch (err) {
|
|
137
|
-
_iterator2.e(err);
|
|
138
|
-
} finally {
|
|
139
|
-
_iterator2.f();
|
|
140
|
-
}
|
|
141
|
-
var result = new Uint8Array(byteLength);
|
|
142
|
-
var resultOffset = 0;
|
|
143
|
-
var _iterator3 = _createForOfIteratorHelper(bufferOffsets),
|
|
144
|
-
_step3;
|
|
145
|
-
try {
|
|
146
|
-
for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
|
|
147
|
-
var _bufferOffset = _step3.value;
|
|
148
|
-
var _bufferOffset2 = (0, _slicedToArray2.default)(_bufferOffset, 2),
|
|
149
|
-
bufferIndex = _bufferOffset2[0],
|
|
150
|
-
_bufferOffset2$ = (0, _slicedToArray2.default)(_bufferOffset2[1], 2),
|
|
151
|
-
_start = _bufferOffset2$[0],
|
|
152
|
-
_end = _bufferOffset2$[1];
|
|
153
|
-
var sourceArray = new Uint8Array(this.arrayBuffers[bufferIndex]);
|
|
154
|
-
result.set(sourceArray.subarray(_start, _end), resultOffset);
|
|
155
|
-
resultOffset += _end - _start;
|
|
156
|
-
}
|
|
157
|
-
} catch (err) {
|
|
158
|
-
_iterator3.e(err);
|
|
159
|
-
} finally {
|
|
160
|
-
_iterator3.f();
|
|
161
|
-
}
|
|
162
|
-
return result.buffer;
|
|
79
|
+
const view = new DataView(this._combineArrayBuffers(bufferOffsets));
|
|
80
|
+
this.offset += bytes;
|
|
81
|
+
this.disposeBuffers();
|
|
82
|
+
return view;
|
|
83
|
+
}
|
|
84
|
+
disposeBuffers() {
|
|
85
|
+
while (this.arrayBuffers.length > 0 && this.offset - this.maxRewindBytes >= this.arrayBuffers[0].byteLength) {
|
|
86
|
+
this.offset -= this.arrayBuffers[0].byteLength;
|
|
87
|
+
this.arrayBuffers.shift();
|
|
163
88
|
}
|
|
164
|
-
}
|
|
165
|
-
|
|
166
|
-
|
|
167
|
-
|
|
89
|
+
}
|
|
90
|
+
_combineArrayBuffers(bufferOffsets) {
|
|
91
|
+
let byteLength = 0;
|
|
92
|
+
for (const bufferOffset of bufferOffsets) {
|
|
93
|
+
const [start, end] = bufferOffset[1];
|
|
94
|
+
byteLength += end - start;
|
|
168
95
|
}
|
|
169
|
-
|
|
170
|
-
|
|
171
|
-
|
|
172
|
-
|
|
96
|
+
const result = new Uint8Array(byteLength);
|
|
97
|
+
let resultOffset = 0;
|
|
98
|
+
for (const bufferOffset of bufferOffsets) {
|
|
99
|
+
const [bufferIndex, [start, end]] = bufferOffset;
|
|
100
|
+
const sourceArray = new Uint8Array(this.arrayBuffers[bufferIndex]);
|
|
101
|
+
result.set(sourceArray.subarray(start, end), resultOffset);
|
|
102
|
+
resultOffset += end - start;
|
|
173
103
|
}
|
|
174
|
-
|
|
175
|
-
|
|
176
|
-
|
|
104
|
+
return result.buffer;
|
|
105
|
+
}
|
|
106
|
+
skip(bytes) {
|
|
107
|
+
this.offset += bytes;
|
|
108
|
+
}
|
|
109
|
+
rewind(bytes) {
|
|
110
|
+
this.offset -= bytes;
|
|
111
|
+
}
|
|
112
|
+
}
|
|
177
113
|
exports.default = BinaryChunkReader;
|
|
178
114
|
//# sourceMappingURL=binary-chunk-reader.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"binary-chunk-reader.js","names":["BinaryChunkReader","options","_classCallCheck2","default","_defineProperty2","_ref","_ref$maxRewindBytes","maxRewindBytes","offset","arrayBuffers","ended","_createClass2","key","value","write","arrayBuffer","push","end","hasAvailableBytes","bytes","bytesAvailable","_iterator","_createForOfIteratorHelper","_step","s","n","done","byteLength","err","e","f","findBufferOffsets","selectedBuffers","i","length","buf","start","Math","abs","getDataView","bufferOffsets","Error","_bufferOffsets$","_slicedToArray2","bufferIndex","_bufferOffsets$$","view","DataView","disposeBuffers","_combineArrayBuffers","shift","_iterator2","_step2","bufferOffset","_bufferOffset$","result","Uint8Array","resultOffset","_iterator3","_step3","_bufferOffset2","_bufferOffset2$","sourceArray","set","subarray","buffer","skip","rewind","exports"],"sources":["../../../../src/lib/streaming/binary-chunk-reader.ts"],"sourcesContent":["type BinaryChunkReaderOptions = {\n maxRewindBytes: number;\n};\n\nexport default class BinaryChunkReader {\n offset: number;\n arrayBuffers: ArrayBuffer[];\n ended: boolean;\n maxRewindBytes: number;\n\n constructor(options?: BinaryChunkReaderOptions) {\n const {maxRewindBytes = 0} = options || {};\n\n /** current global offset into current array buffer*/\n this.offset = 0;\n /** current buffer from iterator */\n this.arrayBuffers = [];\n this.ended = false;\n\n /** bytes behind offset to hold on to */\n this.maxRewindBytes = maxRewindBytes;\n }\n /**\n * @param arrayBuffer\n */\n write(arrayBuffer: ArrayBuffer): void {\n this.arrayBuffers.push(arrayBuffer);\n }\n\n end(): void {\n this.arrayBuffers = [];\n this.ended = true;\n }\n\n /**\n * Has enough bytes available in array buffers\n *\n * @param bytes Number of bytes\n * @return boolean\n */\n hasAvailableBytes(bytes: number): boolean {\n let bytesAvailable = -this.offset;\n for (const arrayBuffer of this.arrayBuffers) {\n bytesAvailable += arrayBuffer.byteLength;\n if (bytesAvailable >= bytes) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * Find offsets of byte ranges within this.arrayBuffers\n *\n * @param bytes Byte length to read\n * @return Arrays with byte ranges pointing to this.arrayBuffers, Output type is nested array, e.g. [ [0, [1, 2]], ...]\n */\n findBufferOffsets(bytes: number): any[] | null {\n let offset = -this.offset;\n const selectedBuffers: any = [];\n\n for (let i = 0; i < this.arrayBuffers.length; i++) {\n const buf = this.arrayBuffers[i];\n\n // Current buffer isn't long enough to reach global offset\n if (offset + buf.byteLength <= 0) {\n offset += buf.byteLength;\n // eslint-disable-next-line no-continue\n continue;\n }\n\n // Find start/end offsets for this buffer\n // When offset < 0, need to skip over Math.abs(offset) bytes\n // When offset > 0, implies bytes in previous buffer, start at 0\n const start = offset <= 0 ? Math.abs(offset) : 0;\n let end: number;\n\n // Length of requested bytes is contained in current buffer\n if (start + bytes <= buf.byteLength) {\n end = start + bytes;\n selectedBuffers.push([i, [start, end]]);\n return selectedBuffers;\n }\n\n // Will need to look into next buffer\n end = buf.byteLength;\n selectedBuffers.push([i, [start, end]]);\n\n // Need to read fewer bytes in next iter\n bytes -= buf.byteLength - start;\n offset += buf.byteLength;\n }\n\n // Should only finish loop if exhausted all arrays\n return null;\n }\n\n /**\n * Get the required number of bytes from the iterator\n *\n * @param bytes Number of bytes\n * @return DataView with data\n */\n getDataView(bytes: number): DataView | null {\n const bufferOffsets = this.findBufferOffsets(bytes);\n // return `null` if not enough data, except if end() already called, in\n // which case throw an error.\n if (!bufferOffsets && this.ended) {\n throw new Error('binary data exhausted');\n }\n\n if (!bufferOffsets) {\n // @ts-ignore\n return null;\n }\n\n // If only one arrayBuffer needed, return DataView directly\n if (bufferOffsets.length === 1) {\n const [bufferIndex, [start, end]] = bufferOffsets[0];\n const arrayBuffer = this.arrayBuffers[bufferIndex];\n const view = new DataView(arrayBuffer, start, end - start);\n\n this.offset += bytes;\n this.disposeBuffers();\n return view;\n }\n\n // Concatenate portions of multiple ArrayBuffers\n const view = new DataView(this._combineArrayBuffers(bufferOffsets));\n this.offset += bytes;\n this.disposeBuffers();\n return view;\n }\n\n /**\n * Dispose of old array buffers\n */\n disposeBuffers(): void {\n while (\n this.arrayBuffers.length > 0 &&\n this.offset - this.maxRewindBytes >= this.arrayBuffers[0].byteLength\n ) {\n this.offset -= this.arrayBuffers[0].byteLength;\n this.arrayBuffers.shift();\n }\n }\n\n /**\n * Copy multiple ArrayBuffers into one contiguous ArrayBuffer\n *\n * In contrast to concatenateArrayBuffers, this only copies the necessary\n * portions of the source arrays, rather than first copying the entire arrays\n * then taking a part of them.\n *\n * @param bufferOffsets List of internal array offsets\n * @return New contiguous ArrayBuffer\n */\n _combineArrayBuffers(bufferOffsets: any[]): ArrayBufferLike {\n let byteLength: number = 0;\n for (const bufferOffset of bufferOffsets) {\n const [start, end] = bufferOffset[1];\n byteLength += end - start;\n }\n\n const result = new Uint8Array(byteLength);\n\n // Copy the subarrays\n let resultOffset: number = 0;\n for (const bufferOffset of bufferOffsets) {\n const [bufferIndex, [start, end]] = bufferOffset;\n const sourceArray = new Uint8Array(this.arrayBuffers[bufferIndex]);\n result.set(sourceArray.subarray(start, end), resultOffset);\n resultOffset += end - start;\n }\n\n return result.buffer;\n }\n /**\n * @param bytes\n */\n skip(bytes: number): void {\n this.offset += bytes;\n }\n /**\n * @param bytes\n */\n rewind(bytes: number): void {\n // TODO - only works if offset is already set\n this.offset -= bytes;\n }\n}\n"],"mappings":";;;;;;;;;;;;;;IAIqBA,iBAAiB;EAMpC,SAAAA,kBAAYC,OAAkC,EAAE;IAAA,IAAAC,gBAAA,CAAAC,OAAA,QAAAH,iBAAA;IAAA,IAAAI,gBAAA,CAAAD,OAAA;IAAA,IAAAC,gBAAA,CAAAD,OAAA;IAAA,IAAAC,gBAAA,CAAAD,OAAA;IAAA,IAAAC,gBAAA,CAAAD,OAAA;IAC9C,IAAAE,IAAA,GAA6BJ,OAAO,IAAI,CAAC,CAAC;MAAAK,mBAAA,GAAAD,IAAA,CAAnCE,cAAc;MAAdA,cAAc,GAAAD,mBAAA,cAAG,CAAC,GAAAA,mBAAA;IAGzB,IAAI,CAACE,MAAM,GAAG,CAAC;IAEf,IAAI,CAACC,YAAY,GAAG,EAAE;IACtB,IAAI,CAACC,KAAK,GAAG,KAAK;IAGlB,IAAI,CAACH,cAAc,GAAGA,cAAc;EACtC;EAAC,IAAAI,aAAA,CAAAR,OAAA,EAAAH,iBAAA;IAAAY,GAAA;IAAAC,KAAA,EAID,SAAAC,MAAMC,WAAwB,EAAQ;MACpC,IAAI,CAACN,YAAY,CAACO,IAAI,CAACD,WAAW,CAAC;IACrC;EAAC;IAAAH,GAAA;IAAAC,KAAA,EAED,SAAAI,IAAA,EAAY;MACV,IAAI,CAACR,YAAY,GAAG,EAAE;MACtB,IAAI,CAACC,KAAK,GAAG,IAAI;IACnB;EAAC;IAAAE,GAAA;IAAAC,KAAA,EAQD,SAAAK,kBAAkBC,KAAa,EAAW;MACxC,IAAIC,cAAc,GAAG,CAAC,IAAI,CAACZ,MAAM;MAAC,IAAAa,SAAA,GAAAC,0BAAA,CACR,IAAI,CAACb,YAAY;QAAAc,KAAA;MAAA;QAA3C,KAAAF,SAAA,CAAAG,CAAA,MAAAD,KAAA,GAAAF,SAAA,CAAAI,CAAA,IAAAC,IAAA,GAA6C;UAAA,IAAlCX,WAAW,GAAAQ,KAAA,CAAAV,KAAA;UACpBO,cAAc,IAAIL,WAAW,CAACY,UAAU;UACxC,IAAIP,cAAc,IAAID,KAAK,EAAE;YAC3B,OAAO,IAAI;UACb;QACF;MAAC,SAAAS,GAAA;QAAAP,SAAA,CAAAQ,CAAA,CAAAD,GAAA;MAAA;QAAAP,SAAA,CAAAS,CAAA;MAAA;MACD,OAAO,KAAK;IACd;EAAC;IAAAlB,GAAA;IAAAC,KAAA,EAQD,SAAAkB,kBAAkBZ,KAAa,EAAgB;MAC7C,IAAIX,MAAM,GAAG,CAAC,IAAI,CAACA,MAAM;MACzB,IAAMwB,eAAoB,GAAG,EAAE;MAE/B,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,IAAI,CAACxB,YAAY,CAACyB,MAAM,EAAED,CAAC,EAAE,EAAE;QACjD,IAAME,GAAG,GAAG,IAAI,CAAC1B,YAAY,CAACwB,CAAC,CAAC;QAGhC,IAAIzB,MAAM,GAAG2B,GAAG,CAACR,UAAU,IAAI,CAAC,EAAE;UAChCnB,MAAM,IAAI2B,GAAG,CAACR,UAAU;UAExB;QACF;QAKA,IAAMS,KAAK,GAAG5B,MAAM,IAAI,CAAC,GAAG6B,IAAI,CAACC,GAAG,CAAC9B,MAAM,CAAC,GAAG,CAAC;QAChD,IAAIS,GAAW;QAGf,IAAImB,KAAK,GAAGjB,KAAK,IAAIgB,GAAG,CAACR,UAAU,EAAE;UACnCV,GAAG,GAAGmB,KAAK,GAAGjB,KAAK;UACnBa,eAAe,CAAChB,IAAI,CAAC,CAACiB,CAAC,EAAE,CAACG,KAAK,EAAEnB,GAAG,CAAC,CAAC,CAAC;UACvC,OAAOe,eAAe;QACxB;QAGAf,GAAG,GAAGkB,GAAG,CAACR,UAAU;QACpBK,eAAe,CAAChB,IAAI,CAAC,CAACiB,CAAC,EAAE,CAACG,KAAK,EAAEnB,GAAG,CAAC,CAAC,CAAC;QAGvCE,KAAK,IAAIgB,GAAG,CAACR,UAAU,GAAGS,KAAK;QAC/B5B,MAAM,IAAI2B,GAAG,CAACR,UAAU;MAC1B;MAGA,OAAO,IAAI;IACb;EAAC;IAAAf,GAAA;IAAAC,KAAA,EAQD,SAAA0B,YAAYpB,KAAa,EAAmB;MAC1C,IAAMqB,aAAa,GAAG,IAAI,CAACT,iBAAiB,CAACZ,KAAK,CAAC;MAGnD,IAAI,CAACqB,aAAa,IAAI,IAAI,CAAC9B,KAAK,EAAE;QAChC,MAAM,IAAI+B,KAAK,CAAC,uBAAuB,CAAC;MAC1C;MAEA,IAAI,CAACD,aAAa,EAAE;QAElB,OAAO,IAAI;MACb;MAGA,IAAIA,aAAa,CAACN,MAAM,KAAK,CAAC,EAAE;QAC9B,IAAAQ,eAAA,OAAAC,eAAA,CAAAxC,OAAA,EAAoCqC,aAAa,CAAC,CAAC,CAAC;UAA7CI,WAAW,GAAAF,eAAA;UAAAG,gBAAA,OAAAF,eAAA,CAAAxC,OAAA,EAAAuC,eAAA;UAAGN,KAAK,GAAAS,gBAAA;UAAE5B,GAAG,GAAA4B,gBAAA;QAC/B,IAAM9B,WAAW,GAAG,IAAI,CAACN,YAAY,CAACmC,WAAW,CAAC;QAClD,IAAME,KAAI,GAAG,IAAIC,QAAQ,CAAChC,WAAW,EAAEqB,KAAK,EAAEnB,GAAG,GAAGmB,KAAK,CAAC;QAE1D,IAAI,CAAC5B,MAAM,IAAIW,KAAK;QACpB,IAAI,CAAC6B,cAAc,CAAC,CAAC;QACrB,OAAOF,KAAI;MACb;MAGA,IAAMA,IAAI,GAAG,IAAIC,QAAQ,CAAC,IAAI,CAACE,oBAAoB,CAACT,aAAa,CAAC,CAAC;MACnE,IAAI,CAAChC,MAAM,IAAIW,KAAK;MACpB,IAAI,CAAC6B,cAAc,CAAC,CAAC;MACrB,OAAOF,IAAI;IACb;EAAC;IAAAlC,GAAA;IAAAC,KAAA,EAKD,SAAAmC,eAAA,EAAuB;MACrB,OACE,IAAI,CAACvC,YAAY,CAACyB,MAAM,GAAG,CAAC,IAC5B,IAAI,CAAC1B,MAAM,GAAG,IAAI,CAACD,cAAc,IAAI,IAAI,CAACE,YAAY,CAAC,CAAC,CAAC,CAACkB,UAAU,EACpE;QACA,IAAI,CAACnB,MAAM,IAAI,IAAI,CAACC,YAAY,CAAC,CAAC,CAAC,CAACkB,UAAU;QAC9C,IAAI,CAAClB,YAAY,CAACyC,KAAK,CAAC,CAAC;MAC3B;IACF;EAAC;IAAAtC,GAAA;IAAAC,KAAA,EAYD,SAAAoC,qBAAqBT,aAAoB,EAAmB;MAC1D,IAAIb,UAAkB,GAAG,CAAC;MAAC,IAAAwB,UAAA,GAAA7B,0BAAA,CACAkB,aAAa;QAAAY,MAAA;MAAA;QAAxC,KAAAD,UAAA,CAAA3B,CAAA,MAAA4B,MAAA,GAAAD,UAAA,CAAA1B,CAAA,IAAAC,IAAA,GAA0C;UAAA,IAA/B2B,YAAY,GAAAD,MAAA,CAAAvC,KAAA;UACrB,IAAAyC,cAAA,OAAAX,eAAA,CAAAxC,OAAA,EAAqBkD,YAAY,CAAC,CAAC,CAAC;YAA7BjB,KAAK,GAAAkB,cAAA;YAAErC,GAAG,GAAAqC,cAAA;UACjB3B,UAAU,IAAIV,GAAG,GAAGmB,KAAK;QAC3B;MAAC,SAAAR,GAAA;QAAAuB,UAAA,CAAAtB,CAAA,CAAAD,GAAA;MAAA;QAAAuB,UAAA,CAAArB,CAAA;MAAA;MAED,IAAMyB,MAAM,GAAG,IAAIC,UAAU,CAAC7B,UAAU,CAAC;MAGzC,IAAI8B,YAAoB,GAAG,CAAC;MAAC,IAAAC,UAAA,GAAApC,0BAAA,CACFkB,aAAa;QAAAmB,MAAA;MAAA;QAAxC,KAAAD,UAAA,CAAAlC,CAAA,MAAAmC,MAAA,GAAAD,UAAA,CAAAjC,CAAA,IAAAC,IAAA,GAA0C;UAAA,IAA/B2B,aAAY,GAAAM,MAAA,CAAA9C,KAAA;UACrB,IAAA+C,cAAA,OAAAjB,eAAA,CAAAxC,OAAA,EAAoCkD,aAAY;YAAzCT,WAAW,GAAAgB,cAAA;YAAAC,eAAA,OAAAlB,eAAA,CAAAxC,OAAA,EAAAyD,cAAA;YAAGxB,MAAK,GAAAyB,eAAA;YAAE5C,IAAG,GAAA4C,eAAA;UAC/B,IAAMC,WAAW,GAAG,IAAIN,UAAU,CAAC,IAAI,CAAC/C,YAAY,CAACmC,WAAW,CAAC,CAAC;UAClEW,MAAM,CAACQ,GAAG,CAACD,WAAW,CAACE,QAAQ,CAAC5B,MAAK,EAAEnB,IAAG,CAAC,EAAEwC,YAAY,CAAC;UAC1DA,YAAY,IAAIxC,IAAG,GAAGmB,MAAK;QAC7B;MAAC,SAAAR,GAAA;QAAA8B,UAAA,CAAA7B,CAAA,CAAAD,GAAA;MAAA;QAAA8B,UAAA,CAAA5B,CAAA;MAAA;MAED,OAAOyB,MAAM,CAACU,MAAM;IACtB;EAAC;IAAArD,GAAA;IAAAC,KAAA,EAID,SAAAqD,KAAK/C,KAAa,EAAQ;MACxB,IAAI,CAACX,MAAM,IAAIW,KAAK;IACtB;EAAC;IAAAP,GAAA;IAAAC,KAAA,EAID,SAAAsD,OAAOhD,KAAa,EAAQ;MAE1B,IAAI,CAACX,MAAM,IAAIW,KAAK;IACtB;EAAC;EAAA,OAAAnB,iBAAA;AAAA;AAAAoE,OAAA,CAAAjE,OAAA,GAAAH,iBAAA"}
|
|
1
|
+
{"version":3,"file":"binary-chunk-reader.js","names":["BinaryChunkReader","constructor","options","_defineProperty2","default","maxRewindBytes","offset","arrayBuffers","ended","write","arrayBuffer","push","end","hasAvailableBytes","bytes","bytesAvailable","byteLength","findBufferOffsets","selectedBuffers","i","length","buf","start","Math","abs","getDataView","bufferOffsets","Error","bufferIndex","view","DataView","disposeBuffers","_combineArrayBuffers","shift","bufferOffset","result","Uint8Array","resultOffset","sourceArray","set","subarray","buffer","skip","rewind","exports"],"sources":["../../../../src/lib/streaming/binary-chunk-reader.ts"],"sourcesContent":["type BinaryChunkReaderOptions = {\n maxRewindBytes: number;\n};\n\nexport default class BinaryChunkReader {\n offset: number;\n arrayBuffers: ArrayBuffer[];\n ended: boolean;\n maxRewindBytes: number;\n\n constructor(options?: BinaryChunkReaderOptions) {\n const {maxRewindBytes = 0} = options || {};\n\n /** current global offset into current array buffer*/\n this.offset = 0;\n /** current buffer from iterator */\n this.arrayBuffers = [];\n this.ended = false;\n\n /** bytes behind offset to hold on to */\n this.maxRewindBytes = maxRewindBytes;\n }\n /**\n * @param arrayBuffer\n */\n write(arrayBuffer: ArrayBuffer): void {\n this.arrayBuffers.push(arrayBuffer);\n }\n\n end(): void {\n this.arrayBuffers = [];\n this.ended = true;\n }\n\n /**\n * Has enough bytes available in array buffers\n *\n * @param bytes Number of bytes\n * @return boolean\n */\n hasAvailableBytes(bytes: number): boolean {\n let bytesAvailable = -this.offset;\n for (const arrayBuffer of this.arrayBuffers) {\n bytesAvailable += arrayBuffer.byteLength;\n if (bytesAvailable >= bytes) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * Find offsets of byte ranges within this.arrayBuffers\n *\n * @param bytes Byte length to read\n * @return Arrays with byte ranges pointing to this.arrayBuffers, Output type is nested array, e.g. [ [0, [1, 2]], ...]\n */\n findBufferOffsets(bytes: number): any[] | null {\n let offset = -this.offset;\n const selectedBuffers: any = [];\n\n for (let i = 0; i < this.arrayBuffers.length; i++) {\n const buf = this.arrayBuffers[i];\n\n // Current buffer isn't long enough to reach global offset\n if (offset + buf.byteLength <= 0) {\n offset += buf.byteLength;\n // eslint-disable-next-line no-continue\n continue;\n }\n\n // Find start/end offsets for this buffer\n // When offset < 0, need to skip over Math.abs(offset) bytes\n // When offset > 0, implies bytes in previous buffer, start at 0\n const start = offset <= 0 ? Math.abs(offset) : 0;\n let end: number;\n\n // Length of requested bytes is contained in current buffer\n if (start + bytes <= buf.byteLength) {\n end = start + bytes;\n selectedBuffers.push([i, [start, end]]);\n return selectedBuffers;\n }\n\n // Will need to look into next buffer\n end = buf.byteLength;\n selectedBuffers.push([i, [start, end]]);\n\n // Need to read fewer bytes in next iter\n bytes -= buf.byteLength - start;\n offset += buf.byteLength;\n }\n\n // Should only finish loop if exhausted all arrays\n return null;\n }\n\n /**\n * Get the required number of bytes from the iterator\n *\n * @param bytes Number of bytes\n * @return DataView with data\n */\n getDataView(bytes: number): DataView | null {\n const bufferOffsets = this.findBufferOffsets(bytes);\n // return `null` if not enough data, except if end() already called, in\n // which case throw an error.\n if (!bufferOffsets && this.ended) {\n throw new Error('binary data exhausted');\n }\n\n if (!bufferOffsets) {\n // @ts-ignore\n return null;\n }\n\n // If only one arrayBuffer needed, return DataView directly\n if (bufferOffsets.length === 1) {\n const [bufferIndex, [start, end]] = bufferOffsets[0];\n const arrayBuffer = this.arrayBuffers[bufferIndex];\n const view = new DataView(arrayBuffer, start, end - start);\n\n this.offset += bytes;\n this.disposeBuffers();\n return view;\n }\n\n // Concatenate portions of multiple ArrayBuffers\n const view = new DataView(this._combineArrayBuffers(bufferOffsets));\n this.offset += bytes;\n this.disposeBuffers();\n return view;\n }\n\n /**\n * Dispose of old array buffers\n */\n disposeBuffers(): void {\n while (\n this.arrayBuffers.length > 0 &&\n this.offset - this.maxRewindBytes >= this.arrayBuffers[0].byteLength\n ) {\n this.offset -= this.arrayBuffers[0].byteLength;\n this.arrayBuffers.shift();\n }\n }\n\n /**\n * Copy multiple ArrayBuffers into one contiguous ArrayBuffer\n *\n * In contrast to concatenateArrayBuffers, this only copies the necessary\n * portions of the source arrays, rather than first copying the entire arrays\n * then taking a part of them.\n *\n * @param bufferOffsets List of internal array offsets\n * @return New contiguous ArrayBuffer\n */\n _combineArrayBuffers(bufferOffsets: any[]): ArrayBufferLike {\n let byteLength: number = 0;\n for (const bufferOffset of bufferOffsets) {\n const [start, end] = bufferOffset[1];\n byteLength += end - start;\n }\n\n const result = new Uint8Array(byteLength);\n\n // Copy the subarrays\n let resultOffset: number = 0;\n for (const bufferOffset of bufferOffsets) {\n const [bufferIndex, [start, end]] = bufferOffset;\n const sourceArray = new Uint8Array(this.arrayBuffers[bufferIndex]);\n result.set(sourceArray.subarray(start, end), resultOffset);\n resultOffset += end - start;\n }\n\n return result.buffer;\n }\n /**\n * @param bytes\n */\n skip(bytes: number): void {\n this.offset += bytes;\n }\n /**\n * @param bytes\n */\n rewind(bytes: number): void {\n // TODO - only works if offset is already set\n this.offset -= bytes;\n }\n}\n"],"mappings":";;;;;;;;AAIe,MAAMA,iBAAiB,CAAC;EAMrCC,WAAWA,CAACC,OAAkC,EAAE;IAAA,IAAAC,gBAAA,CAAAC,OAAA;IAAA,IAAAD,gBAAA,CAAAC,OAAA;IAAA,IAAAD,gBAAA,CAAAC,OAAA;IAAA,IAAAD,gBAAA,CAAAC,OAAA;IAC9C,MAAM;MAACC,cAAc,GAAG;IAAC,CAAC,GAAGH,OAAO,IAAI,CAAC,CAAC;IAG1C,IAAI,CAACI,MAAM,GAAG,CAAC;IAEf,IAAI,CAACC,YAAY,GAAG,EAAE;IACtB,IAAI,CAACC,KAAK,GAAG,KAAK;IAGlB,IAAI,CAACH,cAAc,GAAGA,cAAc;EACtC;EAIAI,KAAKA,CAACC,WAAwB,EAAQ;IACpC,IAAI,CAACH,YAAY,CAACI,IAAI,CAACD,WAAW,CAAC;EACrC;EAEAE,GAAGA,CAAA,EAAS;IACV,IAAI,CAACL,YAAY,GAAG,EAAE;IACtB,IAAI,CAACC,KAAK,GAAG,IAAI;EACnB;EAQAK,iBAAiBA,CAACC,KAAa,EAAW;IACxC,IAAIC,cAAc,GAAG,CAAC,IAAI,CAACT,MAAM;IACjC,KAAK,MAAMI,WAAW,IAAI,IAAI,CAACH,YAAY,EAAE;MAC3CQ,cAAc,IAAIL,WAAW,CAACM,UAAU;MACxC,IAAID,cAAc,IAAID,KAAK,EAAE;QAC3B,OAAO,IAAI;MACb;IACF;IACA,OAAO,KAAK;EACd;EAQAG,iBAAiBA,CAACH,KAAa,EAAgB;IAC7C,IAAIR,MAAM,GAAG,CAAC,IAAI,CAACA,MAAM;IACzB,MAAMY,eAAoB,GAAG,EAAE;IAE/B,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,IAAI,CAACZ,YAAY,CAACa,MAAM,EAAED,CAAC,EAAE,EAAE;MACjD,MAAME,GAAG,GAAG,IAAI,CAACd,YAAY,CAACY,CAAC,CAAC;MAGhC,IAAIb,MAAM,GAAGe,GAAG,CAACL,UAAU,IAAI,CAAC,EAAE;QAChCV,MAAM,IAAIe,GAAG,CAACL,UAAU;QAExB;MACF;MAKA,MAAMM,KAAK,GAAGhB,MAAM,IAAI,CAAC,GAAGiB,IAAI,CAACC,GAAG,CAAClB,MAAM,CAAC,GAAG,CAAC;MAChD,IAAIM,GAAW;MAGf,IAAIU,KAAK,GAAGR,KAAK,IAAIO,GAAG,CAACL,UAAU,EAAE;QACnCJ,GAAG,GAAGU,KAAK,GAAGR,KAAK;QACnBI,eAAe,CAACP,IAAI,CAAC,CAACQ,CAAC,EAAE,CAACG,KAAK,EAAEV,GAAG,CAAC,CAAC,CAAC;QACvC,OAAOM,eAAe;MACxB;MAGAN,GAAG,GAAGS,GAAG,CAACL,UAAU;MACpBE,eAAe,CAACP,IAAI,CAAC,CAACQ,CAAC,EAAE,CAACG,KAAK,EAAEV,GAAG,CAAC,CAAC,CAAC;MAGvCE,KAAK,IAAIO,GAAG,CAACL,UAAU,GAAGM,KAAK;MAC/BhB,MAAM,IAAIe,GAAG,CAACL,UAAU;IAC1B;IAGA,OAAO,IAAI;EACb;EAQAS,WAAWA,CAACX,KAAa,EAAmB;IAC1C,MAAMY,aAAa,GAAG,IAAI,CAACT,iBAAiB,CAACH,KAAK,CAAC;IAGnD,IAAI,CAACY,aAAa,IAAI,IAAI,CAAClB,KAAK,EAAE;MAChC,MAAM,IAAImB,KAAK,CAAC,uBAAuB,CAAC;IAC1C;IAEA,IAAI,CAACD,aAAa,EAAE;MAElB,OAAO,IAAI;IACb;IAGA,IAAIA,aAAa,CAACN,MAAM,KAAK,CAAC,EAAE;MAC9B,MAAM,CAACQ,WAAW,EAAE,CAACN,KAAK,EAAEV,GAAG,CAAC,CAAC,GAAGc,aAAa,CAAC,CAAC,CAAC;MACpD,MAAMhB,WAAW,GAAG,IAAI,CAACH,YAAY,CAACqB,WAAW,CAAC;MAClD,MAAMC,IAAI,GAAG,IAAIC,QAAQ,CAACpB,WAAW,EAAEY,KAAK,EAAEV,GAAG,GAAGU,KAAK,CAAC;MAE1D,IAAI,CAAChB,MAAM,IAAIQ,KAAK;MACpB,IAAI,CAACiB,cAAc,CAAC,CAAC;MACrB,OAAOF,IAAI;IACb;IAGA,MAAMA,IAAI,GAAG,IAAIC,QAAQ,CAAC,IAAI,CAACE,oBAAoB,CAACN,aAAa,CAAC,CAAC;IACnE,IAAI,CAACpB,MAAM,IAAIQ,KAAK;IACpB,IAAI,CAACiB,cAAc,CAAC,CAAC;IACrB,OAAOF,IAAI;EACb;EAKAE,cAAcA,CAAA,EAAS;IACrB,OACE,IAAI,CAACxB,YAAY,CAACa,MAAM,GAAG,CAAC,IAC5B,IAAI,CAACd,MAAM,GAAG,IAAI,CAACD,cAAc,IAAI,IAAI,CAACE,YAAY,CAAC,CAAC,CAAC,CAACS,UAAU,EACpE;MACA,IAAI,CAACV,MAAM,IAAI,IAAI,CAACC,YAAY,CAAC,CAAC,CAAC,CAACS,UAAU;MAC9C,IAAI,CAACT,YAAY,CAAC0B,KAAK,CAAC,CAAC;IAC3B;EACF;EAYAD,oBAAoBA,CAACN,aAAoB,EAAmB;IAC1D,IAAIV,UAAkB,GAAG,CAAC;IAC1B,KAAK,MAAMkB,YAAY,IAAIR,aAAa,EAAE;MACxC,MAAM,CAACJ,KAAK,EAAEV,GAAG,CAAC,GAAGsB,YAAY,CAAC,CAAC,CAAC;MACpClB,UAAU,IAAIJ,GAAG,GAAGU,KAAK;IAC3B;IAEA,MAAMa,MAAM,GAAG,IAAIC,UAAU,CAACpB,UAAU,CAAC;IAGzC,IAAIqB,YAAoB,GAAG,CAAC;IAC5B,KAAK,MAAMH,YAAY,IAAIR,aAAa,EAAE;MACxC,MAAM,CAACE,WAAW,EAAE,CAACN,KAAK,EAAEV,GAAG,CAAC,CAAC,GAAGsB,YAAY;MAChD,MAAMI,WAAW,GAAG,IAAIF,UAAU,CAAC,IAAI,CAAC7B,YAAY,CAACqB,WAAW,CAAC,CAAC;MAClEO,MAAM,CAACI,GAAG,CAACD,WAAW,CAACE,QAAQ,CAAClB,KAAK,EAAEV,GAAG,CAAC,EAAEyB,YAAY,CAAC;MAC1DA,YAAY,IAAIzB,GAAG,GAAGU,KAAK;IAC7B;IAEA,OAAOa,MAAM,CAACM,MAAM;EACtB;EAIAC,IAAIA,CAAC5B,KAAa,EAAQ;IACxB,IAAI,CAACR,MAAM,IAAIQ,KAAK;EACtB;EAIA6B,MAAMA,CAAC7B,KAAa,EAAQ;IAE1B,IAAI,CAACR,MAAM,IAAIQ,KAAK;EACtB;AACF;AAAC8B,OAAA,CAAAxC,OAAA,GAAAJ,iBAAA"}
|
|
@@ -5,44 +5,31 @@ Object.defineProperty(exports, "__esModule", {
|
|
|
5
5
|
value: true
|
|
6
6
|
});
|
|
7
7
|
exports.default = void 0;
|
|
8
|
-
var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime/helpers/classCallCheck"));
|
|
9
|
-
var _createClass2 = _interopRequireDefault(require("@babel/runtime/helpers/createClass"));
|
|
10
8
|
var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
(0, _classCallCheck2.default)(this, BinaryReader);
|
|
9
|
+
class BinaryReader {
|
|
10
|
+
constructor(arrayBuffer) {
|
|
14
11
|
(0, _defineProperty2.default)(this, "offset", void 0);
|
|
15
12
|
(0, _defineProperty2.default)(this, "arrayBuffer", void 0);
|
|
16
13
|
this.offset = 0;
|
|
17
14
|
this.arrayBuffer = arrayBuffer;
|
|
18
15
|
}
|
|
19
|
-
(
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
key: "getDataView",
|
|
26
|
-
value: function getDataView(bytes) {
|
|
27
|
-
if (bytes && !this.hasAvailableBytes(bytes)) {
|
|
28
|
-
throw new Error('binary data exhausted');
|
|
29
|
-
}
|
|
30
|
-
var dataView = bytes ? new DataView(this.arrayBuffer, this.offset, bytes) : new DataView(this.arrayBuffer, this.offset);
|
|
31
|
-
this.offset += bytes;
|
|
32
|
-
return dataView;
|
|
33
|
-
}
|
|
34
|
-
}, {
|
|
35
|
-
key: "skip",
|
|
36
|
-
value: function skip(bytes) {
|
|
37
|
-
this.offset += bytes;
|
|
38
|
-
}
|
|
39
|
-
}, {
|
|
40
|
-
key: "rewind",
|
|
41
|
-
value: function rewind(bytes) {
|
|
42
|
-
this.offset -= bytes;
|
|
16
|
+
hasAvailableBytes(bytes) {
|
|
17
|
+
return this.arrayBuffer.byteLength - this.offset >= bytes;
|
|
18
|
+
}
|
|
19
|
+
getDataView(bytes) {
|
|
20
|
+
if (bytes && !this.hasAvailableBytes(bytes)) {
|
|
21
|
+
throw new Error('binary data exhausted');
|
|
43
22
|
}
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
23
|
+
const dataView = bytes ? new DataView(this.arrayBuffer, this.offset, bytes) : new DataView(this.arrayBuffer, this.offset);
|
|
24
|
+
this.offset += bytes;
|
|
25
|
+
return dataView;
|
|
26
|
+
}
|
|
27
|
+
skip(bytes) {
|
|
28
|
+
this.offset += bytes;
|
|
29
|
+
}
|
|
30
|
+
rewind(bytes) {
|
|
31
|
+
this.offset -= bytes;
|
|
32
|
+
}
|
|
33
|
+
}
|
|
47
34
|
exports.default = BinaryReader;
|
|
48
35
|
//# sourceMappingURL=binary-reader.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"binary-reader.js","names":["BinaryReader","
|
|
1
|
+
{"version":3,"file":"binary-reader.js","names":["BinaryReader","constructor","arrayBuffer","_defineProperty2","default","offset","hasAvailableBytes","bytes","byteLength","getDataView","Error","dataView","DataView","skip","rewind","exports"],"sources":["../../../../src/lib/streaming/binary-reader.ts"],"sourcesContent":["export default class BinaryReader {\n offset: number;\n arrayBuffer: ArrayBuffer;\n\n constructor(arrayBuffer: ArrayBuffer) {\n /** current global (stream) offset */\n this.offset = 0;\n /** current buffer from iterator */\n this.arrayBuffer = arrayBuffer;\n }\n /**\n * Checks if there are available bytes in data\n *\n * @param bytes\n * @returns boolean\n */\n hasAvailableBytes(bytes: number): boolean {\n return this.arrayBuffer.byteLength - this.offset >= bytes;\n }\n\n /**\n * Get the required number of bytes from the iterator\n *\n * @param bytes\n * @returns Dataview\n */\n getDataView(bytes: number): DataView {\n if (bytes && !this.hasAvailableBytes(bytes)) {\n throw new Error('binary data exhausted');\n }\n\n const dataView = bytes\n ? new DataView(this.arrayBuffer, this.offset, bytes)\n : new DataView(this.arrayBuffer, this.offset);\n this.offset += bytes;\n return dataView;\n }\n\n /**\n * Skipping\n *\n * @param bytes\n */\n skip(bytes: number): void {\n this.offset += bytes;\n }\n\n /**\n * Rewinding\n *\n * @param bytes\n */\n rewind(bytes: number): void {\n this.offset -= bytes;\n }\n}\n"],"mappings":";;;;;;;;AAAe,MAAMA,YAAY,CAAC;EAIhCC,WAAWA,CAACC,WAAwB,EAAE;IAAA,IAAAC,gBAAA,CAAAC,OAAA;IAAA,IAAAD,gBAAA,CAAAC,OAAA;IAEpC,IAAI,CAACC,MAAM,GAAG,CAAC;IAEf,IAAI,CAACH,WAAW,GAAGA,WAAW;EAChC;EAOAI,iBAAiBA,CAACC,KAAa,EAAW;IACxC,OAAO,IAAI,CAACL,WAAW,CAACM,UAAU,GAAG,IAAI,CAACH,MAAM,IAAIE,KAAK;EAC3D;EAQAE,WAAWA,CAACF,KAAa,EAAY;IACnC,IAAIA,KAAK,IAAI,CAAC,IAAI,CAACD,iBAAiB,CAACC,KAAK,CAAC,EAAE;MAC3C,MAAM,IAAIG,KAAK,CAAC,uBAAuB,CAAC;IAC1C;IAEA,MAAMC,QAAQ,GAAGJ,KAAK,GAClB,IAAIK,QAAQ,CAAC,IAAI,CAACV,WAAW,EAAE,IAAI,CAACG,MAAM,EAAEE,KAAK,CAAC,GAClD,IAAIK,QAAQ,CAAC,IAAI,CAACV,WAAW,EAAE,IAAI,CAACG,MAAM,CAAC;IAC/C,IAAI,CAACA,MAAM,IAAIE,KAAK;IACpB,OAAOI,QAAQ;EACjB;EAOAE,IAAIA,CAACN,KAAa,EAAQ;IACxB,IAAI,CAACF,MAAM,IAAIE,KAAK;EACtB;EAOAO,MAAMA,CAACP,KAAa,EAAQ;IAC1B,IAAI,CAACF,MAAM,IAAIE,KAAK;EACtB;AACF;AAACQ,OAAA,CAAAX,OAAA,GAAAJ,YAAA"}
|
|
@@ -1,89 +1,48 @@
|
|
|
1
1
|
"use strict";
|
|
2
2
|
|
|
3
|
-
var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
|
|
4
3
|
Object.defineProperty(exports, "__esModule", {
|
|
5
4
|
value: true
|
|
6
5
|
});
|
|
7
6
|
exports.zipBatchIterators = zipBatchIterators;
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
_context.next = 8;
|
|
34
|
-
return (0, _awaitAsyncGenerator2.default)(iterator1.next());
|
|
35
|
-
case 8:
|
|
36
|
-
_yield$_awaitAsyncGen = _context.sent;
|
|
37
|
-
value = _yield$_awaitAsyncGen.value;
|
|
38
|
-
done = _yield$_awaitAsyncGen.done;
|
|
39
|
-
if (done) {
|
|
40
|
-
iterator1Done = true;
|
|
41
|
-
} else {
|
|
42
|
-
batch1 = value;
|
|
43
|
-
}
|
|
44
|
-
_context.next = 21;
|
|
45
|
-
break;
|
|
46
|
-
case 14:
|
|
47
|
-
if (!(batch2.length === 0 && !iterator2Done)) {
|
|
48
|
-
_context.next = 21;
|
|
49
|
-
break;
|
|
50
|
-
}
|
|
51
|
-
_context.next = 17;
|
|
52
|
-
return (0, _awaitAsyncGenerator2.default)(iterator2.next());
|
|
53
|
-
case 17:
|
|
54
|
-
_yield$_awaitAsyncGen2 = _context.sent;
|
|
55
|
-
_value = _yield$_awaitAsyncGen2.value;
|
|
56
|
-
_done = _yield$_awaitAsyncGen2.done;
|
|
57
|
-
if (_done) {
|
|
58
|
-
iterator2Done = true;
|
|
59
|
-
} else {
|
|
60
|
-
batch2 = _value;
|
|
61
|
-
}
|
|
62
|
-
case 21:
|
|
63
|
-
batch = extractBatch(batch1, batch2);
|
|
64
|
-
if (!batch) {
|
|
65
|
-
_context.next = 25;
|
|
66
|
-
break;
|
|
67
|
-
}
|
|
68
|
-
_context.next = 25;
|
|
69
|
-
return batch;
|
|
70
|
-
case 25:
|
|
71
|
-
_context.next = 4;
|
|
72
|
-
break;
|
|
73
|
-
case 27:
|
|
74
|
-
case "end":
|
|
75
|
-
return _context.stop();
|
|
7
|
+
async function* zipBatchIterators(iterator1, iterator2) {
|
|
8
|
+
let batch1 = [];
|
|
9
|
+
let batch2 = [];
|
|
10
|
+
let iterator1Done = false;
|
|
11
|
+
let iterator2Done = false;
|
|
12
|
+
while (!iterator1Done && !iterator2Done) {
|
|
13
|
+
if (batch1.length === 0 && !iterator1Done) {
|
|
14
|
+
const {
|
|
15
|
+
value,
|
|
16
|
+
done
|
|
17
|
+
} = await iterator1.next();
|
|
18
|
+
if (done) {
|
|
19
|
+
iterator1Done = true;
|
|
20
|
+
} else {
|
|
21
|
+
batch1 = value;
|
|
22
|
+
}
|
|
23
|
+
} else if (batch2.length === 0 && !iterator2Done) {
|
|
24
|
+
const {
|
|
25
|
+
value,
|
|
26
|
+
done
|
|
27
|
+
} = await iterator2.next();
|
|
28
|
+
if (done) {
|
|
29
|
+
iterator2Done = true;
|
|
30
|
+
} else {
|
|
31
|
+
batch2 = value;
|
|
76
32
|
}
|
|
77
|
-
}
|
|
78
|
-
|
|
79
|
-
|
|
33
|
+
}
|
|
34
|
+
const batch = extractBatch(batch1, batch2);
|
|
35
|
+
if (batch) {
|
|
36
|
+
yield batch;
|
|
37
|
+
}
|
|
38
|
+
}
|
|
80
39
|
}
|
|
81
40
|
function extractBatch(batch1, batch2) {
|
|
82
|
-
|
|
41
|
+
const batchLength = Math.min(batch1.length, batch2.length);
|
|
83
42
|
if (batchLength === 0) {
|
|
84
43
|
return null;
|
|
85
44
|
}
|
|
86
|
-
|
|
45
|
+
const batch = [batch1.slice(0, batchLength), batch2.slice(0, batchLength)];
|
|
87
46
|
batch1.splice(0, batchLength);
|
|
88
47
|
batch2.splice(0, batchLength);
|
|
89
48
|
return batch;
|