@loaders.gl/flatgeobuf 4.1.0-alpha.8 → 4.1.0
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/dist.dev.js +1 -1
- package/dist/flatgeobuf/3.27.2/column-meta.d.ts +1 -1
- package/dist/flatgeobuf/3.27.2/column-meta.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/column-meta.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/dumptree.js +3 -3
- package/dist/flatgeobuf/3.27.2/dumptree.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/feature.d.ts +1 -1
- package/dist/flatgeobuf/3.27.2/feature.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/feature.js +1 -1
- package/dist/flatgeobuf/3.27.2/feature.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/flat-geobuf/column.d.ts +1 -1
- package/dist/flatgeobuf/3.27.2/flat-geobuf/column.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/flat-geobuf/column.js +1 -1
- package/dist/flatgeobuf/3.27.2/flat-geobuf/column.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/flat-geobuf/feature.d.ts +2 -2
- package/dist/flatgeobuf/3.27.2/flat-geobuf/feature.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/flat-geobuf/feature.js +2 -2
- package/dist/flatgeobuf/3.27.2/flat-geobuf/feature.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/flat-geobuf/geometry.d.ts +1 -1
- package/dist/flatgeobuf/3.27.2/flat-geobuf/geometry.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/flat-geobuf/geometry.js +1 -1
- package/dist/flatgeobuf/3.27.2/flat-geobuf/geometry.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/flat-geobuf/header.d.ts +3 -3
- package/dist/flatgeobuf/3.27.2/flat-geobuf/header.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/flat-geobuf/header.js +3 -3
- package/dist/flatgeobuf/3.27.2/flat-geobuf/header.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/flat-geobuf.d.ts +5 -5
- package/dist/flatgeobuf/3.27.2/flat-geobuf.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/flat-geobuf.js +5 -5
- package/dist/flatgeobuf/3.27.2/flat-geobuf.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/generic/feature.d.ts +4 -4
- package/dist/flatgeobuf/3.27.2/generic/feature.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/generic/feature.js +3 -3
- package/dist/flatgeobuf/3.27.2/generic/feature.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/generic/featurecollection.d.ts +6 -6
- package/dist/flatgeobuf/3.27.2/generic/featurecollection.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/generic/featurecollection.js +12 -12
- package/dist/flatgeobuf/3.27.2/generic/featurecollection.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/generic/geometry.d.ts +2 -2
- package/dist/flatgeobuf/3.27.2/generic/geometry.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/generic/geometry.js +2 -2
- package/dist/flatgeobuf/3.27.2/generic/geometry.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/generic/header.d.ts +3 -3
- package/dist/flatgeobuf/3.27.2/generic/header.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/generic/header.js +2 -2
- package/dist/flatgeobuf/3.27.2/generic/header.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/generic.d.ts +7 -7
- package/dist/flatgeobuf/3.27.2/generic.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/generic.js +4 -4
- package/dist/flatgeobuf/3.27.2/generic.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/geojson/feature.d.ts +3 -3
- package/dist/flatgeobuf/3.27.2/geojson/feature.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/geojson/feature.js +2 -2
- package/dist/flatgeobuf/3.27.2/geojson/feature.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/geojson/featurecollection.d.ts +2 -2
- package/dist/flatgeobuf/3.27.2/geojson/featurecollection.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/geojson/featurecollection.js +6 -6
- package/dist/flatgeobuf/3.27.2/geojson/featurecollection.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/geojson/geometry.d.ts +3 -3
- package/dist/flatgeobuf/3.27.2/geojson/geometry.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/geojson/geometry.js +2 -2
- package/dist/flatgeobuf/3.27.2/geojson/geometry.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/geojson.d.ts +3 -3
- package/dist/flatgeobuf/3.27.2/geojson.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/geojson.js +1 -1
- package/dist/flatgeobuf/3.27.2/geojson.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/header-meta.d.ts +3 -3
- package/dist/flatgeobuf/3.27.2/header-meta.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/header-meta.js +1 -1
- package/dist/flatgeobuf/3.27.2/header-meta.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/header.d.ts +1 -1
- package/dist/flatgeobuf/3.27.2/header.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/header.js +1 -1
- package/dist/flatgeobuf/3.27.2/header.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/http-reader.d.ts +3 -3
- package/dist/flatgeobuf/3.27.2/http-reader.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/http-reader.js +6 -6
- package/dist/flatgeobuf/3.27.2/http-reader.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/index.d.ts +13 -13
- package/dist/flatgeobuf/3.27.2/index.d.ts.map +1 -1
- package/dist/flatgeobuf/3.27.2/index.js +13 -13
- package/dist/flatgeobuf/3.27.2/index.js.map +1 -1
- package/dist/flatgeobuf/3.27.2/packedrtree.js +2 -2
- package/dist/flatgeobuf/3.27.2/packedrtree.js.map +1 -1
- package/dist/flatgeobuf-loader.js +1 -1
- package/dist/flatgeobuf-loader.js.map +1 -1
- package/dist/flatgeobuf-worker.js +1 -1
- package/dist/lib/get-schema-from-fgb-header.d.ts.map +1 -1
- package/dist/lib/get-schema-from-fgb-header.js.map +1 -1
- package/dist/lib/parse-flatgeobuf.js +2 -2
- package/dist/lib/parse-flatgeobuf.js.map +1 -1
- package/package.json +6 -6
- package/src/flatgeobuf/3.27.2/.DS_Store +0 -0
- package/src/flatgeobuf/3.27.2/column-meta.ts +1 -1
- package/src/flatgeobuf/3.27.2/dumptree.ts +3 -3
- package/src/flatgeobuf/3.27.2/feature.ts +1 -1
- package/src/flatgeobuf/3.27.2/flat-geobuf/column.ts +1 -1
- package/src/flatgeobuf/3.27.2/flat-geobuf/feature.ts +2 -2
- package/src/flatgeobuf/3.27.2/flat-geobuf/geometry.ts +1 -1
- package/src/flatgeobuf/3.27.2/flat-geobuf/header.ts +3 -3
- package/src/flatgeobuf/3.27.2/flat-geobuf.ts +5 -5
- package/src/flatgeobuf/3.27.2/generic/feature.ts +5 -5
- package/src/flatgeobuf/3.27.2/generic/featurecollection.ts +17 -17
- package/src/flatgeobuf/3.27.2/generic/geometry.ts +2 -2
- package/src/flatgeobuf/3.27.2/generic/header.ts +4 -4
- package/src/flatgeobuf/3.27.2/generic.ts +7 -7
- package/src/flatgeobuf/3.27.2/geojson/feature.ts +5 -5
- package/src/flatgeobuf/3.27.2/geojson/featurecollection.ts +10 -10
- package/src/flatgeobuf/3.27.2/geojson/geometry.ts +3 -3
- package/src/flatgeobuf/3.27.2/geojson.ts +4 -4
- package/src/flatgeobuf/3.27.2/header-meta.ts +4 -4
- package/src/flatgeobuf/3.27.2/header.ts +1 -1
- package/src/flatgeobuf/3.27.2/http-reader.ts +6 -6
- package/src/flatgeobuf/3.27.2/index.ts +14 -14
- package/src/flatgeobuf/3.27.2/packedrtree.ts +2 -2
- package/src/lib/get-schema-from-fgb-header.ts +2 -0
- package/src/lib/parse-flatgeobuf.ts +2 -2
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"featurecollection.js","names":["fromFeature","parseGeometry","parseGC","buildHeader","deserialize","genericDeserialize","deserializeStream","genericDeserializeStream","deserializeFiltered","genericDeserializeFiltered","mapColumn","buildFeature","magicbytes","inferGeometryType","serialize","featurecollection","headerMeta","introspectHeaderMeta","header","features","map","f","geometry","type","properties","featuresLength","length","reduce","a","b","uint8","Uint8Array","set","offset","feature","bytes","headerMetaFn","stream","url","rect","columns","Object","keys","k","geometryType","envelope","featuresCount","indexNodeSize","crs","title","description","metadata"],"sources":["../../../../src/flatgeobuf/3.27.2/geojson/featurecollection.ts"],"sourcesContent":["import ColumnMeta from '../column-meta
|
|
1
|
+
{"version":3,"file":"featurecollection.js","names":["fromFeature","parseGeometry","parseGC","buildHeader","deserialize","genericDeserialize","deserializeStream","genericDeserializeStream","deserializeFiltered","genericDeserializeFiltered","mapColumn","buildFeature","magicbytes","inferGeometryType","serialize","featurecollection","headerMeta","introspectHeaderMeta","header","features","map","f","geometry","type","properties","featuresLength","length","reduce","a","b","uint8","Uint8Array","set","offset","feature","bytes","headerMetaFn","stream","url","rect","columns","Object","keys","k","geometryType","envelope","featuresCount","indexNodeSize","crs","title","description","metadata"],"sources":["../../../../src/flatgeobuf/3.27.2/geojson/featurecollection.ts"],"sourcesContent":["import ColumnMeta from '../column-meta';\nimport HeaderMeta from '../header-meta';\n\nimport {fromFeature} from './feature';\nimport {parseGeometry, parseGC} from './geometry';\nimport {\n buildHeader,\n deserialize as genericDeserialize,\n deserializeStream as genericDeserializeStream,\n deserializeFiltered as genericDeserializeFiltered,\n mapColumn\n} from '../generic/featurecollection';\nimport {Rect} from '../packedrtree';\nimport {buildFeature, IProperties} from '../generic/feature';\nimport {HeaderMetaFn} from '../generic';\nimport {magicbytes} from '../constants';\nimport {inferGeometryType} from '../generic/header';\n\nimport {\n FeatureCollection as GeoJsonFeatureCollection,\n // Point,\n // MultiPoint,\n // LineString,\n // MultiLineString,\n // Polygon,\n // MultiPolygon,\n GeometryCollection\n} from 'geojson';\n\nexport function serialize(featurecollection: GeoJsonFeatureCollection): Uint8Array {\n const headerMeta = introspectHeaderMeta(featurecollection);\n const header = buildHeader(headerMeta);\n const features: Uint8Array[] = featurecollection.features.map((f) =>\n buildFeature(\n f.geometry.type === 'GeometryCollection'\n ? parseGC(f.geometry as GeometryCollection)\n : parseGeometry(f.geometry),\n f.properties as IProperties,\n headerMeta\n )\n );\n const featuresLength = features.map((f) => f.length).reduce((a, b) => a + b);\n const uint8 = new Uint8Array(magicbytes.length + header.length + featuresLength);\n uint8.set(header, magicbytes.length);\n let offset = magicbytes.length + header.length;\n for (const feature of features) {\n uint8.set(feature, offset);\n offset += feature.length;\n }\n uint8.set(magicbytes);\n return uint8;\n}\n\nexport function deserialize(\n bytes: Uint8Array,\n headerMetaFn?: HeaderMetaFn\n): GeoJsonFeatureCollection {\n const features = genericDeserialize(bytes, fromFeature, headerMetaFn);\n return {\n type: 'FeatureCollection',\n features\n } as GeoJsonFeatureCollection;\n}\n\nexport function deserializeStream(\n stream: ReadableStream,\n headerMetaFn?: HeaderMetaFn\n): AsyncGenerator<any, void, unknown> {\n return genericDeserializeStream(stream, fromFeature, headerMetaFn);\n}\n\nexport function deserializeFiltered(\n url: string,\n rect: Rect,\n headerMetaFn?: HeaderMetaFn\n): AsyncGenerator<any, void, unknown> {\n return genericDeserializeFiltered(url, rect, fromFeature, headerMetaFn);\n}\n\nfunction introspectHeaderMeta(featurecollection: GeoJsonFeatureCollection): HeaderMeta {\n const feature = featurecollection.features[0];\n const properties = feature.properties;\n\n let columns: ColumnMeta[] | null = null;\n if (properties) columns = Object.keys(properties).map((k) => mapColumn(properties, k));\n\n const geometryType = inferGeometryType(featurecollection.features);\n const headerMeta: HeaderMeta = {\n geometryType,\n columns,\n envelope: null,\n featuresCount: featurecollection.features.length,\n indexNodeSize: 0,\n crs: null,\n title: null,\n description: null,\n metadata: null\n };\n\n return headerMeta;\n}\n"],"mappings":"SAGQA,WAAW;AAAA,SACXC,aAAa,EAAEC,OAAO;AAAA,SAE5BC,WAAW,EACXC,WAAW,IAAIC,kBAAkB,EACjCC,iBAAiB,IAAIC,wBAAwB,EAC7CC,mBAAmB,IAAIC,0BAA0B,EACjDC,SAAS;AAAA,SAGHC,YAAY;AAAA,SAEZC,UAAU;AAAA,SACVC,iBAAiB;AAazB,OAAO,SAASC,SAASA,CAACC,iBAA2C,EAAc;EACjF,MAAMC,UAAU,GAAGC,oBAAoB,CAACF,iBAAiB,CAAC;EAC1D,MAAMG,MAAM,GAAGf,WAAW,CAACa,UAAU,CAAC;EACtC,MAAMG,QAAsB,GAAGJ,iBAAiB,CAACI,QAAQ,CAACC,GAAG,CAAEC,CAAC,IAC9DV,YAAY,CACVU,CAAC,CAACC,QAAQ,CAACC,IAAI,KAAK,oBAAoB,GACpCrB,OAAO,CAACmB,CAAC,CAACC,QAA8B,CAAC,GACzCrB,aAAa,CAACoB,CAAC,CAACC,QAAQ,CAAC,EAC7BD,CAAC,CAACG,UAAU,EACZR,UACF,CACF,CAAC;EACD,MAAMS,cAAc,GAAGN,QAAQ,CAACC,GAAG,CAAEC,CAAC,IAAKA,CAAC,CAACK,MAAM,CAAC,CAACC,MAAM,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,GAAGC,CAAC,CAAC;EAC5E,MAAMC,KAAK,GAAG,IAAIC,UAAU,CAACnB,UAAU,CAACc,MAAM,GAAGR,MAAM,CAACQ,MAAM,GAAGD,cAAc,CAAC;EAChFK,KAAK,CAACE,GAAG,CAACd,MAAM,EAAEN,UAAU,CAACc,MAAM,CAAC;EACpC,IAAIO,MAAM,GAAGrB,UAAU,CAACc,MAAM,GAAGR,MAAM,CAACQ,MAAM;EAC9C,KAAK,MAAMQ,OAAO,IAAIf,QAAQ,EAAE;IAC9BW,KAAK,CAACE,GAAG,CAACE,OAAO,EAAED,MAAM,CAAC;IAC1BA,MAAM,IAAIC,OAAO,CAACR,MAAM;EAC1B;EACAI,KAAK,CAACE,GAAG,CAACpB,UAAU,CAAC;EACrB,OAAOkB,KAAK;AACd;AAEA,OAAO,SAAS1B,WAAWA,CACzB+B,KAAiB,EACjBC,YAA2B,EACD;EAC1B,MAAMjB,QAAQ,GAAGd,kBAAkB,CAAC8B,KAAK,EAAEnC,WAAW,EAAEoC,YAAY,CAAC;EACrE,OAAO;IACLb,IAAI,EAAE,mBAAmB;IACzBJ;EACF,CAAC;AACH;AAEA,OAAO,SAASb,iBAAiBA,CAC/B+B,MAAsB,EACtBD,YAA2B,EACS;EACpC,OAAO7B,wBAAwB,CAAC8B,MAAM,EAAErC,WAAW,EAAEoC,YAAY,CAAC;AACpE;AAEA,OAAO,SAAS5B,mBAAmBA,CACjC8B,GAAW,EACXC,IAAU,EACVH,YAA2B,EACS;EACpC,OAAO3B,0BAA0B,CAAC6B,GAAG,EAAEC,IAAI,EAAEvC,WAAW,EAAEoC,YAAY,CAAC;AACzE;AAEA,SAASnB,oBAAoBA,CAACF,iBAA2C,EAAc;EACrF,MAAMmB,OAAO,GAAGnB,iBAAiB,CAACI,QAAQ,CAAC,CAAC,CAAC;EAC7C,MAAMK,UAAU,GAAGU,OAAO,CAACV,UAAU;EAErC,IAAIgB,OAA4B,GAAG,IAAI;EACvC,IAAIhB,UAAU,EAAEgB,OAAO,GAAGC,MAAM,CAACC,IAAI,CAAClB,UAAU,CAAC,CAACJ,GAAG,CAAEuB,CAAC,IAAKjC,SAAS,CAACc,UAAU,EAAEmB,CAAC,CAAC,CAAC;EAEtF,MAAMC,YAAY,GAAG/B,iBAAiB,CAACE,iBAAiB,CAACI,QAAQ,CAAC;EAClE,MAAMH,UAAsB,GAAG;IAC7B4B,YAAY;IACZJ,OAAO;IACPK,QAAQ,EAAE,IAAI;IACdC,aAAa,EAAE/B,iBAAiB,CAACI,QAAQ,CAACO,MAAM;IAChDqB,aAAa,EAAE,CAAC;IAChBC,GAAG,EAAE,IAAI;IACTC,KAAK,EAAE,IAAI;IACXC,WAAW,EAAE,IAAI;IACjBC,QAAQ,EAAE;EACZ,CAAC;EAED,OAAOnC,UAAU;AACnB"}
|
|
@@ -1,7 +1,7 @@
|
|
|
1
|
-
import { GeometryType } from '../flat-geobuf/geometry-type
|
|
2
|
-
import { Geometry } from '../flat-geobuf/geometry
|
|
1
|
+
import { GeometryType } from '../flat-geobuf/geometry-type';
|
|
2
|
+
import { Geometry } from '../flat-geobuf/geometry';
|
|
3
3
|
import { Geometry as GeoJsonGeometry, Point, MultiPoint, LineString, MultiLineString, Polygon, MultiPolygon, GeometryCollection } from 'geojson';
|
|
4
|
-
import { IParsedGeometry } from '../generic/geometry
|
|
4
|
+
import { IParsedGeometry } from '../generic/geometry';
|
|
5
5
|
export interface IGeoJsonGeometry {
|
|
6
6
|
type: string;
|
|
7
7
|
coordinates: number[] | number[][] | number[][][] | number[][][][];
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"geometry.d.ts","sourceRoot":"","sources":["../../../../src/flatgeobuf/3.27.2/geojson/geometry.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,YAAY,EAAC,MAAM,
|
|
1
|
+
{"version":3,"file":"geometry.d.ts","sourceRoot":"","sources":["../../../../src/flatgeobuf/3.27.2/geojson/geometry.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,YAAY,EAAC,MAAM,8BAA8B,CAAC;AAC1D,OAAO,EAAC,QAAQ,EAAC,MAAM,yBAAyB,CAAC;AAEjD,OAAO,EACL,QAAQ,IAAI,eAAe,EAC3B,KAAK,EACL,UAAU,EACV,UAAU,EACV,eAAe,EACf,OAAO,EACP,YAAY,EACZ,kBAAkB,EACnB,MAAM,SAAS,CAAC;AAEjB,OAAO,EAAC,eAAe,EAA4C,MAAM,qBAAqB,CAAC;AAE/F,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;IACnE,UAAU,CAAC,EAAE,gBAAgB,EAAE,CAAC;CACjC;AAED,wBAAgB,aAAa,CAC3B,QAAQ,EAAE,KAAK,GAAG,UAAU,GAAG,UAAU,GAAG,eAAe,GAAG,OAAO,GAAG,YAAY,GACnF,eAAe,CAwCjB;AAED,wBAAgB,OAAO,CAAC,QAAQ,EAAE,kBAAkB,GAAG,eAAe,CAYrE;AAiCD,wBAAgB,YAAY,CAAC,QAAQ,EAAE,QAAQ,EAAE,UAAU,EAAE,YAAY,GAAG,eAAe,CA8B1F"}
|
|
@@ -1,5 +1,5 @@
|
|
|
1
|
-
import { GeometryType } from
|
|
2
|
-
import { flat, pairFlatCoordinates, toGeometryType } from
|
|
1
|
+
import { GeometryType } from "../flat-geobuf/geometry-type.js";
|
|
2
|
+
import { flat, pairFlatCoordinates, toGeometryType } from "../generic/geometry.js";
|
|
3
3
|
export function parseGeometry(geometry) {
|
|
4
4
|
const cs = geometry.coordinates;
|
|
5
5
|
const xy = [];
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"geometry.js","names":["GeometryType","flat","pairFlatCoordinates","toGeometryType","parseGeometry","geometry","cs","coordinates","xy","z","ends","parts","type","end","css","length","map","c","csss","geometries","undefined","parseGC","i","g","push","extractParts","s","xySlices","Array","from","e","slice","zSlices","toGeoJsonCoordinates","xyArray","zArray","Point","a","MultiPoint","LineString","MultiLineString","endsArray","Polygon","fromGeometry","headerType","Unknown","GeometryCollection","partsLength","part","partType","MultiPolygon"],"sources":["../../../../src/flatgeobuf/3.27.2/geojson/geometry.ts"],"sourcesContent":["import {GeometryType} from '../flat-geobuf/geometry-type
|
|
1
|
+
{"version":3,"file":"geometry.js","names":["GeometryType","flat","pairFlatCoordinates","toGeometryType","parseGeometry","geometry","cs","coordinates","xy","z","ends","parts","type","end","css","length","map","c","csss","geometries","undefined","parseGC","i","g","push","extractParts","s","xySlices","Array","from","e","slice","zSlices","toGeoJsonCoordinates","xyArray","zArray","Point","a","MultiPoint","LineString","MultiLineString","endsArray","Polygon","fromGeometry","headerType","Unknown","GeometryCollection","partsLength","part","partType","MultiPolygon"],"sources":["../../../../src/flatgeobuf/3.27.2/geojson/geometry.ts"],"sourcesContent":["import {GeometryType} from '../flat-geobuf/geometry-type';\nimport {Geometry} from '../flat-geobuf/geometry';\n\nimport {\n Geometry as GeoJsonGeometry,\n Point,\n MultiPoint,\n LineString,\n MultiLineString,\n Polygon,\n MultiPolygon,\n GeometryCollection\n} from 'geojson';\n\nimport {IParsedGeometry, flat, pairFlatCoordinates, toGeometryType} from '../generic/geometry';\n\nexport interface IGeoJsonGeometry {\n type: string;\n coordinates: number[] | number[][] | number[][][] | number[][][][];\n geometries?: IGeoJsonGeometry[];\n}\n\nexport function parseGeometry(\n geometry: Point | MultiPoint | LineString | MultiLineString | Polygon | MultiPolygon\n): IParsedGeometry {\n const cs = geometry.coordinates;\n const xy: number[] = [];\n const z: number[] = [];\n let ends: number[] | undefined;\n let parts: IParsedGeometry[] | undefined;\n const type: GeometryType = toGeometryType(geometry.type);\n let end = 0;\n switch (geometry.type) {\n case 'Point':\n flat(cs, xy, z);\n break;\n case 'MultiPoint':\n case 'LineString':\n flat(cs as number[][], xy, z);\n break;\n case 'MultiLineString':\n case 'Polygon': {\n const css = cs as number[][][];\n flat(css, xy, z);\n if (css.length > 1) ends = css.map((c) => (end += c.length));\n break;\n }\n case 'MultiPolygon': {\n const csss = cs as number[][][][];\n const geometries = csss.map((coordinates) => ({\n type: 'Polygon',\n coordinates\n })) as Polygon[];\n parts = geometries.map(parseGeometry);\n break;\n }\n }\n return {\n xy,\n z: z.length > 0 ? z : undefined,\n ends,\n type,\n parts\n } as IParsedGeometry;\n}\n\nexport function parseGC(geometry: GeometryCollection): IParsedGeometry {\n const type: GeometryType = toGeometryType(geometry.type);\n const parts: IParsedGeometry[] = [];\n for (let i = 0; i < geometry.geometries.length; i++) {\n const g = geometry.geometries[i];\n if (g.type === 'GeometryCollection') parts.push(parseGC(g));\n else parts.push(parseGeometry(g));\n }\n return {\n type,\n parts\n } as IParsedGeometry;\n}\n\nfunction extractParts(xy: Float64Array, z: Float64Array, ends: Uint32Array) {\n if (!ends || ends.length === 0) return [pairFlatCoordinates(xy, z)];\n let s = 0;\n const xySlices = Array.from(ends).map((e) => xy.slice(s, (s = e << 1)));\n let zSlices: Float64Array[];\n if (z) {\n s = 0;\n zSlices = Array.from(ends).map((e) => z.slice(s, (s = e)));\n }\n return xySlices.map((xy, i) => pairFlatCoordinates(xy, zSlices ? zSlices[i] : undefined));\n}\n\nfunction toGeoJsonCoordinates(geometry: Geometry, type: GeometryType) {\n const xy = geometry.xyArray() as Float64Array;\n const z = geometry.zArray() as Float64Array;\n switch (type) {\n case GeometryType.Point: {\n const a = Array.from(xy);\n if (z) a.push(z[0]);\n return a;\n }\n case GeometryType.MultiPoint:\n case GeometryType.LineString:\n return pairFlatCoordinates(xy, z);\n case GeometryType.MultiLineString:\n return extractParts(xy, z, geometry.endsArray() as Uint32Array);\n case GeometryType.Polygon:\n return extractParts(xy, z, geometry.endsArray() as Uint32Array);\n }\n}\n\nexport function fromGeometry(geometry: Geometry, headerType: GeometryType): GeoJsonGeometry {\n let type = headerType;\n if (type === GeometryType.Unknown) {\n type = geometry.type();\n }\n if (type === GeometryType.GeometryCollection) {\n const geometries: GeoJsonGeometry[] = [];\n for (let i = 0; i < geometry.partsLength(); i++) {\n const part = geometry.parts(i) as Geometry;\n const partType = part.type() as GeometryType;\n geometries.push(fromGeometry(part, partType));\n }\n return {\n type: GeometryType[type],\n geometries\n } as GeoJsonGeometry;\n } else if (type === GeometryType.MultiPolygon) {\n const geometries: GeoJsonGeometry[] = [];\n for (let i = 0; i < geometry.partsLength(); i++)\n geometries.push(fromGeometry(geometry.parts(i) as Geometry, GeometryType.Polygon));\n return {\n type: GeometryType[type],\n coordinates: geometries.map((g) => (g as Polygon).coordinates)\n } as GeoJsonGeometry;\n }\n const coordinates = toGeoJsonCoordinates(geometry, type);\n return {\n type: GeometryType[type],\n coordinates\n } as GeoJsonGeometry;\n}\n"],"mappings":"SAAQA,YAAY;AAAA,SAcKC,IAAI,EAAEC,mBAAmB,EAAEC,cAAc;AAQlE,OAAO,SAASC,aAAaA,CAC3BC,QAAoF,EACnE;EACjB,MAAMC,EAAE,GAAGD,QAAQ,CAACE,WAAW;EAC/B,MAAMC,EAAY,GAAG,EAAE;EACvB,MAAMC,CAAW,GAAG,EAAE;EACtB,IAAIC,IAA0B;EAC9B,IAAIC,KAAoC;EACxC,MAAMC,IAAkB,GAAGT,cAAc,CAACE,QAAQ,CAACO,IAAI,CAAC;EACxD,IAAIC,GAAG,GAAG,CAAC;EACX,QAAQR,QAAQ,CAACO,IAAI;IACnB,KAAK,OAAO;MACVX,IAAI,CAACK,EAAE,EAAEE,EAAE,EAAEC,CAAC,CAAC;MACf;IACF,KAAK,YAAY;IACjB,KAAK,YAAY;MACfR,IAAI,CAACK,EAAE,EAAgBE,EAAE,EAAEC,CAAC,CAAC;MAC7B;IACF,KAAK,iBAAiB;IACtB,KAAK,SAAS;MAAE;QACd,MAAMK,GAAG,GAAGR,EAAkB;QAC9BL,IAAI,CAACa,GAAG,EAAEN,EAAE,EAAEC,CAAC,CAAC;QAChB,IAAIK,GAAG,CAACC,MAAM,GAAG,CAAC,EAAEL,IAAI,GAAGI,GAAG,CAACE,GAAG,CAAEC,CAAC,IAAMJ,GAAG,IAAII,CAAC,CAACF,MAAO,CAAC;QAC5D;MACF;IACA,KAAK,cAAc;MAAE;QACnB,MAAMG,IAAI,GAAGZ,EAAoB;QACjC,MAAMa,UAAU,GAAGD,IAAI,CAACF,GAAG,CAAET,WAAW,KAAM;UAC5CK,IAAI,EAAE,SAAS;UACfL;QACF,CAAC,CAAC,CAAc;QAChBI,KAAK,GAAGQ,UAAU,CAACH,GAAG,CAACZ,aAAa,CAAC;QACrC;MACF;EACF;EACA,OAAO;IACLI,EAAE;IACFC,CAAC,EAAEA,CAAC,CAACM,MAAM,GAAG,CAAC,GAAGN,CAAC,GAAGW,SAAS;IAC/BV,IAAI;IACJE,IAAI;IACJD;EACF,CAAC;AACH;AAEA,OAAO,SAASU,OAAOA,CAAChB,QAA4B,EAAmB;EACrE,MAAMO,IAAkB,GAAGT,cAAc,CAACE,QAAQ,CAACO,IAAI,CAAC;EACxD,MAAMD,KAAwB,GAAG,EAAE;EACnC,KAAK,IAAIW,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGjB,QAAQ,CAACc,UAAU,CAACJ,MAAM,EAAEO,CAAC,EAAE,EAAE;IACnD,MAAMC,CAAC,GAAGlB,QAAQ,CAACc,UAAU,CAACG,CAAC,CAAC;IAChC,IAAIC,CAAC,CAACX,IAAI,KAAK,oBAAoB,EAAED,KAAK,CAACa,IAAI,CAACH,OAAO,CAACE,CAAC,CAAC,CAAC,CAAC,KACvDZ,KAAK,CAACa,IAAI,CAACpB,aAAa,CAACmB,CAAC,CAAC,CAAC;EACnC;EACA,OAAO;IACLX,IAAI;IACJD;EACF,CAAC;AACH;AAEA,SAASc,YAAYA,CAACjB,EAAgB,EAAEC,CAAe,EAAEC,IAAiB,EAAE;EAC1E,IAAI,CAACA,IAAI,IAAIA,IAAI,CAACK,MAAM,KAAK,CAAC,EAAE,OAAO,CAACb,mBAAmB,CAACM,EAAE,EAAEC,CAAC,CAAC,CAAC;EACnE,IAAIiB,CAAC,GAAG,CAAC;EACT,MAAMC,QAAQ,GAAGC,KAAK,CAACC,IAAI,CAACnB,IAAI,CAAC,CAACM,GAAG,CAAEc,CAAC,IAAKtB,EAAE,CAACuB,KAAK,CAACL,CAAC,EAAGA,CAAC,GAAGI,CAAC,IAAI,CAAE,CAAC,CAAC;EACvE,IAAIE,OAAuB;EAC3B,IAAIvB,CAAC,EAAE;IACLiB,CAAC,GAAG,CAAC;IACLM,OAAO,GAAGJ,KAAK,CAACC,IAAI,CAACnB,IAAI,CAAC,CAACM,GAAG,CAAEc,CAAC,IAAKrB,CAAC,CAACsB,KAAK,CAACL,CAAC,EAAGA,CAAC,GAAGI,CAAE,CAAC,CAAC;EAC5D;EACA,OAAOH,QAAQ,CAACX,GAAG,CAAC,CAACR,EAAE,EAAEc,CAAC,KAAKpB,mBAAmB,CAACM,EAAE,EAAEwB,OAAO,GAAGA,OAAO,CAACV,CAAC,CAAC,GAAGF,SAAS,CAAC,CAAC;AAC3F;AAEA,SAASa,oBAAoBA,CAAC5B,QAAkB,EAAEO,IAAkB,EAAE;EACpE,MAAMJ,EAAE,GAAGH,QAAQ,CAAC6B,OAAO,CAAC,CAAiB;EAC7C,MAAMzB,CAAC,GAAGJ,QAAQ,CAAC8B,MAAM,CAAC,CAAiB;EAC3C,QAAQvB,IAAI;IACV,KAAKZ,YAAY,CAACoC,KAAK;MAAE;QACvB,MAAMC,CAAC,GAAGT,KAAK,CAACC,IAAI,CAACrB,EAAE,CAAC;QACxB,IAAIC,CAAC,EAAE4B,CAAC,CAACb,IAAI,CAACf,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,OAAO4B,CAAC;MACV;IACA,KAAKrC,YAAY,CAACsC,UAAU;IAC5B,KAAKtC,YAAY,CAACuC,UAAU;MAC1B,OAAOrC,mBAAmB,CAACM,EAAE,EAAEC,CAAC,CAAC;IACnC,KAAKT,YAAY,CAACwC,eAAe;MAC/B,OAAOf,YAAY,CAACjB,EAAE,EAAEC,CAAC,EAAEJ,QAAQ,CAACoC,SAAS,CAAC,CAAgB,CAAC;IACjE,KAAKzC,YAAY,CAAC0C,OAAO;MACvB,OAAOjB,YAAY,CAACjB,EAAE,EAAEC,CAAC,EAAEJ,QAAQ,CAACoC,SAAS,CAAC,CAAgB,CAAC;EACnE;AACF;AAEA,OAAO,SAASE,YAAYA,CAACtC,QAAkB,EAAEuC,UAAwB,EAAmB;EAC1F,IAAIhC,IAAI,GAAGgC,UAAU;EACrB,IAAIhC,IAAI,KAAKZ,YAAY,CAAC6C,OAAO,EAAE;IACjCjC,IAAI,GAAGP,QAAQ,CAACO,IAAI,CAAC,CAAC;EACxB;EACA,IAAIA,IAAI,KAAKZ,YAAY,CAAC8C,kBAAkB,EAAE;IAC5C,MAAM3B,UAA6B,GAAG,EAAE;IACxC,KAAK,IAAIG,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGjB,QAAQ,CAAC0C,WAAW,CAAC,CAAC,EAAEzB,CAAC,EAAE,EAAE;MAC/C,MAAM0B,IAAI,GAAG3C,QAAQ,CAACM,KAAK,CAACW,CAAC,CAAa;MAC1C,MAAM2B,QAAQ,GAAGD,IAAI,CAACpC,IAAI,CAAC,CAAiB;MAC5CO,UAAU,CAACK,IAAI,CAACmB,YAAY,CAACK,IAAI,EAAEC,QAAQ,CAAC,CAAC;IAC/C;IACA,OAAO;MACLrC,IAAI,EAAEZ,YAAY,CAACY,IAAI,CAAC;MACxBO;IACF,CAAC;EACH,CAAC,MAAM,IAAIP,IAAI,KAAKZ,YAAY,CAACkD,YAAY,EAAE;IAC7C,MAAM/B,UAA6B,GAAG,EAAE;IACxC,KAAK,IAAIG,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGjB,QAAQ,CAAC0C,WAAW,CAAC,CAAC,EAAEzB,CAAC,EAAE,EAC7CH,UAAU,CAACK,IAAI,CAACmB,YAAY,CAACtC,QAAQ,CAACM,KAAK,CAACW,CAAC,CAAC,EAActB,YAAY,CAAC0C,OAAO,CAAC,CAAC;IACpF,OAAO;MACL9B,IAAI,EAAEZ,YAAY,CAACY,IAAI,CAAC;MACxBL,WAAW,EAAEY,UAAU,CAACH,GAAG,CAAEO,CAAC,IAAMA,CAAC,CAAahB,WAAW;IAC/D,CAAC;EACH;EACA,MAAMA,WAAW,GAAG0B,oBAAoB,CAAC5B,QAAQ,EAAEO,IAAI,CAAC;EACxD,OAAO;IACLA,IAAI,EAAEZ,YAAY,CAACY,IAAI,CAAC;IACxBL;EACF,CAAC;AACH"}
|
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
import { FeatureCollection as GeoJsonFeatureCollection } from 'geojson';
|
|
2
|
-
import { Rect } from './packedrtree
|
|
3
|
-
import { IGeoJsonFeature } from './geojson/feature
|
|
4
|
-
import { HeaderMetaFn } from './generic
|
|
2
|
+
import { Rect } from './packedrtree';
|
|
3
|
+
import { IGeoJsonFeature } from './geojson/feature';
|
|
4
|
+
import { HeaderMetaFn } from './generic';
|
|
5
5
|
/**
|
|
6
6
|
* Serialize GeoJSON to FlatGeobuf
|
|
7
7
|
* @param geojson GeoJSON object to serialize
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"geojson.d.ts","sourceRoot":"","sources":["../../../src/flatgeobuf/3.27.2/geojson.ts"],"names":[],"mappings":"AAOA,OAAO,EAAC,iBAAiB,IAAI,wBAAwB,EAAC,MAAM,SAAS,CAAC;AAEtE,OAAO,EAAC,IAAI,EAAC,MAAM,
|
|
1
|
+
{"version":3,"file":"geojson.d.ts","sourceRoot":"","sources":["../../../src/flatgeobuf/3.27.2/geojson.ts"],"names":[],"mappings":"AAOA,OAAO,EAAC,iBAAiB,IAAI,wBAAwB,EAAC,MAAM,SAAS,CAAC;AAEtE,OAAO,EAAC,IAAI,EAAC,MAAM,eAAe,CAAC;AACnC,OAAO,EAAC,eAAe,EAAC,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAC,YAAY,EAAC,MAAM,WAAW,CAAC;AAEvC;;;GAGG;AACH,wBAAgB,SAAS,CAAC,OAAO,EAAE,wBAAwB,GAAG,UAAU,CAGvE;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,UAAU,GAAG,cAAc,GAAG,MAAM,EAC3C,IAAI,CAAC,EAAE,IAAI,EACX,YAAY,CAAC,EAAE,YAAY,GAC1B,wBAAwB,GAAG,cAAc,CAAC,eAAe,CAAC,CAI5D"}
|
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
import { deserialize as fcDeserialize, deserializeStream as fcDeserializeStream, deserializeFiltered as fcDeserializeFiltered, serialize as fcSerialize } from
|
|
1
|
+
import { deserialize as fcDeserialize, deserializeStream as fcDeserializeStream, deserializeFiltered as fcDeserializeFiltered, serialize as fcSerialize } from "./geojson/featurecollection.js";
|
|
2
2
|
export function serialize(geojson) {
|
|
3
3
|
const bytes = fcSerialize(geojson);
|
|
4
4
|
return bytes;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"geojson.js","names":["deserialize","fcDeserialize","deserializeStream","fcDeserializeStream","deserializeFiltered","fcDeserializeFiltered","serialize","fcSerialize","geojson","bytes","input","rect","headerMetaFn","Uint8Array","ReadableStream"],"sources":["../../../src/flatgeobuf/3.27.2/geojson.ts"],"sourcesContent":["import {\n deserialize as fcDeserialize,\n deserializeStream as fcDeserializeStream,\n deserializeFiltered as fcDeserializeFiltered,\n serialize as fcSerialize\n} from './geojson/featurecollection
|
|
1
|
+
{"version":3,"file":"geojson.js","names":["deserialize","fcDeserialize","deserializeStream","fcDeserializeStream","deserializeFiltered","fcDeserializeFiltered","serialize","fcSerialize","geojson","bytes","input","rect","headerMetaFn","Uint8Array","ReadableStream"],"sources":["../../../src/flatgeobuf/3.27.2/geojson.ts"],"sourcesContent":["import {\n deserialize as fcDeserialize,\n deserializeStream as fcDeserializeStream,\n deserializeFiltered as fcDeserializeFiltered,\n serialize as fcSerialize\n} from './geojson/featurecollection';\n\nimport {FeatureCollection as GeoJsonFeatureCollection} from 'geojson';\n\nimport {Rect} from './packedrtree';\nimport {IGeoJsonFeature} from './geojson/feature';\nimport {HeaderMetaFn} from './generic';\n\n/**\n * Serialize GeoJSON to FlatGeobuf\n * @param geojson GeoJSON object to serialize\n */\nexport function serialize(geojson: GeoJsonFeatureCollection): Uint8Array {\n const bytes = fcSerialize(geojson);\n return bytes;\n}\n\n/**\n * Deserialize FlatGeobuf into GeoJSON\n * @param input Input byte array, stream or string\n * @param rect Filter rectangle\n * @param headerMetaFn Callback that will recieve header metadata when available\n */\nexport function deserialize(\n input: Uint8Array | ReadableStream | string,\n rect?: Rect,\n headerMetaFn?: HeaderMetaFn\n): GeoJsonFeatureCollection | AsyncGenerator<IGeoJsonFeature> {\n if (input instanceof Uint8Array) return fcDeserialize(input, headerMetaFn);\n else if (input instanceof ReadableStream) return fcDeserializeStream(input, headerMetaFn);\n return fcDeserializeFiltered(input, rect as Rect, headerMetaFn);\n}\n"],"mappings":"SACEA,WAAW,IAAIC,aAAa,EAC5BC,iBAAiB,IAAIC,mBAAmB,EACxCC,mBAAmB,IAAIC,qBAAqB,EAC5CC,SAAS,IAAIC,WAAW;AAa1B,OAAO,SAASD,SAASA,CAACE,OAAiC,EAAc;EACvE,MAAMC,KAAK,GAAGF,WAAW,CAACC,OAAO,CAAC;EAClC,OAAOC,KAAK;AACd;AAQA,OAAO,SAAST,WAAWA,CACzBU,KAA2C,EAC3CC,IAAW,EACXC,YAA2B,EACiC;EAC5D,IAAIF,KAAK,YAAYG,UAAU,EAAE,OAAOZ,aAAa,CAACS,KAAK,EAAEE,YAAY,CAAC,CAAC,KACtE,IAAIF,KAAK,YAAYI,cAAc,EAAE,OAAOX,mBAAmB,CAACO,KAAK,EAAEE,YAAY,CAAC;EACzF,OAAOP,qBAAqB,CAACK,KAAK,EAAEC,IAAI,EAAUC,YAAY,CAAC;AACjE"}
|
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
import * as flatbuffers from 'flatbuffers';
|
|
2
|
-
import ColumnMeta from './column-meta
|
|
3
|
-
import CrsMeta from './crs-meta
|
|
4
|
-
import { GeometryType } from './flat-geobuf/geometry-type
|
|
2
|
+
import ColumnMeta from './column-meta';
|
|
3
|
+
import CrsMeta from './crs-meta';
|
|
4
|
+
import { GeometryType } from './flat-geobuf/geometry-type';
|
|
5
5
|
export default interface HeaderMeta {
|
|
6
6
|
geometryType: GeometryType;
|
|
7
7
|
columns: ColumnMeta[] | null;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"header-meta.d.ts","sourceRoot":"","sources":["../../../src/flatgeobuf/3.27.2/header-meta.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,WAAW,MAAM,aAAa,CAAC;AAE3C,OAAO,UAAU,MAAM,
|
|
1
|
+
{"version":3,"file":"header-meta.d.ts","sourceRoot":"","sources":["../../../src/flatgeobuf/3.27.2/header-meta.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,WAAW,MAAM,aAAa,CAAC;AAE3C,OAAO,UAAU,MAAM,eAAe,CAAC;AACvC,OAAO,OAAO,MAAM,YAAY,CAAC;AACjC,OAAO,EAAC,YAAY,EAAC,MAAM,6BAA6B,CAAC;AAGzD,MAAM,CAAC,OAAO,WAAW,UAAU;IACjC,YAAY,EAAE,YAAY,CAAC;IAC3B,OAAO,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC;IAC7B,QAAQ,EAAE,YAAY,GAAG,IAAI,CAAC;IAC9B,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;IACtB,GAAG,EAAE,OAAO,GAAG,IAAI,CAAC;IACpB,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;CACzB;AAED,wBAAgB,cAAc,CAAC,EAAE,EAAE,WAAW,CAAC,UAAU,GAAG,UAAU,CA8CrE"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"header-meta.js","names":["Header","fromByteBuffer","bb","header","getRootAsHeader","featuresCount","indexNodeSize","columns","j","columnsLength","column","Error","name","push","type","title","description","width","precision","scale","nullable","unique","primary_key","primaryKey","crs","crsMeta","org","code","wkt","code_string","codeString","headerMeta","geometryType","envelope","Number","metadata"],"sources":["../../../src/flatgeobuf/3.27.2/header-meta.ts"],"sourcesContent":["import * as flatbuffers from 'flatbuffers';\n\nimport ColumnMeta from './column-meta
|
|
1
|
+
{"version":3,"file":"header-meta.js","names":["Header","fromByteBuffer","bb","header","getRootAsHeader","featuresCount","indexNodeSize","columns","j","columnsLength","column","Error","name","push","type","title","description","width","precision","scale","nullable","unique","primary_key","primaryKey","crs","crsMeta","org","code","wkt","code_string","codeString","headerMeta","geometryType","envelope","Number","metadata"],"sources":["../../../src/flatgeobuf/3.27.2/header-meta.ts"],"sourcesContent":["import * as flatbuffers from 'flatbuffers';\n\nimport ColumnMeta from './column-meta';\nimport CrsMeta from './crs-meta';\nimport {GeometryType} from './flat-geobuf/geometry-type';\nimport {Header} from './flat-geobuf/header';\n\nexport default interface HeaderMeta {\n geometryType: GeometryType;\n columns: ColumnMeta[] | null;\n envelope: Float64Array | null;\n featuresCount: number;\n indexNodeSize: number;\n crs: CrsMeta | null;\n title: string | null;\n description: string | null;\n metadata: string | null;\n}\n\nexport function fromByteBuffer(bb: flatbuffers.ByteBuffer): HeaderMeta {\n const header = Header.getRootAsHeader(bb);\n const featuresCount = header.featuresCount();\n const indexNodeSize = header.indexNodeSize();\n\n const columns: ColumnMeta[] = [];\n for (let j = 0; j < header.columnsLength(); j++) {\n const column = header.columns(j);\n if (!column) throw new Error('Column unexpectedly missing');\n if (!column.name()) throw new Error('Column name unexpectedly missing');\n columns.push({\n name: column.name() as string,\n type: column.type(),\n title: column.title(),\n description: column.description(),\n width: column.width(),\n precision: column.precision(),\n scale: column.scale(),\n nullable: column.nullable(),\n unique: column.unique(),\n primary_key: column.primaryKey()\n });\n }\n const crs = header.crs();\n const crsMeta: CrsMeta | null = crs\n ? {\n org: crs.org(),\n code: crs.code(),\n name: crs.name(),\n description: crs.description(),\n wkt: crs.wkt(),\n code_string: crs.codeString()\n }\n : null;\n const headerMeta: HeaderMeta = {\n geometryType: header.geometryType(),\n columns,\n envelope: null,\n featuresCount: Number(featuresCount),\n indexNodeSize,\n crs: crsMeta,\n title: header.title(),\n description: header.description(),\n metadata: header.metadata()\n };\n return headerMeta;\n}\n"],"mappings":"SAKQA,MAAM;AAcd,OAAO,SAASC,cAAcA,CAACC,EAA0B,EAAc;EACrE,MAAMC,MAAM,GAAGH,MAAM,CAACI,eAAe,CAACF,EAAE,CAAC;EACzC,MAAMG,aAAa,GAAGF,MAAM,CAACE,aAAa,CAAC,CAAC;EAC5C,MAAMC,aAAa,GAAGH,MAAM,CAACG,aAAa,CAAC,CAAC;EAE5C,MAAMC,OAAqB,GAAG,EAAE;EAChC,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGL,MAAM,CAACM,aAAa,CAAC,CAAC,EAAED,CAAC,EAAE,EAAE;IAC/C,MAAME,MAAM,GAAGP,MAAM,CAACI,OAAO,CAACC,CAAC,CAAC;IAChC,IAAI,CAACE,MAAM,EAAE,MAAM,IAAIC,KAAK,CAAC,6BAA6B,CAAC;IAC3D,IAAI,CAACD,MAAM,CAACE,IAAI,CAAC,CAAC,EAAE,MAAM,IAAID,KAAK,CAAC,kCAAkC,CAAC;IACvEJ,OAAO,CAACM,IAAI,CAAC;MACXD,IAAI,EAAEF,MAAM,CAACE,IAAI,CAAC,CAAW;MAC7BE,IAAI,EAAEJ,MAAM,CAACI,IAAI,CAAC,CAAC;MACnBC,KAAK,EAAEL,MAAM,CAACK,KAAK,CAAC,CAAC;MACrBC,WAAW,EAAEN,MAAM,CAACM,WAAW,CAAC,CAAC;MACjCC,KAAK,EAAEP,MAAM,CAACO,KAAK,CAAC,CAAC;MACrBC,SAAS,EAAER,MAAM,CAACQ,SAAS,CAAC,CAAC;MAC7BC,KAAK,EAAET,MAAM,CAACS,KAAK,CAAC,CAAC;MACrBC,QAAQ,EAAEV,MAAM,CAACU,QAAQ,CAAC,CAAC;MAC3BC,MAAM,EAAEX,MAAM,CAACW,MAAM,CAAC,CAAC;MACvBC,WAAW,EAAEZ,MAAM,CAACa,UAAU,CAAC;IACjC,CAAC,CAAC;EACJ;EACA,MAAMC,GAAG,GAAGrB,MAAM,CAACqB,GAAG,CAAC,CAAC;EACxB,MAAMC,OAAuB,GAAGD,GAAG,GAC/B;IACEE,GAAG,EAAEF,GAAG,CAACE,GAAG,CAAC,CAAC;IACdC,IAAI,EAAEH,GAAG,CAACG,IAAI,CAAC,CAAC;IAChBf,IAAI,EAAEY,GAAG,CAACZ,IAAI,CAAC,CAAC;IAChBI,WAAW,EAAEQ,GAAG,CAACR,WAAW,CAAC,CAAC;IAC9BY,GAAG,EAAEJ,GAAG,CAACI,GAAG,CAAC,CAAC;IACdC,WAAW,EAAEL,GAAG,CAACM,UAAU,CAAC;EAC9B,CAAC,GACD,IAAI;EACR,MAAMC,UAAsB,GAAG;IAC7BC,YAAY,EAAE7B,MAAM,CAAC6B,YAAY,CAAC,CAAC;IACnCzB,OAAO;IACP0B,QAAQ,EAAE,IAAI;IACd5B,aAAa,EAAE6B,MAAM,CAAC7B,aAAa,CAAC;IACpCC,aAAa;IACbkB,GAAG,EAAEC,OAAO;IACZV,KAAK,EAAEZ,MAAM,CAACY,KAAK,CAAC,CAAC;IACrBC,WAAW,EAAEb,MAAM,CAACa,WAAW,CAAC,CAAC;IACjCmB,QAAQ,EAAEhC,MAAM,CAACgC,QAAQ,CAAC;EAC5B,CAAC;EACD,OAAOJ,UAAU;AACnB"}
|
|
@@ -1,2 +1,2 @@
|
|
|
1
|
-
export * as FlatGeobuf from './flat-geobuf
|
|
1
|
+
export * as FlatGeobuf from './flat-geobuf';
|
|
2
2
|
//# sourceMappingURL=header.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"header.d.ts","sourceRoot":"","sources":["../../../src/flatgeobuf/3.27.2/header.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,UAAU,MAAM,
|
|
1
|
+
{"version":3,"file":"header.d.ts","sourceRoot":"","sources":["../../../src/flatgeobuf/3.27.2/header.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,UAAU,MAAM,eAAe,CAAC"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"header.js","names":["
|
|
1
|
+
{"version":3,"file":"header.js","names":["FlatGeobuf"],"sources":["../../../src/flatgeobuf/3.27.2/header.ts"],"sourcesContent":["// automatically generated by the FlatBuffers compiler, do not modify\n\nexport * as FlatGeobuf from './flat-geobuf';\n"],"mappings":";wBAEYA,UAAU"}
|
|
@@ -1,6 +1,6 @@
|
|
|
1
|
-
import { Rect } from './packedrtree
|
|
2
|
-
import HeaderMeta from './header-meta
|
|
3
|
-
import { Feature } from './flat-geobuf/feature
|
|
1
|
+
import { Rect } from './packedrtree';
|
|
2
|
+
import HeaderMeta from './header-meta';
|
|
3
|
+
import { Feature } from './flat-geobuf/feature';
|
|
4
4
|
export declare class HttpReader {
|
|
5
5
|
private headerClient;
|
|
6
6
|
header: HeaderMeta;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"http-reader.d.ts","sourceRoot":"","sources":["../../../src/flatgeobuf/3.27.2/http-reader.ts"],"names":[],"mappings":"AAGA,OAAO,EACL,IAAI,EAKL,MAAM,
|
|
1
|
+
{"version":3,"file":"http-reader.d.ts","sourceRoot":"","sources":["../../../src/flatgeobuf/3.27.2/http-reader.ts"],"names":[],"mappings":"AAGA,OAAO,EACL,IAAI,EAKL,MAAM,eAAe,CAAC;AAIvB,OAAO,UAA4B,MAAM,eAAe,CAAC;AACzD,OAAO,EAAC,OAAO,EAAC,MAAM,uBAAuB,CAAC;AAE9C,qBAAa,UAAU;IACrB,OAAO,CAAC,YAAY,CAA0B;IACvC,MAAM,EAAE,UAAU,CAAC;IAC1B,OAAO,CAAC,YAAY,CAAS;IAC7B,OAAO,CAAC,WAAW,CAAS;gBAG1B,YAAY,EAAE,uBAAuB,EACrC,MAAM,EAAE,UAAU,EAClB,YAAY,EAAE,MAAM,EACpB,WAAW,EAAE,MAAM;WAWR,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC;IAkE5C,UAAU,CAAC,IAAI,EAAE,IAAI,GAAG,cAAc,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC;IAoErE,gBAAgB,IAAI,MAAM;IAK1B,oBAAoB,IAAI,MAAM;IAI9B,kBAAkB,IAAI,uBAAuB;IAI7C;;;;OAIG;IACI,gBAAgB,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,GAAG,cAAc,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC;IAyBpF,WAAW,CACf,aAAa,EAAE,uBAAuB,EACtC,aAAa,EAAE,MAAM,EACrB,mBAAmB,EAAE,MAAM,GAC1B,OAAO,CAAC,OAAO,CAAC;CAsBpB;AAED,cAAM,uBAAuB;IAC3B,UAAU,EAAE,eAAe,CAAC;IAC5B,aAAa,SAAK;IAClB,gBAAgB,SAAK;IAErB,OAAO,CAAC,MAAM,CAAmC;IAIjD,OAAO,CAAC,IAAI,CAAK;gBAEL,MAAM,EAAE,MAAM,GAAG,eAAe;IAUtC,QAAQ,CACZ,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,EACd,YAAY,EAAE,MAAM,EACpB,OAAO,EAAE,MAAM,GACd,OAAO,CAAC,WAAW,CAAC;IAmBvB,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;CAQhC;AAED,cAAM,eAAe;IACnB,GAAG,EAAE,MAAM,CAAC;IACZ,gBAAgB,SAAK;IACrB,kBAAkB,SAAK;gBAEX,GAAG,EAAE,MAAM;IAIjB,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC;CA4CrF"}
|
|
@@ -1,11 +1,11 @@
|
|
|
1
1
|
import * as flatbuffers from 'flatbuffers';
|
|
2
2
|
import { Repeater } from '@repeaterjs/repeater';
|
|
3
|
-
import { calcTreeSize, DEFAULT_NODE_SIZE, NODE_ITEM_BYTE_LEN, streamSearch } from
|
|
4
|
-
import { magicbytes, SIZE_PREFIX_LEN } from
|
|
5
|
-
import Config from
|
|
6
|
-
import Logger from
|
|
7
|
-
import { fromByteBuffer } from
|
|
8
|
-
import { Feature } from
|
|
3
|
+
import { calcTreeSize, DEFAULT_NODE_SIZE, NODE_ITEM_BYTE_LEN, streamSearch } from "./packedrtree.js";
|
|
4
|
+
import { magicbytes, SIZE_PREFIX_LEN } from "./constants.js";
|
|
5
|
+
import Config from "./config.js";
|
|
6
|
+
import Logger from "./logger.js";
|
|
7
|
+
import { fromByteBuffer } from "./header-meta.js";
|
|
8
|
+
import { Feature } from "./flat-geobuf/feature.js";
|
|
9
9
|
export class HttpReader {
|
|
10
10
|
constructor(headerClient, header, headerLength, indexLength) {
|
|
11
11
|
this.headerClient = void 0;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"http-reader.js","names":["flatbuffers","Repeater","calcTreeSize","DEFAULT_NODE_SIZE","NODE_ITEM_BYTE_LEN","streamSearch","magicbytes","SIZE_PREFIX_LEN","Config","Logger","fromByteBuffer","Feature","HttpReader","constructor","headerClient","header","headerLength","indexLength","open","url","assumedHeaderLength","BufferedHttpRangeClient","assumedIndexLength","assumedBranchingFactor","prefetchedLayers","result","i","layer_width","minReqLength","debug","bytes","Uint8Array","getRange","subarray","every","v","error","Error","DataView","getUint32","HEADER_MAX_BUFFER_SIZE","bb","ByteBuffer","featuresCount","indexNodeSize","selectBbox","rect","lengthBeforeTree","bufferedClient","readNode","offsetIntoTree","size","batches","currentBatch","searchResult","featureOffset","featureLength","info","length","push","prevFeature","gap","global","extraRequestThreshold","logUsage","promises","flatMap","batch","readFeatureBatch","merge","lengthBeforeFeatures","buildFeatureClient","httpClient","firstFeatureOffset","lastFeatureOffset","lastFeatureLength","batchStart","batchEnd","batchSize","featureClient","minFeatureReqLength","readFeature","offset","byteBuffer","bytesAligned","set","setPosition","getRootAsFeature","source","bytesEverUsed","bytesEverFetched","buffer","ArrayBuffer","head","HttpRangeClient","start","purpose","start_i","end_i","byteLength","slice","lengthToFetch","Math","max","category","split","used","requested","efficiency","toFixed","requestsEverMade","bytesEverRequested","begin","range","response","fetch","headers","Range","arrayBuffer"],"sources":["../../../src/flatgeobuf/3.27.2/http-reader.ts"],"sourcesContent":["import * as flatbuffers from 'flatbuffers';\nimport {Repeater} from '@repeaterjs/repeater';\n\nimport {\n Rect,\n calcTreeSize,\n DEFAULT_NODE_SIZE,\n NODE_ITEM_BYTE_LEN,\n streamSearch\n} from './packedrtree.js';\nimport {magicbytes, SIZE_PREFIX_LEN} from './constants.js';\nimport Config from './config.js';\nimport Logger from './logger.js';\nimport HeaderMeta, {fromByteBuffer} from './header-meta.js';\nimport {Feature} from './flat-geobuf/feature.js';\n\nexport class HttpReader {\n private headerClient: BufferedHttpRangeClient;\n public header: HeaderMeta;\n private headerLength: number;\n private indexLength: number;\n\n constructor(\n headerClient: BufferedHttpRangeClient,\n header: HeaderMeta,\n headerLength: number,\n indexLength: number\n ) {\n this.headerClient = headerClient;\n this.header = header;\n this.headerLength = headerLength;\n this.indexLength = indexLength;\n }\n\n // Fetch the header, preparing the reader to read Feature data.\n //\n // and potentially some opportunistic fetching of the index.\n static async open(url: string): Promise<HttpReader> {\n // In reality, the header is probably less than half this size, but\n // better to overshoot and fetch an extra kb rather than have to issue\n // a second request.\n const assumedHeaderLength = 2024;\n\n const headerClient = new BufferedHttpRangeClient(url);\n\n // Immediately following the header is the optional spatial index, we deliberately fetch\n // a small part of that to skip subsequent requests.\n const assumedIndexLength = (() => {\n // The actual branching factor will be in the header, but since we\n // don't have the header yet, we just guess. The consequence of\n // getting this wrong isn't terminal, it only means we may be\n // fetching slightly more than we need or that we need to make an\n // extra request later.\n const assumedBranchingFactor = DEFAULT_NODE_SIZE;\n\n // NOTE: each layer is exponentially larger\n const prefetchedLayers = 3;\n\n let result = 0;\n let i: number;\n for (i = 0; i < prefetchedLayers; i++) {\n const layer_width = assumedBranchingFactor ** i * NODE_ITEM_BYTE_LEN;\n result += layer_width;\n }\n return result;\n })();\n\n const minReqLength = assumedHeaderLength + assumedIndexLength;\n Logger.debug(\n `fetching header. minReqLength: ${minReqLength} (assumedHeaderLength: ${assumedHeaderLength}, assumedIndexLength: ${assumedIndexLength})`\n );\n\n {\n const bytes = new Uint8Array(await headerClient.getRange(0, 8, minReqLength, 'header'));\n if (!bytes.subarray(0, 3).every((v, i) => magicbytes[i] === v)) {\n Logger.error(`bytes: ${bytes} != ${magicbytes}`);\n throw new Error('Not a FlatGeobuf file');\n }\n Logger.debug('magic bytes look good');\n }\n\n let headerLength: number;\n {\n const bytes = await headerClient.getRange(8, 4, minReqLength, 'header');\n headerLength = new DataView(bytes).getUint32(0, true);\n const HEADER_MAX_BUFFER_SIZE = 1048576 * 10;\n if (headerLength > HEADER_MAX_BUFFER_SIZE || headerLength < 8) {\n // minimum size check avoids panic in FlatBuffers header decoding\n throw new Error('Invalid header size');\n }\n Logger.debug(`headerLength: ${headerLength}`);\n }\n\n const bytes = await headerClient.getRange(12, headerLength, minReqLength, 'header');\n const bb = new flatbuffers.ByteBuffer(new Uint8Array(bytes));\n const header = fromByteBuffer(bb);\n\n const indexLength = calcTreeSize(header.featuresCount, header.indexNodeSize);\n\n Logger.debug('completed: opening http reader');\n return new HttpReader(headerClient, header, headerLength, indexLength);\n }\n\n async *selectBbox(rect: Rect): AsyncGenerator<Feature, void, unknown> {\n // Read R-Tree index and build filter for features within bbox\n const lengthBeforeTree = this.lengthBeforeTree();\n\n const bufferedClient = this.headerClient;\n const readNode = async function (offsetIntoTree: number, size: number): Promise<ArrayBuffer> {\n const minReqLength = 0;\n return bufferedClient.getRange(\n lengthBeforeTree + offsetIntoTree,\n size,\n minReqLength,\n 'index'\n );\n };\n\n const batches: [number, number][][] = [];\n let currentBatch: [number, number][] = [];\n for await (const searchResult of streamSearch(\n this.header.featuresCount,\n this.header.indexNodeSize,\n rect,\n readNode\n )) {\n const [featureOffset, ,] = searchResult;\n let [, , featureLength] = searchResult;\n if (!featureLength) {\n Logger.info('final feature');\n // Normally we get the feature length by subtracting between\n // adjacent nodes from the index, which we can't do for the\n // _very_ last feature in a dataset.\n //\n // We could *guess* the size, but we'd risk overshooting the length,\n // which will cause some webservers to return HTTP 416: Unsatisfiable range\n //\n // So instead we fetch only the final features byte length, stored in the\n // first 4 bytes.\n featureLength = 4;\n }\n\n if (currentBatch.length == 0) {\n currentBatch.push([featureOffset, featureLength]);\n continue;\n }\n\n const prevFeature = currentBatch[currentBatch.length - 1];\n const gap = featureOffset - (prevFeature[0] + prevFeature[1]);\n if (gap > Config.global.extraRequestThreshold()) {\n Logger.info(`Pushing new feature batch, since gap ${gap} was too large`);\n batches.push(currentBatch);\n currentBatch = [];\n }\n\n currentBatch.push([featureOffset, featureLength]);\n }\n this.headerClient.logUsage('header+index');\n if (currentBatch.length > 0) {\n batches.push(currentBatch);\n }\n\n const promises: AsyncGenerator<Feature, any, any>[] = batches.flatMap(\n (batch: [number, number][]) => this.readFeatureBatch(batch)\n );\n\n // Fetch all batches concurrently, yielding features as they become\n // available, meaning the results may be intermixed.\n yield* Repeater.merge(promises);\n }\n\n lengthBeforeTree(): number {\n // FGB Layout is: [magicbytes (fixed), headerLength (i32), header (variable), Tree (variable), Features (variable)]\n return magicbytes.length + SIZE_PREFIX_LEN + this.headerLength;\n }\n\n lengthBeforeFeatures(): number {\n return this.lengthBeforeTree() + this.indexLength;\n }\n\n buildFeatureClient(): BufferedHttpRangeClient {\n return new BufferedHttpRangeClient(this.headerClient.httpClient);\n }\n\n /**\n * Fetch a batch of features in a single request, yielding each Feature\n *\n * `batch`: [offset, length] of features in the batch\n */\n async *readFeatureBatch(batch: [number, number][]): AsyncGenerator<Feature, void, unknown> {\n const [firstFeatureOffset] = batch[0];\n const [lastFeatureOffset, lastFeatureLength] = batch[batch.length - 1];\n\n const batchStart = firstFeatureOffset;\n const batchEnd = lastFeatureOffset + lastFeatureLength;\n const batchSize = batchEnd - batchStart;\n\n // A new feature client is needed for each batch to own the underlying buffer as features are yielded.\n const featureClient = this.buildFeatureClient();\n\n let minFeatureReqLength = batchSize;\n for (const [featureOffset] of batch) {\n yield await this.readFeature(featureClient, featureOffset, minFeatureReqLength);\n // Only set minFeatureReqLength for the first request.\n //\n // This should only affect a batch that contains the final feature, otherwise\n // we've calculated `batchSize` to get all the data we need for the batch.\n // For the very final feature in a dataset, we don't know it's length, so we\n // will end up executing an extra request for that batch.\n minFeatureReqLength = 0;\n }\n featureClient.logUsage('feature');\n }\n\n async readFeature(\n featureClient: BufferedHttpRangeClient,\n featureOffset: number,\n minFeatureReqLength: number\n ): Promise<Feature> {\n const offset = featureOffset + this.lengthBeforeFeatures();\n\n let featureLength: number;\n {\n const bytes = await featureClient.getRange(offset, 4, minFeatureReqLength, 'feature length');\n featureLength = new DataView(bytes).getUint32(0, true);\n }\n\n const byteBuffer = await featureClient.getRange(\n offset + 4,\n featureLength,\n minFeatureReqLength,\n 'feature data'\n );\n const bytes = new Uint8Array(byteBuffer);\n const bytesAligned = new Uint8Array(featureLength + SIZE_PREFIX_LEN);\n bytesAligned.set(bytes, SIZE_PREFIX_LEN);\n const bb = new flatbuffers.ByteBuffer(bytesAligned);\n bb.setPosition(SIZE_PREFIX_LEN);\n return Feature.getRootAsFeature(bb);\n }\n}\n\nclass BufferedHttpRangeClient {\n httpClient: HttpRangeClient;\n bytesEverUsed = 0;\n bytesEverFetched = 0;\n\n private buffer: ArrayBuffer = new ArrayBuffer(0);\n\n // Byte offset of `buffer` with respect to the beginning of the file being\n // buffered\n private head = 0;\n\n constructor(source: string | HttpRangeClient) {\n if (typeof source === 'string') {\n this.httpClient = new HttpRangeClient(source);\n } else if (source instanceof HttpRangeClient) {\n this.httpClient = source;\n } else {\n throw new Error('Unknown source ');\n }\n }\n\n async getRange(\n start: number,\n length: number,\n minReqLength: number,\n purpose: string\n ): Promise<ArrayBuffer> {\n this.bytesEverUsed += length;\n\n const start_i = start - this.head;\n const end_i = start_i + length;\n if (start_i >= 0 && end_i <= this.buffer.byteLength) {\n return this.buffer.slice(start_i, end_i);\n }\n\n const lengthToFetch = Math.max(length, minReqLength);\n\n this.bytesEverFetched += lengthToFetch;\n Logger.debug(`requesting for new Range: ${start}-${start + lengthToFetch - 1}`);\n this.buffer = await this.httpClient.getRange(start, lengthToFetch, purpose);\n this.head = start;\n\n return this.buffer.slice(0, length);\n }\n\n logUsage(purpose: string): void {\n const category = purpose.split(' ')[0];\n const used = this.bytesEverUsed;\n const requested = this.bytesEverFetched;\n const efficiency = ((100.0 * used) / requested).toFixed(2);\n\n Logger.info(`${category} bytes used/requested: ${used} / ${requested} = ${efficiency}%`);\n }\n}\n\nclass HttpRangeClient {\n url: string;\n requestsEverMade = 0;\n bytesEverRequested = 0;\n\n constructor(url: string) {\n this.url = url;\n }\n\n async getRange(begin: number, length: number, purpose: string): Promise<ArrayBuffer> {\n this.requestsEverMade += 1;\n this.bytesEverRequested += length;\n\n const range = `bytes=${begin}-${begin + length - 1}`;\n Logger.info(\n `request: #${this.requestsEverMade}, purpose: ${purpose}), bytes: (this_request: ${length}, ever: ${this.bytesEverRequested}), Range: ${range}`\n );\n\n const response = await fetch(this.url, {\n headers: {\n Range: range\n // TODO: better parallelize requests on Chrome\n //\n // Safari and Firefox have no issue performing Range requests\n // for a resource in parallel, but Chrome will stall a\n // subsequent request to the resource until it's received the\n // response headers of the prior request. So, it still allows\n // some limited parallelization, but it's not ideal.\n //\n // This is seemingly an artifact of how Chrome manages caching\n // and it might differ between platforms. We could work around it\n // by setting the request header:\n //\n // 'Cache-Control': 'no-cache, no-store'\n //\n // This allows requests to be fully parallelized in Chrome, but\n // then Chrome won't cache the response, so it seems not a\n // great trade-off.\n //\n // Another work around would be to make each Range request for\n // a separate URL by appending something like\n // `?cache_buster=<range>` to the URL, but then Chrome will\n // require an additional CORS preflight OPTIONS requests per\n // Range, which is also not a great trade-off.\n //\n // See:\n // https://bugs.chromium.org/p/chromium/issues/detail?id=969828&q=concurrent%20range%20requests&can=2\n // https://stackoverflow.com/questions/27513994/chrome-stalls-when-making-multiple-requests-to-same-resource\n }\n });\n\n return response.arrayBuffer();\n }\n}\n"],"mappings":"AAAA,OAAO,KAAKA,WAAW,MAAM,aAAa;AAC1C,SAAQC,QAAQ,QAAO,sBAAsB;AAE7C,SAEEC,YAAY,EACZC,iBAAiB,EACjBC,kBAAkB,EAClBC,YAAY,QACP,kBAAkB;AACzB,SAAQC,UAAU,EAAEC,eAAe,QAAO,gBAAgB;AAC1D,OAAOC,MAAM,MAAM,aAAa;AAChC,OAAOC,MAAM,MAAM,aAAa;AAChC,SAAoBC,cAAc,QAAO,kBAAkB;AAC3D,SAAQC,OAAO,QAAO,0BAA0B;AAEhD,OAAO,MAAMC,UAAU,CAAC;EAMtBC,WAAWA,CACTC,YAAqC,EACrCC,MAAkB,EAClBC,YAAoB,EACpBC,WAAmB,EACnB;IAAA,KAVMH,YAAY;IAAA,KACbC,MAAM;IAAA,KACLC,YAAY;IAAA,KACZC,WAAW;IAQjB,IAAI,CAACH,YAAY,GAAGA,YAAY;IAChC,IAAI,CAACC,MAAM,GAAGA,MAAM;IACpB,IAAI,CAACC,YAAY,GAAGA,YAAY;IAChC,IAAI,CAACC,WAAW,GAAGA,WAAW;EAChC;EAKA,aAAaC,IAAIA,CAACC,GAAW,EAAuB;IAIlD,MAAMC,mBAAmB,GAAG,IAAI;IAEhC,MAAMN,YAAY,GAAG,IAAIO,uBAAuB,CAACF,GAAG,CAAC;IAIrD,MAAMG,kBAAkB,GAAG,CAAC,MAAM;MAMhC,MAAMC,sBAAsB,GAAGpB,iBAAiB;MAGhD,MAAMqB,gBAAgB,GAAG,CAAC;MAE1B,IAAIC,MAAM,GAAG,CAAC;MACd,IAAIC,CAAS;MACb,KAAKA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGF,gBAAgB,EAAEE,CAAC,EAAE,EAAE;QACrC,MAAMC,WAAW,GAAGJ,sBAAsB,IAAIG,CAAC,GAAGtB,kBAAkB;QACpEqB,MAAM,IAAIE,WAAW;MACvB;MACA,OAAOF,MAAM;IACf,CAAC,EAAE,CAAC;IAEJ,MAAMG,YAAY,GAAGR,mBAAmB,GAAGE,kBAAkB;IAC7Db,MAAM,CAACoB,KAAK,CACT,kCAAiCD,YAAa,0BAAyBR,mBAAoB,yBAAwBE,kBAAmB,GACzI,CAAC;IAED;MACE,MAAMQ,KAAK,GAAG,IAAIC,UAAU,CAAC,MAAMjB,YAAY,CAACkB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAEJ,YAAY,EAAE,QAAQ,CAAC,CAAC;MACvF,IAAI,CAACE,KAAK,CAACG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAACC,KAAK,CAAC,CAACC,CAAC,EAAET,CAAC,KAAKpB,UAAU,CAACoB,CAAC,CAAC,KAAKS,CAAC,CAAC,EAAE;QAC9D1B,MAAM,CAAC2B,KAAK,CAAE,UAASN,KAAM,OAAMxB,UAAW,EAAC,CAAC;QAChD,MAAM,IAAI+B,KAAK,CAAC,uBAAuB,CAAC;MAC1C;MACA5B,MAAM,CAACoB,KAAK,CAAC,uBAAuB,CAAC;IACvC;IAEA,IAAIb,YAAoB;IACxB;MACE,MAAMc,KAAK,GAAG,MAAMhB,YAAY,CAACkB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAEJ,YAAY,EAAE,QAAQ,CAAC;MACvEZ,YAAY,GAAG,IAAIsB,QAAQ,CAACR,KAAK,CAAC,CAACS,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC;MACrD,MAAMC,sBAAsB,GAAG,OAAO,GAAG,EAAE;MAC3C,IAAIxB,YAAY,GAAGwB,sBAAsB,IAAIxB,YAAY,GAAG,CAAC,EAAE;QAE7D,MAAM,IAAIqB,KAAK,CAAC,qBAAqB,CAAC;MACxC;MACA5B,MAAM,CAACoB,KAAK,CAAE,iBAAgBb,YAAa,EAAC,CAAC;IAC/C;IAEA,MAAMc,KAAK,GAAG,MAAMhB,YAAY,CAACkB,QAAQ,CAAC,EAAE,EAAEhB,YAAY,EAAEY,YAAY,EAAE,QAAQ,CAAC;IACnF,MAAMa,EAAE,GAAG,IAAIzC,WAAW,CAAC0C,UAAU,CAAC,IAAIX,UAAU,CAACD,KAAK,CAAC,CAAC;IAC5D,MAAMf,MAAM,GAAGL,cAAc,CAAC+B,EAAE,CAAC;IAEjC,MAAMxB,WAAW,GAAGf,YAAY,CAACa,MAAM,CAAC4B,aAAa,EAAE5B,MAAM,CAAC6B,aAAa,CAAC;IAE5EnC,MAAM,CAACoB,KAAK,CAAC,gCAAgC,CAAC;IAC9C,OAAO,IAAIjB,UAAU,CAACE,YAAY,EAAEC,MAAM,EAAEC,YAAY,EAAEC,WAAW,CAAC;EACxE;EAEA,OAAO4B,UAAUA,CAACC,IAAU,EAA0C;IAEpE,MAAMC,gBAAgB,GAAG,IAAI,CAACA,gBAAgB,CAAC,CAAC;IAEhD,MAAMC,cAAc,GAAG,IAAI,CAAClC,YAAY;IACxC,MAAMmC,QAAQ,GAAG,eAAAA,CAAgBC,cAAsB,EAAEC,IAAY,EAAwB;MAC3F,MAAMvB,YAAY,GAAG,CAAC;MACtB,OAAOoB,cAAc,CAAChB,QAAQ,CAC5Be,gBAAgB,GAAGG,cAAc,EACjCC,IAAI,EACJvB,YAAY,EACZ,OACF,CAAC;IACH,CAAC;IAED,MAAMwB,OAA6B,GAAG,EAAE;IACxC,IAAIC,YAAgC,GAAG,EAAE;IACzC,WAAW,MAAMC,YAAY,IAAIjD,YAAY,CAC3C,IAAI,CAACU,MAAM,CAAC4B,aAAa,EACzB,IAAI,CAAC5B,MAAM,CAAC6B,aAAa,EACzBE,IAAI,EACJG,QACF,CAAC,EAAE;MACD,MAAM,CAACM,aAAa,GAAI,GAAGD,YAAY;MACvC,IAAI,IAAKE,aAAa,CAAC,GAAGF,YAAY;MACtC,IAAI,CAACE,aAAa,EAAE;QAClB/C,MAAM,CAACgD,IAAI,CAAC,eAAe,CAAC;QAU5BD,aAAa,GAAG,CAAC;MACnB;MAEA,IAAIH,YAAY,CAACK,MAAM,IAAI,CAAC,EAAE;QAC5BL,YAAY,CAACM,IAAI,CAAC,CAACJ,aAAa,EAAEC,aAAa,CAAC,CAAC;QACjD;MACF;MAEA,MAAMI,WAAW,GAAGP,YAAY,CAACA,YAAY,CAACK,MAAM,GAAG,CAAC,CAAC;MACzD,MAAMG,GAAG,GAAGN,aAAa,IAAIK,WAAW,CAAC,CAAC,CAAC,GAAGA,WAAW,CAAC,CAAC,CAAC,CAAC;MAC7D,IAAIC,GAAG,GAAGrD,MAAM,CAACsD,MAAM,CAACC,qBAAqB,CAAC,CAAC,EAAE;QAC/CtD,MAAM,CAACgD,IAAI,CAAE,wCAAuCI,GAAI,gBAAe,CAAC;QACxET,OAAO,CAACO,IAAI,CAACN,YAAY,CAAC;QAC1BA,YAAY,GAAG,EAAE;MACnB;MAEAA,YAAY,CAACM,IAAI,CAAC,CAACJ,aAAa,EAAEC,aAAa,CAAC,CAAC;IACnD;IACA,IAAI,CAAC1C,YAAY,CAACkD,QAAQ,CAAC,cAAc,CAAC;IAC1C,IAAIX,YAAY,CAACK,MAAM,GAAG,CAAC,EAAE;MAC3BN,OAAO,CAACO,IAAI,CAACN,YAAY,CAAC;IAC5B;IAEA,MAAMY,QAA6C,GAAGb,OAAO,CAACc,OAAO,CAClEC,KAAyB,IAAK,IAAI,CAACC,gBAAgB,CAACD,KAAK,CAC5D,CAAC;IAID,OAAOlE,QAAQ,CAACoE,KAAK,CAACJ,QAAQ,CAAC;EACjC;EAEAlB,gBAAgBA,CAAA,EAAW;IAEzB,OAAOzC,UAAU,CAACoD,MAAM,GAAGnD,eAAe,GAAG,IAAI,CAACS,YAAY;EAChE;EAEAsD,oBAAoBA,CAAA,EAAW;IAC7B,OAAO,IAAI,CAACvB,gBAAgB,CAAC,CAAC,GAAG,IAAI,CAAC9B,WAAW;EACnD;EAEAsD,kBAAkBA,CAAA,EAA4B;IAC5C,OAAO,IAAIlD,uBAAuB,CAAC,IAAI,CAACP,YAAY,CAAC0D,UAAU,CAAC;EAClE;EAOA,OAAOJ,gBAAgBA,CAACD,KAAyB,EAA0C;IACzF,MAAM,CAACM,kBAAkB,CAAC,GAAGN,KAAK,CAAC,CAAC,CAAC;IACrC,MAAM,CAACO,iBAAiB,EAAEC,iBAAiB,CAAC,GAAGR,KAAK,CAACA,KAAK,CAACT,MAAM,GAAG,CAAC,CAAC;IAEtE,MAAMkB,UAAU,GAAGH,kBAAkB;IACrC,MAAMI,QAAQ,GAAGH,iBAAiB,GAAGC,iBAAiB;IACtD,MAAMG,SAAS,GAAGD,QAAQ,GAAGD,UAAU;IAGvC,MAAMG,aAAa,GAAG,IAAI,CAACR,kBAAkB,CAAC,CAAC;IAE/C,IAAIS,mBAAmB,GAAGF,SAAS;IACnC,KAAK,MAAM,CAACvB,aAAa,CAAC,IAAIY,KAAK,EAAE;MACnC,MAAM,MAAM,IAAI,CAACc,WAAW,CAACF,aAAa,EAAExB,aAAa,EAAEyB,mBAAmB,CAAC;MAO/EA,mBAAmB,GAAG,CAAC;IACzB;IACAD,aAAa,CAACf,QAAQ,CAAC,SAAS,CAAC;EACnC;EAEA,MAAMiB,WAAWA,CACfF,aAAsC,EACtCxB,aAAqB,EACrByB,mBAA2B,EACT;IAClB,MAAME,MAAM,GAAG3B,aAAa,GAAG,IAAI,CAACe,oBAAoB,CAAC,CAAC;IAE1D,IAAId,aAAqB;IACzB;MACE,MAAM1B,KAAK,GAAG,MAAMiD,aAAa,CAAC/C,QAAQ,CAACkD,MAAM,EAAE,CAAC,EAAEF,mBAAmB,EAAE,gBAAgB,CAAC;MAC5FxB,aAAa,GAAG,IAAIlB,QAAQ,CAACR,KAAK,CAAC,CAACS,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC;IACxD;IAEA,MAAM4C,UAAU,GAAG,MAAMJ,aAAa,CAAC/C,QAAQ,CAC7CkD,MAAM,GAAG,CAAC,EACV1B,aAAa,EACbwB,mBAAmB,EACnB,cACF,CAAC;IACD,MAAMlD,KAAK,GAAG,IAAIC,UAAU,CAACoD,UAAU,CAAC;IACxC,MAAMC,YAAY,GAAG,IAAIrD,UAAU,CAACyB,aAAa,GAAGjD,eAAe,CAAC;IACpE6E,YAAY,CAACC,GAAG,CAACvD,KAAK,EAAEvB,eAAe,CAAC;IACxC,MAAMkC,EAAE,GAAG,IAAIzC,WAAW,CAAC0C,UAAU,CAAC0C,YAAY,CAAC;IACnD3C,EAAE,CAAC6C,WAAW,CAAC/E,eAAe,CAAC;IAC/B,OAAOI,OAAO,CAAC4E,gBAAgB,CAAC9C,EAAE,CAAC;EACrC;AACF;AAEA,MAAMpB,uBAAuB,CAAC;EAW5BR,WAAWA,CAAC2E,MAAgC,EAAE;IAAA,KAV9ChB,UAAU;IAAA,KACViB,aAAa,GAAG,CAAC;IAAA,KACjBC,gBAAgB,GAAG,CAAC;IAAA,KAEZC,MAAM,GAAgB,IAAIC,WAAW,CAAC,CAAC,CAAC;IAAA,KAIxCC,IAAI,GAAG,CAAC;IAGd,IAAI,OAAOL,MAAM,KAAK,QAAQ,EAAE;MAC9B,IAAI,CAAChB,UAAU,GAAG,IAAIsB,eAAe,CAACN,MAAM,CAAC;IAC/C,CAAC,MAAM,IAAIA,MAAM,YAAYM,eAAe,EAAE;MAC5C,IAAI,CAACtB,UAAU,GAAGgB,MAAM;IAC1B,CAAC,MAAM;MACL,MAAM,IAAInD,KAAK,CAAC,iBAAiB,CAAC;IACpC;EACF;EAEA,MAAML,QAAQA,CACZ+D,KAAa,EACbrC,MAAc,EACd9B,YAAoB,EACpBoE,OAAe,EACO;IACtB,IAAI,CAACP,aAAa,IAAI/B,MAAM;IAE5B,MAAMuC,OAAO,GAAGF,KAAK,GAAG,IAAI,CAACF,IAAI;IACjC,MAAMK,KAAK,GAAGD,OAAO,GAAGvC,MAAM;IAC9B,IAAIuC,OAAO,IAAI,CAAC,IAAIC,KAAK,IAAI,IAAI,CAACP,MAAM,CAACQ,UAAU,EAAE;MACnD,OAAO,IAAI,CAACR,MAAM,CAACS,KAAK,CAACH,OAAO,EAAEC,KAAK,CAAC;IAC1C;IAEA,MAAMG,aAAa,GAAGC,IAAI,CAACC,GAAG,CAAC7C,MAAM,EAAE9B,YAAY,CAAC;IAEpD,IAAI,CAAC8D,gBAAgB,IAAIW,aAAa;IACtC5F,MAAM,CAACoB,KAAK,CAAE,6BAA4BkE,KAAM,IAAGA,KAAK,GAAGM,aAAa,GAAG,CAAE,EAAC,CAAC;IAC/E,IAAI,CAACV,MAAM,GAAG,MAAM,IAAI,CAACnB,UAAU,CAACxC,QAAQ,CAAC+D,KAAK,EAAEM,aAAa,EAAEL,OAAO,CAAC;IAC3E,IAAI,CAACH,IAAI,GAAGE,KAAK;IAEjB,OAAO,IAAI,CAACJ,MAAM,CAACS,KAAK,CAAC,CAAC,EAAE1C,MAAM,CAAC;EACrC;EAEAM,QAAQA,CAACgC,OAAe,EAAQ;IAC9B,MAAMQ,QAAQ,GAAGR,OAAO,CAACS,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtC,MAAMC,IAAI,GAAG,IAAI,CAACjB,aAAa;IAC/B,MAAMkB,SAAS,GAAG,IAAI,CAACjB,gBAAgB;IACvC,MAAMkB,UAAU,GAAG,CAAE,KAAK,GAAGF,IAAI,GAAIC,SAAS,EAAEE,OAAO,CAAC,CAAC,CAAC;IAE1DpG,MAAM,CAACgD,IAAI,CAAE,GAAE+C,QAAS,0BAAyBE,IAAK,MAAKC,SAAU,MAAKC,UAAW,GAAE,CAAC;EAC1F;AACF;AAEA,MAAMd,eAAe,CAAC;EAKpBjF,WAAWA,CAACM,GAAW,EAAE;IAAA,KAJzBA,GAAG;IAAA,KACH2F,gBAAgB,GAAG,CAAC;IAAA,KACpBC,kBAAkB,GAAG,CAAC;IAGpB,IAAI,CAAC5F,GAAG,GAAGA,GAAG;EAChB;EAEA,MAAMa,QAAQA,CAACgF,KAAa,EAAEtD,MAAc,EAAEsC,OAAe,EAAwB;IACnF,IAAI,CAACc,gBAAgB,IAAI,CAAC;IAC1B,IAAI,CAACC,kBAAkB,IAAIrD,MAAM;IAEjC,MAAMuD,KAAK,GAAI,SAAQD,KAAM,IAAGA,KAAK,GAAGtD,MAAM,GAAG,CAAE,EAAC;IACpDjD,MAAM,CAACgD,IAAI,CACR,aAAY,IAAI,CAACqD,gBAAiB,cAAad,OAAQ,4BAA2BtC,MAAO,WAAU,IAAI,CAACqD,kBAAmB,aAAYE,KAAM,EAChJ,CAAC;IAED,MAAMC,QAAQ,GAAG,MAAMC,KAAK,CAAC,IAAI,CAAChG,GAAG,EAAE;MACrCiG,OAAO,EAAE;QACPC,KAAK,EAAEJ;MA4BT;IACF,CAAC,CAAC;IAEF,OAAOC,QAAQ,CAACI,WAAW,CAAC,CAAC;EAC/B;AACF"}
|
|
1
|
+
{"version":3,"file":"http-reader.js","names":["flatbuffers","Repeater","calcTreeSize","DEFAULT_NODE_SIZE","NODE_ITEM_BYTE_LEN","streamSearch","magicbytes","SIZE_PREFIX_LEN","Config","Logger","fromByteBuffer","Feature","HttpReader","constructor","headerClient","header","headerLength","indexLength","open","url","assumedHeaderLength","BufferedHttpRangeClient","assumedIndexLength","assumedBranchingFactor","prefetchedLayers","result","i","layer_width","minReqLength","debug","bytes","Uint8Array","getRange","subarray","every","v","error","Error","DataView","getUint32","HEADER_MAX_BUFFER_SIZE","bb","ByteBuffer","featuresCount","indexNodeSize","selectBbox","rect","lengthBeforeTree","bufferedClient","readNode","offsetIntoTree","size","batches","currentBatch","searchResult","featureOffset","featureLength","info","length","push","prevFeature","gap","global","extraRequestThreshold","logUsage","promises","flatMap","batch","readFeatureBatch","merge","lengthBeforeFeatures","buildFeatureClient","httpClient","firstFeatureOffset","lastFeatureOffset","lastFeatureLength","batchStart","batchEnd","batchSize","featureClient","minFeatureReqLength","readFeature","offset","byteBuffer","bytesAligned","set","setPosition","getRootAsFeature","source","bytesEverUsed","bytesEverFetched","buffer","ArrayBuffer","head","HttpRangeClient","start","purpose","start_i","end_i","byteLength","slice","lengthToFetch","Math","max","category","split","used","requested","efficiency","toFixed","requestsEverMade","bytesEverRequested","begin","range","response","fetch","headers","Range","arrayBuffer"],"sources":["../../../src/flatgeobuf/3.27.2/http-reader.ts"],"sourcesContent":["import * as flatbuffers from 'flatbuffers';\nimport {Repeater} from '@repeaterjs/repeater';\n\nimport {\n Rect,\n calcTreeSize,\n DEFAULT_NODE_SIZE,\n NODE_ITEM_BYTE_LEN,\n streamSearch\n} from './packedrtree';\nimport {magicbytes, SIZE_PREFIX_LEN} from './constants';\nimport Config from './config';\nimport Logger from './logger';\nimport HeaderMeta, {fromByteBuffer} from './header-meta';\nimport {Feature} from './flat-geobuf/feature';\n\nexport class HttpReader {\n private headerClient: BufferedHttpRangeClient;\n public header: HeaderMeta;\n private headerLength: number;\n private indexLength: number;\n\n constructor(\n headerClient: BufferedHttpRangeClient,\n header: HeaderMeta,\n headerLength: number,\n indexLength: number\n ) {\n this.headerClient = headerClient;\n this.header = header;\n this.headerLength = headerLength;\n this.indexLength = indexLength;\n }\n\n // Fetch the header, preparing the reader to read Feature data.\n //\n // and potentially some opportunistic fetching of the index.\n static async open(url: string): Promise<HttpReader> {\n // In reality, the header is probably less than half this size, but\n // better to overshoot and fetch an extra kb rather than have to issue\n // a second request.\n const assumedHeaderLength = 2024;\n\n const headerClient = new BufferedHttpRangeClient(url);\n\n // Immediately following the header is the optional spatial index, we deliberately fetch\n // a small part of that to skip subsequent requests.\n const assumedIndexLength = (() => {\n // The actual branching factor will be in the header, but since we\n // don't have the header yet, we just guess. The consequence of\n // getting this wrong isn't terminal, it only means we may be\n // fetching slightly more than we need or that we need to make an\n // extra request later.\n const assumedBranchingFactor = DEFAULT_NODE_SIZE;\n\n // NOTE: each layer is exponentially larger\n const prefetchedLayers = 3;\n\n let result = 0;\n let i: number;\n for (i = 0; i < prefetchedLayers; i++) {\n const layer_width = assumedBranchingFactor ** i * NODE_ITEM_BYTE_LEN;\n result += layer_width;\n }\n return result;\n })();\n\n const minReqLength = assumedHeaderLength + assumedIndexLength;\n Logger.debug(\n `fetching header. minReqLength: ${minReqLength} (assumedHeaderLength: ${assumedHeaderLength}, assumedIndexLength: ${assumedIndexLength})`\n );\n\n {\n const bytes = new Uint8Array(await headerClient.getRange(0, 8, minReqLength, 'header'));\n if (!bytes.subarray(0, 3).every((v, i) => magicbytes[i] === v)) {\n Logger.error(`bytes: ${bytes} != ${magicbytes}`);\n throw new Error('Not a FlatGeobuf file');\n }\n Logger.debug('magic bytes look good');\n }\n\n let headerLength: number;\n {\n const bytes = await headerClient.getRange(8, 4, minReqLength, 'header');\n headerLength = new DataView(bytes).getUint32(0, true);\n const HEADER_MAX_BUFFER_SIZE = 1048576 * 10;\n if (headerLength > HEADER_MAX_BUFFER_SIZE || headerLength < 8) {\n // minimum size check avoids panic in FlatBuffers header decoding\n throw new Error('Invalid header size');\n }\n Logger.debug(`headerLength: ${headerLength}`);\n }\n\n const bytes = await headerClient.getRange(12, headerLength, minReqLength, 'header');\n const bb = new flatbuffers.ByteBuffer(new Uint8Array(bytes));\n const header = fromByteBuffer(bb);\n\n const indexLength = calcTreeSize(header.featuresCount, header.indexNodeSize);\n\n Logger.debug('completed: opening http reader');\n return new HttpReader(headerClient, header, headerLength, indexLength);\n }\n\n async *selectBbox(rect: Rect): AsyncGenerator<Feature, void, unknown> {\n // Read R-Tree index and build filter for features within bbox\n const lengthBeforeTree = this.lengthBeforeTree();\n\n const bufferedClient = this.headerClient;\n const readNode = async function (offsetIntoTree: number, size: number): Promise<ArrayBuffer> {\n const minReqLength = 0;\n return bufferedClient.getRange(\n lengthBeforeTree + offsetIntoTree,\n size,\n minReqLength,\n 'index'\n );\n };\n\n const batches: [number, number][][] = [];\n let currentBatch: [number, number][] = [];\n for await (const searchResult of streamSearch(\n this.header.featuresCount,\n this.header.indexNodeSize,\n rect,\n readNode\n )) {\n const [featureOffset, ,] = searchResult;\n let [, , featureLength] = searchResult;\n if (!featureLength) {\n Logger.info('final feature');\n // Normally we get the feature length by subtracting between\n // adjacent nodes from the index, which we can't do for the\n // _very_ last feature in a dataset.\n //\n // We could *guess* the size, but we'd risk overshooting the length,\n // which will cause some webservers to return HTTP 416: Unsatisfiable range\n //\n // So instead we fetch only the final features byte length, stored in the\n // first 4 bytes.\n featureLength = 4;\n }\n\n if (currentBatch.length == 0) {\n currentBatch.push([featureOffset, featureLength]);\n continue;\n }\n\n const prevFeature = currentBatch[currentBatch.length - 1];\n const gap = featureOffset - (prevFeature[0] + prevFeature[1]);\n if (gap > Config.global.extraRequestThreshold()) {\n Logger.info(`Pushing new feature batch, since gap ${gap} was too large`);\n batches.push(currentBatch);\n currentBatch = [];\n }\n\n currentBatch.push([featureOffset, featureLength]);\n }\n this.headerClient.logUsage('header+index');\n if (currentBatch.length > 0) {\n batches.push(currentBatch);\n }\n\n const promises: AsyncGenerator<Feature, any, any>[] = batches.flatMap(\n (batch: [number, number][]) => this.readFeatureBatch(batch)\n );\n\n // Fetch all batches concurrently, yielding features as they become\n // available, meaning the results may be intermixed.\n yield* Repeater.merge(promises);\n }\n\n lengthBeforeTree(): number {\n // FGB Layout is: [magicbytes (fixed), headerLength (i32), header (variable), Tree (variable), Features (variable)]\n return magicbytes.length + SIZE_PREFIX_LEN + this.headerLength;\n }\n\n lengthBeforeFeatures(): number {\n return this.lengthBeforeTree() + this.indexLength;\n }\n\n buildFeatureClient(): BufferedHttpRangeClient {\n return new BufferedHttpRangeClient(this.headerClient.httpClient);\n }\n\n /**\n * Fetch a batch of features in a single request, yielding each Feature\n *\n * `batch`: [offset, length] of features in the batch\n */\n async *readFeatureBatch(batch: [number, number][]): AsyncGenerator<Feature, void, unknown> {\n const [firstFeatureOffset] = batch[0];\n const [lastFeatureOffset, lastFeatureLength] = batch[batch.length - 1];\n\n const batchStart = firstFeatureOffset;\n const batchEnd = lastFeatureOffset + lastFeatureLength;\n const batchSize = batchEnd - batchStart;\n\n // A new feature client is needed for each batch to own the underlying buffer as features are yielded.\n const featureClient = this.buildFeatureClient();\n\n let minFeatureReqLength = batchSize;\n for (const [featureOffset] of batch) {\n yield await this.readFeature(featureClient, featureOffset, minFeatureReqLength);\n // Only set minFeatureReqLength for the first request.\n //\n // This should only affect a batch that contains the final feature, otherwise\n // we've calculated `batchSize` to get all the data we need for the batch.\n // For the very final feature in a dataset, we don't know it's length, so we\n // will end up executing an extra request for that batch.\n minFeatureReqLength = 0;\n }\n featureClient.logUsage('feature');\n }\n\n async readFeature(\n featureClient: BufferedHttpRangeClient,\n featureOffset: number,\n minFeatureReqLength: number\n ): Promise<Feature> {\n const offset = featureOffset + this.lengthBeforeFeatures();\n\n let featureLength: number;\n {\n const bytes = await featureClient.getRange(offset, 4, minFeatureReqLength, 'feature length');\n featureLength = new DataView(bytes).getUint32(0, true);\n }\n\n const byteBuffer = await featureClient.getRange(\n offset + 4,\n featureLength,\n minFeatureReqLength,\n 'feature data'\n );\n const bytes = new Uint8Array(byteBuffer);\n const bytesAligned = new Uint8Array(featureLength + SIZE_PREFIX_LEN);\n bytesAligned.set(bytes, SIZE_PREFIX_LEN);\n const bb = new flatbuffers.ByteBuffer(bytesAligned);\n bb.setPosition(SIZE_PREFIX_LEN);\n return Feature.getRootAsFeature(bb);\n }\n}\n\nclass BufferedHttpRangeClient {\n httpClient: HttpRangeClient;\n bytesEverUsed = 0;\n bytesEverFetched = 0;\n\n private buffer: ArrayBuffer = new ArrayBuffer(0);\n\n // Byte offset of `buffer` with respect to the beginning of the file being\n // buffered\n private head = 0;\n\n constructor(source: string | HttpRangeClient) {\n if (typeof source === 'string') {\n this.httpClient = new HttpRangeClient(source);\n } else if (source instanceof HttpRangeClient) {\n this.httpClient = source;\n } else {\n throw new Error('Unknown source ');\n }\n }\n\n async getRange(\n start: number,\n length: number,\n minReqLength: number,\n purpose: string\n ): Promise<ArrayBuffer> {\n this.bytesEverUsed += length;\n\n const start_i = start - this.head;\n const end_i = start_i + length;\n if (start_i >= 0 && end_i <= this.buffer.byteLength) {\n return this.buffer.slice(start_i, end_i);\n }\n\n const lengthToFetch = Math.max(length, minReqLength);\n\n this.bytesEverFetched += lengthToFetch;\n Logger.debug(`requesting for new Range: ${start}-${start + lengthToFetch - 1}`);\n this.buffer = await this.httpClient.getRange(start, lengthToFetch, purpose);\n this.head = start;\n\n return this.buffer.slice(0, length);\n }\n\n logUsage(purpose: string): void {\n const category = purpose.split(' ')[0];\n const used = this.bytesEverUsed;\n const requested = this.bytesEverFetched;\n const efficiency = ((100.0 * used) / requested).toFixed(2);\n\n Logger.info(`${category} bytes used/requested: ${used} / ${requested} = ${efficiency}%`);\n }\n}\n\nclass HttpRangeClient {\n url: string;\n requestsEverMade = 0;\n bytesEverRequested = 0;\n\n constructor(url: string) {\n this.url = url;\n }\n\n async getRange(begin: number, length: number, purpose: string): Promise<ArrayBuffer> {\n this.requestsEverMade += 1;\n this.bytesEverRequested += length;\n\n const range = `bytes=${begin}-${begin + length - 1}`;\n Logger.info(\n `request: #${this.requestsEverMade}, purpose: ${purpose}), bytes: (this_request: ${length}, ever: ${this.bytesEverRequested}), Range: ${range}`\n );\n\n const response = await fetch(this.url, {\n headers: {\n Range: range\n // TODO: better parallelize requests on Chrome\n //\n // Safari and Firefox have no issue performing Range requests\n // for a resource in parallel, but Chrome will stall a\n // subsequent request to the resource until it's received the\n // response headers of the prior request. So, it still allows\n // some limited parallelization, but it's not ideal.\n //\n // This is seemingly an artifact of how Chrome manages caching\n // and it might differ between platforms. We could work around it\n // by setting the request header:\n //\n // 'Cache-Control': 'no-cache, no-store'\n //\n // This allows requests to be fully parallelized in Chrome, but\n // then Chrome won't cache the response, so it seems not a\n // great trade-off.\n //\n // Another work around would be to make each Range request for\n // a separate URL by appending something like\n // `?cache_buster=<range>` to the URL, but then Chrome will\n // require an additional CORS preflight OPTIONS requests per\n // Range, which is also not a great trade-off.\n //\n // See:\n // https://bugs.chromium.org/p/chromium/issues/detail?id=969828&q=concurrent%20range%20requests&can=2\n // https://stackoverflow.com/questions/27513994/chrome-stalls-when-making-multiple-requests-to-same-resource\n }\n });\n\n return response.arrayBuffer();\n }\n}\n"],"mappings":"AAAA,OAAO,KAAKA,WAAW,MAAM,aAAa;AAC1C,SAAQC,QAAQ,QAAO,sBAAsB;AAAC,SAI5CC,YAAY,EACZC,iBAAiB,EACjBC,kBAAkB,EAClBC,YAAY;AAAA,SAENC,UAAU,EAAEC,eAAe;AAAA,OAC5BC,MAAM;AAAA,OACNC,MAAM;AAAA,SACOC,cAAc;AAAA,SAC1BC,OAAO;AAEf,OAAO,MAAMC,UAAU,CAAC;EAMtBC,WAAWA,CACTC,YAAqC,EACrCC,MAAkB,EAClBC,YAAoB,EACpBC,WAAmB,EACnB;IAAA,KAVMH,YAAY;IAAA,KACbC,MAAM;IAAA,KACLC,YAAY;IAAA,KACZC,WAAW;IAQjB,IAAI,CAACH,YAAY,GAAGA,YAAY;IAChC,IAAI,CAACC,MAAM,GAAGA,MAAM;IACpB,IAAI,CAACC,YAAY,GAAGA,YAAY;IAChC,IAAI,CAACC,WAAW,GAAGA,WAAW;EAChC;EAKA,aAAaC,IAAIA,CAACC,GAAW,EAAuB;IAIlD,MAAMC,mBAAmB,GAAG,IAAI;IAEhC,MAAMN,YAAY,GAAG,IAAIO,uBAAuB,CAACF,GAAG,CAAC;IAIrD,MAAMG,kBAAkB,GAAG,CAAC,MAAM;MAMhC,MAAMC,sBAAsB,GAAGpB,iBAAiB;MAGhD,MAAMqB,gBAAgB,GAAG,CAAC;MAE1B,IAAIC,MAAM,GAAG,CAAC;MACd,IAAIC,CAAS;MACb,KAAKA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGF,gBAAgB,EAAEE,CAAC,EAAE,EAAE;QACrC,MAAMC,WAAW,GAAGJ,sBAAsB,IAAIG,CAAC,GAAGtB,kBAAkB;QACpEqB,MAAM,IAAIE,WAAW;MACvB;MACA,OAAOF,MAAM;IACf,CAAC,EAAE,CAAC;IAEJ,MAAMG,YAAY,GAAGR,mBAAmB,GAAGE,kBAAkB;IAC7Db,MAAM,CAACoB,KAAK,CACT,kCAAiCD,YAAa,0BAAyBR,mBAAoB,yBAAwBE,kBAAmB,GACzI,CAAC;IAED;MACE,MAAMQ,KAAK,GAAG,IAAIC,UAAU,CAAC,MAAMjB,YAAY,CAACkB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAEJ,YAAY,EAAE,QAAQ,CAAC,CAAC;MACvF,IAAI,CAACE,KAAK,CAACG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAACC,KAAK,CAAC,CAACC,CAAC,EAAET,CAAC,KAAKpB,UAAU,CAACoB,CAAC,CAAC,KAAKS,CAAC,CAAC,EAAE;QAC9D1B,MAAM,CAAC2B,KAAK,CAAE,UAASN,KAAM,OAAMxB,UAAW,EAAC,CAAC;QAChD,MAAM,IAAI+B,KAAK,CAAC,uBAAuB,CAAC;MAC1C;MACA5B,MAAM,CAACoB,KAAK,CAAC,uBAAuB,CAAC;IACvC;IAEA,IAAIb,YAAoB;IACxB;MACE,MAAMc,KAAK,GAAG,MAAMhB,YAAY,CAACkB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAEJ,YAAY,EAAE,QAAQ,CAAC;MACvEZ,YAAY,GAAG,IAAIsB,QAAQ,CAACR,KAAK,CAAC,CAACS,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC;MACrD,MAAMC,sBAAsB,GAAG,OAAO,GAAG,EAAE;MAC3C,IAAIxB,YAAY,GAAGwB,sBAAsB,IAAIxB,YAAY,GAAG,CAAC,EAAE;QAE7D,MAAM,IAAIqB,KAAK,CAAC,qBAAqB,CAAC;MACxC;MACA5B,MAAM,CAACoB,KAAK,CAAE,iBAAgBb,YAAa,EAAC,CAAC;IAC/C;IAEA,MAAMc,KAAK,GAAG,MAAMhB,YAAY,CAACkB,QAAQ,CAAC,EAAE,EAAEhB,YAAY,EAAEY,YAAY,EAAE,QAAQ,CAAC;IACnF,MAAMa,EAAE,GAAG,IAAIzC,WAAW,CAAC0C,UAAU,CAAC,IAAIX,UAAU,CAACD,KAAK,CAAC,CAAC;IAC5D,MAAMf,MAAM,GAAGL,cAAc,CAAC+B,EAAE,CAAC;IAEjC,MAAMxB,WAAW,GAAGf,YAAY,CAACa,MAAM,CAAC4B,aAAa,EAAE5B,MAAM,CAAC6B,aAAa,CAAC;IAE5EnC,MAAM,CAACoB,KAAK,CAAC,gCAAgC,CAAC;IAC9C,OAAO,IAAIjB,UAAU,CAACE,YAAY,EAAEC,MAAM,EAAEC,YAAY,EAAEC,WAAW,CAAC;EACxE;EAEA,OAAO4B,UAAUA,CAACC,IAAU,EAA0C;IAEpE,MAAMC,gBAAgB,GAAG,IAAI,CAACA,gBAAgB,CAAC,CAAC;IAEhD,MAAMC,cAAc,GAAG,IAAI,CAAClC,YAAY;IACxC,MAAMmC,QAAQ,GAAG,eAAAA,CAAgBC,cAAsB,EAAEC,IAAY,EAAwB;MAC3F,MAAMvB,YAAY,GAAG,CAAC;MACtB,OAAOoB,cAAc,CAAChB,QAAQ,CAC5Be,gBAAgB,GAAGG,cAAc,EACjCC,IAAI,EACJvB,YAAY,EACZ,OACF,CAAC;IACH,CAAC;IAED,MAAMwB,OAA6B,GAAG,EAAE;IACxC,IAAIC,YAAgC,GAAG,EAAE;IACzC,WAAW,MAAMC,YAAY,IAAIjD,YAAY,CAC3C,IAAI,CAACU,MAAM,CAAC4B,aAAa,EACzB,IAAI,CAAC5B,MAAM,CAAC6B,aAAa,EACzBE,IAAI,EACJG,QACF,CAAC,EAAE;MACD,MAAM,CAACM,aAAa,GAAI,GAAGD,YAAY;MACvC,IAAI,IAAKE,aAAa,CAAC,GAAGF,YAAY;MACtC,IAAI,CAACE,aAAa,EAAE;QAClB/C,MAAM,CAACgD,IAAI,CAAC,eAAe,CAAC;QAU5BD,aAAa,GAAG,CAAC;MACnB;MAEA,IAAIH,YAAY,CAACK,MAAM,IAAI,CAAC,EAAE;QAC5BL,YAAY,CAACM,IAAI,CAAC,CAACJ,aAAa,EAAEC,aAAa,CAAC,CAAC;QACjD;MACF;MAEA,MAAMI,WAAW,GAAGP,YAAY,CAACA,YAAY,CAACK,MAAM,GAAG,CAAC,CAAC;MACzD,MAAMG,GAAG,GAAGN,aAAa,IAAIK,WAAW,CAAC,CAAC,CAAC,GAAGA,WAAW,CAAC,CAAC,CAAC,CAAC;MAC7D,IAAIC,GAAG,GAAGrD,MAAM,CAACsD,MAAM,CAACC,qBAAqB,CAAC,CAAC,EAAE;QAC/CtD,MAAM,CAACgD,IAAI,CAAE,wCAAuCI,GAAI,gBAAe,CAAC;QACxET,OAAO,CAACO,IAAI,CAACN,YAAY,CAAC;QAC1BA,YAAY,GAAG,EAAE;MACnB;MAEAA,YAAY,CAACM,IAAI,CAAC,CAACJ,aAAa,EAAEC,aAAa,CAAC,CAAC;IACnD;IACA,IAAI,CAAC1C,YAAY,CAACkD,QAAQ,CAAC,cAAc,CAAC;IAC1C,IAAIX,YAAY,CAACK,MAAM,GAAG,CAAC,EAAE;MAC3BN,OAAO,CAACO,IAAI,CAACN,YAAY,CAAC;IAC5B;IAEA,MAAMY,QAA6C,GAAGb,OAAO,CAACc,OAAO,CAClEC,KAAyB,IAAK,IAAI,CAACC,gBAAgB,CAACD,KAAK,CAC5D,CAAC;IAID,OAAOlE,QAAQ,CAACoE,KAAK,CAACJ,QAAQ,CAAC;EACjC;EAEAlB,gBAAgBA,CAAA,EAAW;IAEzB,OAAOzC,UAAU,CAACoD,MAAM,GAAGnD,eAAe,GAAG,IAAI,CAACS,YAAY;EAChE;EAEAsD,oBAAoBA,CAAA,EAAW;IAC7B,OAAO,IAAI,CAACvB,gBAAgB,CAAC,CAAC,GAAG,IAAI,CAAC9B,WAAW;EACnD;EAEAsD,kBAAkBA,CAAA,EAA4B;IAC5C,OAAO,IAAIlD,uBAAuB,CAAC,IAAI,CAACP,YAAY,CAAC0D,UAAU,CAAC;EAClE;EAOA,OAAOJ,gBAAgBA,CAACD,KAAyB,EAA0C;IACzF,MAAM,CAACM,kBAAkB,CAAC,GAAGN,KAAK,CAAC,CAAC,CAAC;IACrC,MAAM,CAACO,iBAAiB,EAAEC,iBAAiB,CAAC,GAAGR,KAAK,CAACA,KAAK,CAACT,MAAM,GAAG,CAAC,CAAC;IAEtE,MAAMkB,UAAU,GAAGH,kBAAkB;IACrC,MAAMI,QAAQ,GAAGH,iBAAiB,GAAGC,iBAAiB;IACtD,MAAMG,SAAS,GAAGD,QAAQ,GAAGD,UAAU;IAGvC,MAAMG,aAAa,GAAG,IAAI,CAACR,kBAAkB,CAAC,CAAC;IAE/C,IAAIS,mBAAmB,GAAGF,SAAS;IACnC,KAAK,MAAM,CAACvB,aAAa,CAAC,IAAIY,KAAK,EAAE;MACnC,MAAM,MAAM,IAAI,CAACc,WAAW,CAACF,aAAa,EAAExB,aAAa,EAAEyB,mBAAmB,CAAC;MAO/EA,mBAAmB,GAAG,CAAC;IACzB;IACAD,aAAa,CAACf,QAAQ,CAAC,SAAS,CAAC;EACnC;EAEA,MAAMiB,WAAWA,CACfF,aAAsC,EACtCxB,aAAqB,EACrByB,mBAA2B,EACT;IAClB,MAAME,MAAM,GAAG3B,aAAa,GAAG,IAAI,CAACe,oBAAoB,CAAC,CAAC;IAE1D,IAAId,aAAqB;IACzB;MACE,MAAM1B,KAAK,GAAG,MAAMiD,aAAa,CAAC/C,QAAQ,CAACkD,MAAM,EAAE,CAAC,EAAEF,mBAAmB,EAAE,gBAAgB,CAAC;MAC5FxB,aAAa,GAAG,IAAIlB,QAAQ,CAACR,KAAK,CAAC,CAACS,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC;IACxD;IAEA,MAAM4C,UAAU,GAAG,MAAMJ,aAAa,CAAC/C,QAAQ,CAC7CkD,MAAM,GAAG,CAAC,EACV1B,aAAa,EACbwB,mBAAmB,EACnB,cACF,CAAC;IACD,MAAMlD,KAAK,GAAG,IAAIC,UAAU,CAACoD,UAAU,CAAC;IACxC,MAAMC,YAAY,GAAG,IAAIrD,UAAU,CAACyB,aAAa,GAAGjD,eAAe,CAAC;IACpE6E,YAAY,CAACC,GAAG,CAACvD,KAAK,EAAEvB,eAAe,CAAC;IACxC,MAAMkC,EAAE,GAAG,IAAIzC,WAAW,CAAC0C,UAAU,CAAC0C,YAAY,CAAC;IACnD3C,EAAE,CAAC6C,WAAW,CAAC/E,eAAe,CAAC;IAC/B,OAAOI,OAAO,CAAC4E,gBAAgB,CAAC9C,EAAE,CAAC;EACrC;AACF;AAEA,MAAMpB,uBAAuB,CAAC;EAW5BR,WAAWA,CAAC2E,MAAgC,EAAE;IAAA,KAV9ChB,UAAU;IAAA,KACViB,aAAa,GAAG,CAAC;IAAA,KACjBC,gBAAgB,GAAG,CAAC;IAAA,KAEZC,MAAM,GAAgB,IAAIC,WAAW,CAAC,CAAC,CAAC;IAAA,KAIxCC,IAAI,GAAG,CAAC;IAGd,IAAI,OAAOL,MAAM,KAAK,QAAQ,EAAE;MAC9B,IAAI,CAAChB,UAAU,GAAG,IAAIsB,eAAe,CAACN,MAAM,CAAC;IAC/C,CAAC,MAAM,IAAIA,MAAM,YAAYM,eAAe,EAAE;MAC5C,IAAI,CAACtB,UAAU,GAAGgB,MAAM;IAC1B,CAAC,MAAM;MACL,MAAM,IAAInD,KAAK,CAAC,iBAAiB,CAAC;IACpC;EACF;EAEA,MAAML,QAAQA,CACZ+D,KAAa,EACbrC,MAAc,EACd9B,YAAoB,EACpBoE,OAAe,EACO;IACtB,IAAI,CAACP,aAAa,IAAI/B,MAAM;IAE5B,MAAMuC,OAAO,GAAGF,KAAK,GAAG,IAAI,CAACF,IAAI;IACjC,MAAMK,KAAK,GAAGD,OAAO,GAAGvC,MAAM;IAC9B,IAAIuC,OAAO,IAAI,CAAC,IAAIC,KAAK,IAAI,IAAI,CAACP,MAAM,CAACQ,UAAU,EAAE;MACnD,OAAO,IAAI,CAACR,MAAM,CAACS,KAAK,CAACH,OAAO,EAAEC,KAAK,CAAC;IAC1C;IAEA,MAAMG,aAAa,GAAGC,IAAI,CAACC,GAAG,CAAC7C,MAAM,EAAE9B,YAAY,CAAC;IAEpD,IAAI,CAAC8D,gBAAgB,IAAIW,aAAa;IACtC5F,MAAM,CAACoB,KAAK,CAAE,6BAA4BkE,KAAM,IAAGA,KAAK,GAAGM,aAAa,GAAG,CAAE,EAAC,CAAC;IAC/E,IAAI,CAACV,MAAM,GAAG,MAAM,IAAI,CAACnB,UAAU,CAACxC,QAAQ,CAAC+D,KAAK,EAAEM,aAAa,EAAEL,OAAO,CAAC;IAC3E,IAAI,CAACH,IAAI,GAAGE,KAAK;IAEjB,OAAO,IAAI,CAACJ,MAAM,CAACS,KAAK,CAAC,CAAC,EAAE1C,MAAM,CAAC;EACrC;EAEAM,QAAQA,CAACgC,OAAe,EAAQ;IAC9B,MAAMQ,QAAQ,GAAGR,OAAO,CAACS,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtC,MAAMC,IAAI,GAAG,IAAI,CAACjB,aAAa;IAC/B,MAAMkB,SAAS,GAAG,IAAI,CAACjB,gBAAgB;IACvC,MAAMkB,UAAU,GAAG,CAAE,KAAK,GAAGF,IAAI,GAAIC,SAAS,EAAEE,OAAO,CAAC,CAAC,CAAC;IAE1DpG,MAAM,CAACgD,IAAI,CAAE,GAAE+C,QAAS,0BAAyBE,IAAK,MAAKC,SAAU,MAAKC,UAAW,GAAE,CAAC;EAC1F;AACF;AAEA,MAAMd,eAAe,CAAC;EAKpBjF,WAAWA,CAACM,GAAW,EAAE;IAAA,KAJzBA,GAAG;IAAA,KACH2F,gBAAgB,GAAG,CAAC;IAAA,KACpBC,kBAAkB,GAAG,CAAC;IAGpB,IAAI,CAAC5F,GAAG,GAAGA,GAAG;EAChB;EAEA,MAAMa,QAAQA,CAACgF,KAAa,EAAEtD,MAAc,EAAEsC,OAAe,EAAwB;IACnF,IAAI,CAACc,gBAAgB,IAAI,CAAC;IAC1B,IAAI,CAACC,kBAAkB,IAAIrD,MAAM;IAEjC,MAAMuD,KAAK,GAAI,SAAQD,KAAM,IAAGA,KAAK,GAAGtD,MAAM,GAAG,CAAE,EAAC;IACpDjD,MAAM,CAACgD,IAAI,CACR,aAAY,IAAI,CAACqD,gBAAiB,cAAad,OAAQ,4BAA2BtC,MAAO,WAAU,IAAI,CAACqD,kBAAmB,aAAYE,KAAM,EAChJ,CAAC;IAED,MAAMC,QAAQ,GAAG,MAAMC,KAAK,CAAC,IAAI,CAAChG,GAAG,EAAE;MACrCiG,OAAO,EAAE;QACPC,KAAK,EAAEJ;MA4BT;IACF,CAAC,CAAC;IAEF,OAAOC,QAAQ,CAACI,WAAW,CAAC,CAAC;EAC/B;AACF"}
|
|
@@ -1,14 +1,14 @@
|
|
|
1
|
-
export * as generic from './generic
|
|
2
|
-
export * as geojson from './geojson
|
|
3
|
-
export { Column } from './flat-geobuf/column
|
|
4
|
-
export { Geometry } from './flat-geobuf/geometry
|
|
5
|
-
export { Feature } from './flat-geobuf/feature
|
|
6
|
-
export { ISimpleGeometry } from './generic/geometry
|
|
7
|
-
export { IFeature } from './generic/feature
|
|
8
|
-
export { FromFeatureFn } from './generic/featurecollection
|
|
9
|
-
export { IGeoJsonFeature } from './geojson/feature
|
|
10
|
-
export { default as HeaderMeta } from './header-meta
|
|
11
|
-
export { default as ColumnMeta } from './column-meta
|
|
12
|
-
export { default as CrsMeta } from './crs-meta
|
|
13
|
-
export { Rect } from './packedrtree
|
|
1
|
+
export * as generic from './generic';
|
|
2
|
+
export * as geojson from './geojson';
|
|
3
|
+
export { Column } from './flat-geobuf/column';
|
|
4
|
+
export { Geometry } from './flat-geobuf/geometry';
|
|
5
|
+
export { Feature } from './flat-geobuf/feature';
|
|
6
|
+
export { ISimpleGeometry } from './generic/geometry';
|
|
7
|
+
export { IFeature } from './generic/feature';
|
|
8
|
+
export { FromFeatureFn } from './generic/featurecollection';
|
|
9
|
+
export { IGeoJsonFeature } from './geojson/feature';
|
|
10
|
+
export { default as HeaderMeta } from './header-meta';
|
|
11
|
+
export { default as ColumnMeta } from './column-meta';
|
|
12
|
+
export { default as CrsMeta } from './crs-meta';
|
|
13
|
+
export { Rect } from './packedrtree';
|
|
14
14
|
//# sourceMappingURL=index.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/flatgeobuf/3.27.2/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,OAAO,MAAM,
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/flatgeobuf/3.27.2/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,OAAO,MAAM,WAAW,CAAC;AACrC,OAAO,KAAK,OAAO,MAAM,WAAW,CAAC;AAGrC,OAAO,EAAC,MAAM,EAAC,MAAM,sBAAsB,CAAC;AAC5C,OAAO,EAAC,QAAQ,EAAC,MAAM,wBAAwB,CAAC;AAChD,OAAO,EAAC,OAAO,EAAC,MAAM,uBAAuB,CAAC;AAE9C,OAAO,EAAC,eAAe,EAAC,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAC,QAAQ,EAAC,MAAM,mBAAmB,CAAC;AAC3C,OAAO,EAAC,aAAa,EAAC,MAAM,6BAA6B,CAAC;AAE1D,OAAO,EAAC,eAAe,EAAC,MAAM,mBAAmB,CAAC;AAElD,OAAO,EAAC,OAAO,IAAI,UAAU,EAAC,MAAM,eAAe,CAAC;AACpD,OAAO,EAAC,OAAO,IAAI,UAAU,EAAC,MAAM,eAAe,CAAC;AACpD,OAAO,EAAC,OAAO,IAAI,OAAO,EAAC,MAAM,YAAY,CAAC;AAE9C,OAAO,EAAC,IAAI,EAAC,MAAM,eAAe,CAAC"}
|
|
@@ -1,16 +1,16 @@
|
|
|
1
|
-
import * as _generic from
|
|
1
|
+
import * as _generic from "./generic/index.js";
|
|
2
2
|
export { _generic as generic };
|
|
3
|
-
import * as _geojson from
|
|
3
|
+
import * as _geojson from "./geojson/index.js";
|
|
4
4
|
export { _geojson as geojson };
|
|
5
|
-
export { Column } from
|
|
6
|
-
export { Geometry } from
|
|
7
|
-
export { Feature } from
|
|
8
|
-
export { ISimpleGeometry } from
|
|
9
|
-
export { IFeature } from
|
|
10
|
-
export { FromFeatureFn } from
|
|
11
|
-
export { IGeoJsonFeature } from
|
|
12
|
-
export { default as HeaderMeta } from
|
|
13
|
-
export { default as ColumnMeta } from
|
|
14
|
-
export { default as CrsMeta } from
|
|
15
|
-
export { Rect } from
|
|
5
|
+
export { Column } from "./flat-geobuf/column.js";
|
|
6
|
+
export { Geometry } from "./flat-geobuf/geometry.js";
|
|
7
|
+
export { Feature } from "./flat-geobuf/feature.js";
|
|
8
|
+
export { ISimpleGeometry } from "./generic/geometry.js";
|
|
9
|
+
export { IFeature } from "./generic/feature.js";
|
|
10
|
+
export { FromFeatureFn } from "./generic/featurecollection.js";
|
|
11
|
+
export { IGeoJsonFeature } from "./geojson/feature.js";
|
|
12
|
+
export { default as HeaderMeta } from "./header-meta.js";
|
|
13
|
+
export { default as ColumnMeta } from "./column-meta.js";
|
|
14
|
+
export { default as CrsMeta } from "./crs-meta.js";
|
|
15
|
+
export { Rect } from "./packedrtree.js";
|
|
16
16
|
//# sourceMappingURL=index.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.js","names":["
|
|
1
|
+
{"version":3,"file":"index.js","names":["generic","_geojson","geojson","Column","Geometry","Feature","ISimpleGeometry","IFeature","FromFeatureFn","IGeoJsonFeature","default","HeaderMeta","ColumnMeta","CrsMeta","Rect"],"sources":["../../../src/flatgeobuf/3.27.2/index.ts"],"sourcesContent":["export * as generic from './generic';\nexport * as geojson from './geojson';\n// export * as ol from './ol';\n\nexport {Column} from './flat-geobuf/column';\nexport {Geometry} from './flat-geobuf/geometry';\nexport {Feature} from './flat-geobuf/feature';\n\nexport {ISimpleGeometry} from './generic/geometry';\nexport {IFeature} from './generic/feature';\nexport {FromFeatureFn} from './generic/featurecollection';\n\nexport {IGeoJsonFeature} from './geojson/feature';\n\nexport {default as HeaderMeta} from './header-meta';\nexport {default as ColumnMeta} from './column-meta';\nexport {default as CrsMeta} from './crs-meta';\n\nexport {Rect} from './packedrtree';\n"],"mappings":";qBAAYA,OAAO;AAAA,YAAAC,QAAA;AAAA,SAAAA,QAAA,IACPC,OAAO;AAAA,SAGXC,MAAM;AAAA,SACNC,QAAQ;AAAA,SACRC,OAAO;AAAA,SAEPC,eAAe;AAAA,SACfC,QAAQ;AAAA,SACRC,aAAa;AAAA,SAEbC,eAAe;AAAA,SAEfC,OAAO,IAAIC,UAAU;AAAA,SACrBD,OAAO,IAAIE,UAAU;AAAA,SACrBF,OAAO,IAAIG,OAAO;AAAA,SAElBC,IAAI"}
|
|
@@ -1,5 +1,5 @@
|
|
|
1
|
-
import Config from
|
|
2
|
-
import Logger from
|
|
1
|
+
import Config from "./config.js";
|
|
2
|
+
import Logger from "./logger.js";
|
|
3
3
|
export const NODE_ITEM_BYTE_LEN = 8 * 4 + 8;
|
|
4
4
|
export const NODE_ITEM_LEN = NODE_ITEM_BYTE_LEN;
|
|
5
5
|
export const DEFAULT_NODE_SIZE = 16;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"packedrtree.js","names":["Config","Logger","NODE_ITEM_BYTE_LEN","NODE_ITEM_LEN","DEFAULT_NODE_SIZE","calcTreeSize","numItems","nodeSize","Math","min","max","Number","n","numNodes","ceil","generateLevelBounds","Error","levelNumNodes","push","levelOffsets","size","levelBounds","i","length","streamSearch","rect","readNode","NodeRange","constructor","nodes","level","_level","startNodeIdx","endNodeIdx","extendEndNodeIdx","newIdx","console","assert","toString","minX","minY","maxX","maxY","info","firstLeafNodeIdx","rootNodeRange","range","queue","debug","nodeRange","shift","nodeRangeStartIdx","isLeafNode","nodeRangeEndIdx","levelBound","nodeIdx","numNodesInRange","buffer","dataView","DataView","nodeIdxInDataView","dataViewByteStart","getFloat64","offset","getBigUint64","featureByteOffset","featureLength","nextPos","nextOffset","featureIdx","firstChildNodeIdx","extraRequestThresholdNodes","global","extraRequestThreshold","nearestNodeRange","undefined","newNodeRange"],"sources":["../../../src/flatgeobuf/3.27.2/packedrtree.ts"],"sourcesContent":["import Config from './config.js';\nimport Logger from './logger.js';\n\nexport const NODE_ITEM_BYTE_LEN: number = 8 * 4 + 8;\n/**\n * @deprecated Use `NODE_ITEM_BYTE_LEN` instead.\n */\nexport const NODE_ITEM_LEN = NODE_ITEM_BYTE_LEN;\n\n// default branching factor of a node in the rtree\n//\n// actual value will be specified in the header but\n// this can be useful for having reasonably sized guesses for fetch-sizes when\n// streaming results\nexport const DEFAULT_NODE_SIZE = 16;\n\nexport interface Rect {\n minX: number;\n minY: number;\n maxX: number;\n maxY: number;\n}\n\nexport function calcTreeSize(numItems: number, nodeSize: number): number {\n nodeSize = Math.min(Math.max(Number(nodeSize), 2), 65535);\n let n = numItems;\n let numNodes = n;\n do {\n n = Math.ceil(n / nodeSize);\n numNodes += n;\n } while (n !== 1);\n return numNodes * NODE_ITEM_BYTE_LEN;\n}\n\n/**\n * returns [levelOffset, numNodes] for each level\n */\nexport function generateLevelBounds(numItems: number, nodeSize: number): Array<[number, number]> {\n if (nodeSize < 2) throw new Error('Node size must be at least 2');\n if (numItems === 0) throw new Error('Number of items must be greater than 0');\n\n // number of nodes per level in bottom-up order\n let n = numItems;\n let numNodes = n;\n const levelNumNodes = [n];\n do {\n n = Math.ceil(n / nodeSize);\n numNodes += n;\n levelNumNodes.push(n);\n } while (n !== 1);\n\n // bounds per level in reversed storage order (top-down)\n const levelOffsets: Array<number> = [];\n n = numNodes;\n for (const size of levelNumNodes) {\n levelOffsets.push(n - size);\n n -= size;\n }\n const levelBounds: Array<[number, number]> = [];\n for (let i = 0; i < levelNumNodes.length; i++)\n levelBounds.push([levelOffsets[i], levelOffsets[i] + levelNumNodes[i]]);\n return levelBounds;\n}\n\ntype ReadNodeFn = (treeOffset: number, size: number) => Promise<ArrayBuffer>;\n\n/**\n * A feature found to be within the bounding box `rect`\n *\n * (offset, index)\n * `offset`: Byte offset in feature data section\n * `index`: feature number\n * `featureLength`: featureLength, except for the last element\n */\nexport type SearchResult = [number, number, number | null];\n\n/**\n * Yield's a `SearchResult` for each feature within the bounds of `rect`.\n *\n * Every node in the FGB index tree has a bounding rect, all of the nodes children\n * are contained within that bounding rect. The leaf nodes of the tree represent\n * the features of the collection.\n *\n * As we traverse the tree, starting from the root, we'll need to read more data\n * from the index. When we don't already have this range data buffered locally,\n * an HTTP fetch is triggered. For performance, we merge adjacent and nearby\n * request ranges into a single request, reasoning that fetching a few extra\n * bytes is a good tradeoff if it means we can reduce the number of requests.\n */\nexport async function* streamSearch(\n numItems: number,\n nodeSize: number,\n rect: Rect,\n readNode: ReadNodeFn\n): AsyncGenerator<SearchResult, void, unknown> {\n type NodeIdx = number;\n class NodeRange {\n _level: number;\n nodes: [NodeIdx, NodeIdx];\n constructor(nodes: [NodeIdx, NodeIdx], level: number) {\n this._level = level;\n this.nodes = nodes;\n }\n\n level(): number {\n return this._level;\n }\n\n startNodeIdx(): NodeIdx {\n return this.nodes[0];\n }\n\n endNodeIdx(): NodeIdx {\n return this.nodes[1];\n }\n\n extendEndNodeIdx(newIdx: number) {\n console.assert(newIdx > this.nodes[1]);\n this.nodes[1] = newIdx;\n }\n\n toString(): string {\n return `[NodeRange level: ${this._level}, nodes: ${this.nodes[0]}-${this.nodes[1]}]`;\n }\n }\n\n const {minX, minY, maxX, maxY} = rect;\n Logger.info(`tree items: ${numItems}, nodeSize: ${nodeSize}`);\n const levelBounds = generateLevelBounds(numItems, nodeSize);\n const firstLeafNodeIdx = levelBounds[0][0];\n\n const rootNodeRange: NodeRange = (() => {\n const range: [number, number] = [0, 1];\n const level = levelBounds.length - 1;\n return new NodeRange(range, level);\n })();\n\n const queue: Array<NodeRange> = [rootNodeRange];\n\n Logger.debug(\n `starting stream search with queue: ${queue}, numItems: ${numItems}, nodeSize: ${nodeSize}, levelBounds: ${levelBounds}`\n );\n\n while (queue.length != 0) {\n // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n const nodeRange = queue.shift()!;\n\n Logger.debug(`popped node: ${nodeRange}, queueLength: ${queue.length}`);\n\n const nodeRangeStartIdx = nodeRange.startNodeIdx();\n const isLeafNode = nodeRangeStartIdx >= firstLeafNodeIdx;\n\n // find the end index of the node\n const nodeRangeEndIdx = (() => {\n const [, levelBound] = levelBounds[nodeRange.level()];\n const nodeIdx = Math.min(nodeRange.endNodeIdx() + nodeSize, levelBound);\n\n if (isLeafNode && nodeIdx < levelBound) {\n // We can infer the length of *this* feature by getting the start of the *next*\n // feature, so we get an extra node.\n // This approach doesn't work for the final node in the index,\n // but in that case we know that the feature runs to the end of the FGB file and\n // could make an open ended range request to get \"the rest of the data\".\n return nodeIdx + 1;\n }\n return nodeIdx;\n })();\n\n const numNodesInRange = nodeRangeEndIdx - nodeRangeStartIdx;\n\n const buffer = await readNode(\n nodeRangeStartIdx * NODE_ITEM_BYTE_LEN,\n numNodesInRange * NODE_ITEM_BYTE_LEN\n );\n\n const dataView = new DataView(buffer);\n for (let nodeIdx = nodeRangeStartIdx; nodeIdx < nodeRangeEndIdx; nodeIdx++) {\n const nodeIdxInDataView = nodeIdx - nodeRangeStartIdx;\n const dataViewByteStart = nodeIdxInDataView * NODE_ITEM_BYTE_LEN;\n if (maxX < dataView.getFloat64(dataViewByteStart + 0, true)) continue; // maxX < nodeMinX\n if (maxY < dataView.getFloat64(dataViewByteStart + 8, true)) continue; // maxY < nodeMinY\n if (minX > dataView.getFloat64(dataViewByteStart + 16, true)) continue; // minX > nodeMaxX\n if (minY > dataView.getFloat64(dataViewByteStart + 24, true)) continue; // minY > nodeMaxY\n\n // `offset` is:\n // For leaf nodes: the byte-offset into the feature buffer.\n // For inner nodes: the node-idx of its first child.\n const offset = dataView.getBigUint64(dataViewByteStart + 32, true);\n\n if (isLeafNode) {\n const featureByteOffset = offset;\n const featureLength = (() => {\n if (nodeIdx < numItems - 1) {\n // Since features are tightly packed, we infer the\n // length of _this_ feature by measuring to the _next_\n // feature's start.\n const nextPos = (nodeIdxInDataView + 1) * NODE_ITEM_BYTE_LEN;\n // console.debug(`nodeIdx: ${nodeIdx} of ${numItems}, nodeRangeStartIdx: ${nodeRangeStartIdx}, nextPos: ${nextPos}, dataView.byteLength: ${dataView.byteLength}`,);\n const nextOffset = dataView.getBigUint64(nextPos + 32, true);\n return nextOffset - featureByteOffset;\n }\n // This is the last feature - there's no \"next\" feature\n // to measure to, so we can't know it's length.\n return null;\n })();\n\n // Logger.debug(`featureByteOffset: ${featureByteOffset}, nodeIdx: ${nodeIdx}, featureLength: ${featureLength}`);\n const featureIdx = nodeIdx - firstLeafNodeIdx;\n yield [Number(featureByteOffset), featureIdx, Number(featureLength)];\n continue;\n }\n\n const firstChildNodeIdx = offset;\n\n // request up to this many nodes if it means we can eliminate an\n // extra request\n const extraRequestThresholdNodes = Config.global.extraRequestThreshold() / NODE_ITEM_BYTE_LEN;\n\n // Since we're traversing the tree by monotonically increasing byte\n // offset, the most recently enqueued node range will be the\n // nearest, and thus presents the best candidate for merging.\n const nearestNodeRange = queue[queue.length - 1];\n if (\n nearestNodeRange !== undefined &&\n nearestNodeRange.level() == nodeRange.level() - 1 &&\n firstChildNodeIdx < nearestNodeRange.endNodeIdx() + extraRequestThresholdNodes\n ) {\n Logger.debug(\n `Merging \"nodeRange\" request into existing range: ${nearestNodeRange}, newEndNodeIdx: ${nearestNodeRange.endNodeIdx()} -> ${firstChildNodeIdx}`\n );\n nearestNodeRange.extendEndNodeIdx(Number(firstChildNodeIdx));\n continue;\n }\n\n const newNodeRange: NodeRange = (() => {\n const level = nodeRange.level() - 1;\n const range: [number, number] = [Number(firstChildNodeIdx), Number(firstChildNodeIdx) + 1];\n return new NodeRange(range, level);\n })();\n\n // We're going to add a new node range - log the reason\n if (nearestNodeRange !== undefined && nearestNodeRange.level() == newNodeRange.level()) {\n Logger.info(\n `Same level, but too far away. Pushing new request for nodeIdx: ${firstChildNodeIdx} rather than merging with distant ${nearestNodeRange}`\n );\n } else {\n Logger.info(\n `Pushing new level for ${newNodeRange} onto queue with nearestNodeRange: ${nearestNodeRange} since there's not already a range for this level.`\n );\n }\n\n queue.push(newNodeRange);\n }\n }\n}\n"],"mappings":"AAAA,OAAOA,MAAM,MAAM,aAAa;AAChC,OAAOC,MAAM,MAAM,aAAa;AAEhC,OAAO,MAAMC,kBAA0B,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;AAInD,OAAO,MAAMC,aAAa,GAAGD,kBAAkB;AAO/C,OAAO,MAAME,iBAAiB,GAAG,EAAE;AASnC,OAAO,SAASC,YAAYA,CAACC,QAAgB,EAAEC,QAAgB,EAAU;EACvEA,QAAQ,GAAGC,IAAI,CAACC,GAAG,CAACD,IAAI,CAACE,GAAG,CAACC,MAAM,CAACJ,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC;EACzD,IAAIK,CAAC,GAAGN,QAAQ;EAChB,IAAIO,QAAQ,GAAGD,CAAC;EAChB,GAAG;IACDA,CAAC,GAAGJ,IAAI,CAACM,IAAI,CAACF,CAAC,GAAGL,QAAQ,CAAC;IAC3BM,QAAQ,IAAID,CAAC;EACf,CAAC,QAAQA,CAAC,KAAK,CAAC;EAChB,OAAOC,QAAQ,GAAGX,kBAAkB;AACtC;AAKA,OAAO,SAASa,mBAAmBA,CAACT,QAAgB,EAAEC,QAAgB,EAA2B;EAC/F,IAAIA,QAAQ,GAAG,CAAC,EAAE,MAAM,IAAIS,KAAK,CAAC,8BAA8B,CAAC;EACjE,IAAIV,QAAQ,KAAK,CAAC,EAAE,MAAM,IAAIU,KAAK,CAAC,wCAAwC,CAAC;EAG7E,IAAIJ,CAAC,GAAGN,QAAQ;EAChB,IAAIO,QAAQ,GAAGD,CAAC;EAChB,MAAMK,aAAa,GAAG,CAACL,CAAC,CAAC;EACzB,GAAG;IACDA,CAAC,GAAGJ,IAAI,CAACM,IAAI,CAACF,CAAC,GAAGL,QAAQ,CAAC;IAC3BM,QAAQ,IAAID,CAAC;IACbK,aAAa,CAACC,IAAI,CAACN,CAAC,CAAC;EACvB,CAAC,QAAQA,CAAC,KAAK,CAAC;EAGhB,MAAMO,YAA2B,GAAG,EAAE;EACtCP,CAAC,GAAGC,QAAQ;EACZ,KAAK,MAAMO,IAAI,IAAIH,aAAa,EAAE;IAChCE,YAAY,CAACD,IAAI,CAACN,CAAC,GAAGQ,IAAI,CAAC;IAC3BR,CAAC,IAAIQ,IAAI;EACX;EACA,MAAMC,WAAoC,GAAG,EAAE;EAC/C,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGL,aAAa,CAACM,MAAM,EAAED,CAAC,EAAE,EAC3CD,WAAW,CAACH,IAAI,CAAC,CAACC,YAAY,CAACG,CAAC,CAAC,EAAEH,YAAY,CAACG,CAAC,CAAC,GAAGL,aAAa,CAACK,CAAC,CAAC,CAAC,CAAC;EACzE,OAAOD,WAAW;AACpB;AA2BA,OAAO,gBAAgBG,YAAYA,CACjClB,QAAgB,EAChBC,QAAgB,EAChBkB,IAAU,EACVC,QAAoB,EACyB;EAE7C,MAAMC,SAAS,CAAC;IAGdC,WAAWA,CAACC,KAAyB,EAAEC,KAAa,EAAE;MAAA,KAFtDC,MAAM;MAAA,KACNF,KAAK;MAEH,IAAI,CAACE,MAAM,GAAGD,KAAK;MACnB,IAAI,CAACD,KAAK,GAAGA,KAAK;IACpB;IAEAC,KAAKA,CAAA,EAAW;MACd,OAAO,IAAI,CAACC,MAAM;IACpB;IAEAC,YAAYA,CAAA,EAAY;MACtB,OAAO,IAAI,CAACH,KAAK,CAAC,CAAC,CAAC;IACtB;IAEAI,UAAUA,CAAA,EAAY;MACpB,OAAO,IAAI,CAACJ,KAAK,CAAC,CAAC,CAAC;IACtB;IAEAK,gBAAgBA,CAACC,MAAc,EAAE;MAC/BC,OAAO,CAACC,MAAM,CAACF,MAAM,GAAG,IAAI,CAACN,KAAK,CAAC,CAAC,CAAC,CAAC;MACtC,IAAI,CAACA,KAAK,CAAC,CAAC,CAAC,GAAGM,MAAM;IACxB;IAEAG,QAAQA,CAAA,EAAW;MACjB,OAAQ,qBAAoB,IAAI,CAACP,MAAO,YAAW,IAAI,CAACF,KAAK,CAAC,CAAC,CAAE,IAAG,IAAI,CAACA,KAAK,CAAC,CAAC,CAAE,GAAE;IACtF;EACF;EAEA,MAAM;IAACU,IAAI;IAAEC,IAAI;IAAEC,IAAI;IAAEC;EAAI,CAAC,GAAGjB,IAAI;EACrCxB,MAAM,CAAC0C,IAAI,CAAE,eAAcrC,QAAS,eAAcC,QAAS,EAAC,CAAC;EAC7D,MAAMc,WAAW,GAAGN,mBAAmB,CAACT,QAAQ,EAAEC,QAAQ,CAAC;EAC3D,MAAMqC,gBAAgB,GAAGvB,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;EAE1C,MAAMwB,aAAwB,GAAG,CAAC,MAAM;IACtC,MAAMC,KAAuB,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IACtC,MAAMhB,KAAK,GAAGT,WAAW,CAACE,MAAM,GAAG,CAAC;IACpC,OAAO,IAAII,SAAS,CAACmB,KAAK,EAAEhB,KAAK,CAAC;EACpC,CAAC,EAAE,CAAC;EAEJ,MAAMiB,KAAuB,GAAG,CAACF,aAAa,CAAC;EAE/C5C,MAAM,CAAC+C,KAAK,CACT,sCAAqCD,KAAM,eAAczC,QAAS,eAAcC,QAAS,kBAAiBc,WAAY,EACzH,CAAC;EAED,OAAO0B,KAAK,CAACxB,MAAM,IAAI,CAAC,EAAE;IAExB,MAAM0B,SAAS,GAAGF,KAAK,CAACG,KAAK,CAAC,CAAE;IAEhCjD,MAAM,CAAC+C,KAAK,CAAE,gBAAeC,SAAU,kBAAiBF,KAAK,CAACxB,MAAO,EAAC,CAAC;IAEvE,MAAM4B,iBAAiB,GAAGF,SAAS,CAACjB,YAAY,CAAC,CAAC;IAClD,MAAMoB,UAAU,GAAGD,iBAAiB,IAAIP,gBAAgB;IAGxD,MAAMS,eAAe,GAAG,CAAC,MAAM;MAC7B,MAAM,GAAGC,UAAU,CAAC,GAAGjC,WAAW,CAAC4B,SAAS,CAACnB,KAAK,CAAC,CAAC,CAAC;MACrD,MAAMyB,OAAO,GAAG/C,IAAI,CAACC,GAAG,CAACwC,SAAS,CAAChB,UAAU,CAAC,CAAC,GAAG1B,QAAQ,EAAE+C,UAAU,CAAC;MAEvE,IAAIF,UAAU,IAAIG,OAAO,GAAGD,UAAU,EAAE;QAMtC,OAAOC,OAAO,GAAG,CAAC;MACpB;MACA,OAAOA,OAAO;IAChB,CAAC,EAAE,CAAC;IAEJ,MAAMC,eAAe,GAAGH,eAAe,GAAGF,iBAAiB;IAE3D,MAAMM,MAAM,GAAG,MAAM/B,QAAQ,CAC3ByB,iBAAiB,GAAGjD,kBAAkB,EACtCsD,eAAe,GAAGtD,kBACpB,CAAC;IAED,MAAMwD,QAAQ,GAAG,IAAIC,QAAQ,CAACF,MAAM,CAAC;IACrC,KAAK,IAAIF,OAAO,GAAGJ,iBAAiB,EAAEI,OAAO,GAAGF,eAAe,EAAEE,OAAO,EAAE,EAAE;MAC1E,MAAMK,iBAAiB,GAAGL,OAAO,GAAGJ,iBAAiB;MACrD,MAAMU,iBAAiB,GAAGD,iBAAiB,GAAG1D,kBAAkB;MAChE,IAAIuC,IAAI,GAAGiB,QAAQ,CAACI,UAAU,CAACD,iBAAiB,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE;MAC7D,IAAInB,IAAI,GAAGgB,QAAQ,CAACI,UAAU,CAACD,iBAAiB,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE;MAC7D,IAAItB,IAAI,GAAGmB,QAAQ,CAACI,UAAU,CAACD,iBAAiB,GAAG,EAAE,EAAE,IAAI,CAAC,EAAE;MAC9D,IAAIrB,IAAI,GAAGkB,QAAQ,CAACI,UAAU,CAACD,iBAAiB,GAAG,EAAE,EAAE,IAAI,CAAC,EAAE;MAK9D,MAAME,MAAM,GAAGL,QAAQ,CAACM,YAAY,CAACH,iBAAiB,GAAG,EAAE,EAAE,IAAI,CAAC;MAElE,IAAIT,UAAU,EAAE;QACd,MAAMa,iBAAiB,GAAGF,MAAM;QAChC,MAAMG,aAAa,GAAG,CAAC,MAAM;UAC3B,IAAIX,OAAO,GAAGjD,QAAQ,GAAG,CAAC,EAAE;YAI1B,MAAM6D,OAAO,GAAG,CAACP,iBAAiB,GAAG,CAAC,IAAI1D,kBAAkB;YAE5D,MAAMkE,UAAU,GAAGV,QAAQ,CAACM,YAAY,CAACG,OAAO,GAAG,EAAE,EAAE,IAAI,CAAC;YAC5D,OAAOC,UAAU,GAAGH,iBAAiB;UACvC;UAGA,OAAO,IAAI;QACb,CAAC,EAAE,CAAC;QAGJ,MAAMI,UAAU,GAAGd,OAAO,GAAGX,gBAAgB;QAC7C,MAAM,CAACjC,MAAM,CAACsD,iBAAiB,CAAC,EAAEI,UAAU,EAAE1D,MAAM,CAACuD,aAAa,CAAC,CAAC;QACpE;MACF;MAEA,MAAMI,iBAAiB,GAAGP,MAAM;MAIhC,MAAMQ,0BAA0B,GAAGvE,MAAM,CAACwE,MAAM,CAACC,qBAAqB,CAAC,CAAC,GAAGvE,kBAAkB;MAK7F,MAAMwE,gBAAgB,GAAG3B,KAAK,CAACA,KAAK,CAACxB,MAAM,GAAG,CAAC,CAAC;MAChD,IACEmD,gBAAgB,KAAKC,SAAS,IAC9BD,gBAAgB,CAAC5C,KAAK,CAAC,CAAC,IAAImB,SAAS,CAACnB,KAAK,CAAC,CAAC,GAAG,CAAC,IACjDwC,iBAAiB,GAAGI,gBAAgB,CAACzC,UAAU,CAAC,CAAC,GAAGsC,0BAA0B,EAC9E;QACAtE,MAAM,CAAC+C,KAAK,CACT,oDAAmD0B,gBAAiB,oBAAmBA,gBAAgB,CAACzC,UAAU,CAAC,CAAE,OAAMqC,iBAAkB,EAChJ,CAAC;QACDI,gBAAgB,CAACxC,gBAAgB,CAACvB,MAAM,CAAC2D,iBAAiB,CAAC,CAAC;QAC5D;MACF;MAEA,MAAMM,YAAuB,GAAG,CAAC,MAAM;QACrC,MAAM9C,KAAK,GAAGmB,SAAS,CAACnB,KAAK,CAAC,CAAC,GAAG,CAAC;QACnC,MAAMgB,KAAuB,GAAG,CAACnC,MAAM,CAAC2D,iBAAiB,CAAC,EAAE3D,MAAM,CAAC2D,iBAAiB,CAAC,GAAG,CAAC,CAAC;QAC1F,OAAO,IAAI3C,SAAS,CAACmB,KAAK,EAAEhB,KAAK,CAAC;MACpC,CAAC,EAAE,CAAC;MAGJ,IAAI4C,gBAAgB,KAAKC,SAAS,IAAID,gBAAgB,CAAC5C,KAAK,CAAC,CAAC,IAAI8C,YAAY,CAAC9C,KAAK,CAAC,CAAC,EAAE;QACtF7B,MAAM,CAAC0C,IAAI,CACR,kEAAiE2B,iBAAkB,qCAAoCI,gBAAiB,EAC3I,CAAC;MACH,CAAC,MAAM;QACLzE,MAAM,CAAC0C,IAAI,CACR,yBAAwBiC,YAAa,sCAAqCF,gBAAiB,oDAC9F,CAAC;MACH;MAEA3B,KAAK,CAAC7B,IAAI,CAAC0D,YAAY,CAAC;IAC1B;EACF;AACF"}
|
|
1
|
+
{"version":3,"file":"packedrtree.js","names":["Config","Logger","NODE_ITEM_BYTE_LEN","NODE_ITEM_LEN","DEFAULT_NODE_SIZE","calcTreeSize","numItems","nodeSize","Math","min","max","Number","n","numNodes","ceil","generateLevelBounds","Error","levelNumNodes","push","levelOffsets","size","levelBounds","i","length","streamSearch","rect","readNode","NodeRange","constructor","nodes","level","_level","startNodeIdx","endNodeIdx","extendEndNodeIdx","newIdx","console","assert","toString","minX","minY","maxX","maxY","info","firstLeafNodeIdx","rootNodeRange","range","queue","debug","nodeRange","shift","nodeRangeStartIdx","isLeafNode","nodeRangeEndIdx","levelBound","nodeIdx","numNodesInRange","buffer","dataView","DataView","nodeIdxInDataView","dataViewByteStart","getFloat64","offset","getBigUint64","featureByteOffset","featureLength","nextPos","nextOffset","featureIdx","firstChildNodeIdx","extraRequestThresholdNodes","global","extraRequestThreshold","nearestNodeRange","undefined","newNodeRange"],"sources":["../../../src/flatgeobuf/3.27.2/packedrtree.ts"],"sourcesContent":["import Config from './config';\nimport Logger from './logger';\n\nexport const NODE_ITEM_BYTE_LEN: number = 8 * 4 + 8;\n/**\n * @deprecated Use `NODE_ITEM_BYTE_LEN` instead.\n */\nexport const NODE_ITEM_LEN = NODE_ITEM_BYTE_LEN;\n\n// default branching factor of a node in the rtree\n//\n// actual value will be specified in the header but\n// this can be useful for having reasonably sized guesses for fetch-sizes when\n// streaming results\nexport const DEFAULT_NODE_SIZE = 16;\n\nexport interface Rect {\n minX: number;\n minY: number;\n maxX: number;\n maxY: number;\n}\n\nexport function calcTreeSize(numItems: number, nodeSize: number): number {\n nodeSize = Math.min(Math.max(Number(nodeSize), 2), 65535);\n let n = numItems;\n let numNodes = n;\n do {\n n = Math.ceil(n / nodeSize);\n numNodes += n;\n } while (n !== 1);\n return numNodes * NODE_ITEM_BYTE_LEN;\n}\n\n/**\n * returns [levelOffset, numNodes] for each level\n */\nexport function generateLevelBounds(numItems: number, nodeSize: number): Array<[number, number]> {\n if (nodeSize < 2) throw new Error('Node size must be at least 2');\n if (numItems === 0) throw new Error('Number of items must be greater than 0');\n\n // number of nodes per level in bottom-up order\n let n = numItems;\n let numNodes = n;\n const levelNumNodes = [n];\n do {\n n = Math.ceil(n / nodeSize);\n numNodes += n;\n levelNumNodes.push(n);\n } while (n !== 1);\n\n // bounds per level in reversed storage order (top-down)\n const levelOffsets: Array<number> = [];\n n = numNodes;\n for (const size of levelNumNodes) {\n levelOffsets.push(n - size);\n n -= size;\n }\n const levelBounds: Array<[number, number]> = [];\n for (let i = 0; i < levelNumNodes.length; i++)\n levelBounds.push([levelOffsets[i], levelOffsets[i] + levelNumNodes[i]]);\n return levelBounds;\n}\n\ntype ReadNodeFn = (treeOffset: number, size: number) => Promise<ArrayBuffer>;\n\n/**\n * A feature found to be within the bounding box `rect`\n *\n * (offset, index)\n * `offset`: Byte offset in feature data section\n * `index`: feature number\n * `featureLength`: featureLength, except for the last element\n */\nexport type SearchResult = [number, number, number | null];\n\n/**\n * Yield's a `SearchResult` for each feature within the bounds of `rect`.\n *\n * Every node in the FGB index tree has a bounding rect, all of the nodes children\n * are contained within that bounding rect. The leaf nodes of the tree represent\n * the features of the collection.\n *\n * As we traverse the tree, starting from the root, we'll need to read more data\n * from the index. When we don't already have this range data buffered locally,\n * an HTTP fetch is triggered. For performance, we merge adjacent and nearby\n * request ranges into a single request, reasoning that fetching a few extra\n * bytes is a good tradeoff if it means we can reduce the number of requests.\n */\nexport async function* streamSearch(\n numItems: number,\n nodeSize: number,\n rect: Rect,\n readNode: ReadNodeFn\n): AsyncGenerator<SearchResult, void, unknown> {\n type NodeIdx = number;\n class NodeRange {\n _level: number;\n nodes: [NodeIdx, NodeIdx];\n constructor(nodes: [NodeIdx, NodeIdx], level: number) {\n this._level = level;\n this.nodes = nodes;\n }\n\n level(): number {\n return this._level;\n }\n\n startNodeIdx(): NodeIdx {\n return this.nodes[0];\n }\n\n endNodeIdx(): NodeIdx {\n return this.nodes[1];\n }\n\n extendEndNodeIdx(newIdx: number) {\n console.assert(newIdx > this.nodes[1]);\n this.nodes[1] = newIdx;\n }\n\n toString(): string {\n return `[NodeRange level: ${this._level}, nodes: ${this.nodes[0]}-${this.nodes[1]}]`;\n }\n }\n\n const {minX, minY, maxX, maxY} = rect;\n Logger.info(`tree items: ${numItems}, nodeSize: ${nodeSize}`);\n const levelBounds = generateLevelBounds(numItems, nodeSize);\n const firstLeafNodeIdx = levelBounds[0][0];\n\n const rootNodeRange: NodeRange = (() => {\n const range: [number, number] = [0, 1];\n const level = levelBounds.length - 1;\n return new NodeRange(range, level);\n })();\n\n const queue: Array<NodeRange> = [rootNodeRange];\n\n Logger.debug(\n `starting stream search with queue: ${queue}, numItems: ${numItems}, nodeSize: ${nodeSize}, levelBounds: ${levelBounds}`\n );\n\n while (queue.length != 0) {\n // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n const nodeRange = queue.shift()!;\n\n Logger.debug(`popped node: ${nodeRange}, queueLength: ${queue.length}`);\n\n const nodeRangeStartIdx = nodeRange.startNodeIdx();\n const isLeafNode = nodeRangeStartIdx >= firstLeafNodeIdx;\n\n // find the end index of the node\n const nodeRangeEndIdx = (() => {\n const [, levelBound] = levelBounds[nodeRange.level()];\n const nodeIdx = Math.min(nodeRange.endNodeIdx() + nodeSize, levelBound);\n\n if (isLeafNode && nodeIdx < levelBound) {\n // We can infer the length of *this* feature by getting the start of the *next*\n // feature, so we get an extra node.\n // This approach doesn't work for the final node in the index,\n // but in that case we know that the feature runs to the end of the FGB file and\n // could make an open ended range request to get \"the rest of the data\".\n return nodeIdx + 1;\n }\n return nodeIdx;\n })();\n\n const numNodesInRange = nodeRangeEndIdx - nodeRangeStartIdx;\n\n const buffer = await readNode(\n nodeRangeStartIdx * NODE_ITEM_BYTE_LEN,\n numNodesInRange * NODE_ITEM_BYTE_LEN\n );\n\n const dataView = new DataView(buffer);\n for (let nodeIdx = nodeRangeStartIdx; nodeIdx < nodeRangeEndIdx; nodeIdx++) {\n const nodeIdxInDataView = nodeIdx - nodeRangeStartIdx;\n const dataViewByteStart = nodeIdxInDataView * NODE_ITEM_BYTE_LEN;\n if (maxX < dataView.getFloat64(dataViewByteStart + 0, true)) continue; // maxX < nodeMinX\n if (maxY < dataView.getFloat64(dataViewByteStart + 8, true)) continue; // maxY < nodeMinY\n if (minX > dataView.getFloat64(dataViewByteStart + 16, true)) continue; // minX > nodeMaxX\n if (minY > dataView.getFloat64(dataViewByteStart + 24, true)) continue; // minY > nodeMaxY\n\n // `offset` is:\n // For leaf nodes: the byte-offset into the feature buffer.\n // For inner nodes: the node-idx of its first child.\n const offset = dataView.getBigUint64(dataViewByteStart + 32, true);\n\n if (isLeafNode) {\n const featureByteOffset = offset;\n const featureLength = (() => {\n if (nodeIdx < numItems - 1) {\n // Since features are tightly packed, we infer the\n // length of _this_ feature by measuring to the _next_\n // feature's start.\n const nextPos = (nodeIdxInDataView + 1) * NODE_ITEM_BYTE_LEN;\n // console.debug(`nodeIdx: ${nodeIdx} of ${numItems}, nodeRangeStartIdx: ${nodeRangeStartIdx}, nextPos: ${nextPos}, dataView.byteLength: ${dataView.byteLength}`,);\n const nextOffset = dataView.getBigUint64(nextPos + 32, true);\n return nextOffset - featureByteOffset;\n }\n // This is the last feature - there's no \"next\" feature\n // to measure to, so we can't know it's length.\n return null;\n })();\n\n // Logger.debug(`featureByteOffset: ${featureByteOffset}, nodeIdx: ${nodeIdx}, featureLength: ${featureLength}`);\n const featureIdx = nodeIdx - firstLeafNodeIdx;\n yield [Number(featureByteOffset), featureIdx, Number(featureLength)];\n continue;\n }\n\n const firstChildNodeIdx = offset;\n\n // request up to this many nodes if it means we can eliminate an\n // extra request\n const extraRequestThresholdNodes = Config.global.extraRequestThreshold() / NODE_ITEM_BYTE_LEN;\n\n // Since we're traversing the tree by monotonically increasing byte\n // offset, the most recently enqueued node range will be the\n // nearest, and thus presents the best candidate for merging.\n const nearestNodeRange = queue[queue.length - 1];\n if (\n nearestNodeRange !== undefined &&\n nearestNodeRange.level() == nodeRange.level() - 1 &&\n firstChildNodeIdx < nearestNodeRange.endNodeIdx() + extraRequestThresholdNodes\n ) {\n Logger.debug(\n `Merging \"nodeRange\" request into existing range: ${nearestNodeRange}, newEndNodeIdx: ${nearestNodeRange.endNodeIdx()} -> ${firstChildNodeIdx}`\n );\n nearestNodeRange.extendEndNodeIdx(Number(firstChildNodeIdx));\n continue;\n }\n\n const newNodeRange: NodeRange = (() => {\n const level = nodeRange.level() - 1;\n const range: [number, number] = [Number(firstChildNodeIdx), Number(firstChildNodeIdx) + 1];\n return new NodeRange(range, level);\n })();\n\n // We're going to add a new node range - log the reason\n if (nearestNodeRange !== undefined && nearestNodeRange.level() == newNodeRange.level()) {\n Logger.info(\n `Same level, but too far away. Pushing new request for nodeIdx: ${firstChildNodeIdx} rather than merging with distant ${nearestNodeRange}`\n );\n } else {\n Logger.info(\n `Pushing new level for ${newNodeRange} onto queue with nearestNodeRange: ${nearestNodeRange} since there's not already a range for this level.`\n );\n }\n\n queue.push(newNodeRange);\n }\n }\n}\n"],"mappings":"OAAOA,MAAM;AAAA,OACNC,MAAM;AAEb,OAAO,MAAMC,kBAA0B,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;AAInD,OAAO,MAAMC,aAAa,GAAGD,kBAAkB;AAO/C,OAAO,MAAME,iBAAiB,GAAG,EAAE;AASnC,OAAO,SAASC,YAAYA,CAACC,QAAgB,EAAEC,QAAgB,EAAU;EACvEA,QAAQ,GAAGC,IAAI,CAACC,GAAG,CAACD,IAAI,CAACE,GAAG,CAACC,MAAM,CAACJ,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC;EACzD,IAAIK,CAAC,GAAGN,QAAQ;EAChB,IAAIO,QAAQ,GAAGD,CAAC;EAChB,GAAG;IACDA,CAAC,GAAGJ,IAAI,CAACM,IAAI,CAACF,CAAC,GAAGL,QAAQ,CAAC;IAC3BM,QAAQ,IAAID,CAAC;EACf,CAAC,QAAQA,CAAC,KAAK,CAAC;EAChB,OAAOC,QAAQ,GAAGX,kBAAkB;AACtC;AAKA,OAAO,SAASa,mBAAmBA,CAACT,QAAgB,EAAEC,QAAgB,EAA2B;EAC/F,IAAIA,QAAQ,GAAG,CAAC,EAAE,MAAM,IAAIS,KAAK,CAAC,8BAA8B,CAAC;EACjE,IAAIV,QAAQ,KAAK,CAAC,EAAE,MAAM,IAAIU,KAAK,CAAC,wCAAwC,CAAC;EAG7E,IAAIJ,CAAC,GAAGN,QAAQ;EAChB,IAAIO,QAAQ,GAAGD,CAAC;EAChB,MAAMK,aAAa,GAAG,CAACL,CAAC,CAAC;EACzB,GAAG;IACDA,CAAC,GAAGJ,IAAI,CAACM,IAAI,CAACF,CAAC,GAAGL,QAAQ,CAAC;IAC3BM,QAAQ,IAAID,CAAC;IACbK,aAAa,CAACC,IAAI,CAACN,CAAC,CAAC;EACvB,CAAC,QAAQA,CAAC,KAAK,CAAC;EAGhB,MAAMO,YAA2B,GAAG,EAAE;EACtCP,CAAC,GAAGC,QAAQ;EACZ,KAAK,MAAMO,IAAI,IAAIH,aAAa,EAAE;IAChCE,YAAY,CAACD,IAAI,CAACN,CAAC,GAAGQ,IAAI,CAAC;IAC3BR,CAAC,IAAIQ,IAAI;EACX;EACA,MAAMC,WAAoC,GAAG,EAAE;EAC/C,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGL,aAAa,CAACM,MAAM,EAAED,CAAC,EAAE,EAC3CD,WAAW,CAACH,IAAI,CAAC,CAACC,YAAY,CAACG,CAAC,CAAC,EAAEH,YAAY,CAACG,CAAC,CAAC,GAAGL,aAAa,CAACK,CAAC,CAAC,CAAC,CAAC;EACzE,OAAOD,WAAW;AACpB;AA2BA,OAAO,gBAAgBG,YAAYA,CACjClB,QAAgB,EAChBC,QAAgB,EAChBkB,IAAU,EACVC,QAAoB,EACyB;EAE7C,MAAMC,SAAS,CAAC;IAGdC,WAAWA,CAACC,KAAyB,EAAEC,KAAa,EAAE;MAAA,KAFtDC,MAAM;MAAA,KACNF,KAAK;MAEH,IAAI,CAACE,MAAM,GAAGD,KAAK;MACnB,IAAI,CAACD,KAAK,GAAGA,KAAK;IACpB;IAEAC,KAAKA,CAAA,EAAW;MACd,OAAO,IAAI,CAACC,MAAM;IACpB;IAEAC,YAAYA,CAAA,EAAY;MACtB,OAAO,IAAI,CAACH,KAAK,CAAC,CAAC,CAAC;IACtB;IAEAI,UAAUA,CAAA,EAAY;MACpB,OAAO,IAAI,CAACJ,KAAK,CAAC,CAAC,CAAC;IACtB;IAEAK,gBAAgBA,CAACC,MAAc,EAAE;MAC/BC,OAAO,CAACC,MAAM,CAACF,MAAM,GAAG,IAAI,CAACN,KAAK,CAAC,CAAC,CAAC,CAAC;MACtC,IAAI,CAACA,KAAK,CAAC,CAAC,CAAC,GAAGM,MAAM;IACxB;IAEAG,QAAQA,CAAA,EAAW;MACjB,OAAQ,qBAAoB,IAAI,CAACP,MAAO,YAAW,IAAI,CAACF,KAAK,CAAC,CAAC,CAAE,IAAG,IAAI,CAACA,KAAK,CAAC,CAAC,CAAE,GAAE;IACtF;EACF;EAEA,MAAM;IAACU,IAAI;IAAEC,IAAI;IAAEC,IAAI;IAAEC;EAAI,CAAC,GAAGjB,IAAI;EACrCxB,MAAM,CAAC0C,IAAI,CAAE,eAAcrC,QAAS,eAAcC,QAAS,EAAC,CAAC;EAC7D,MAAMc,WAAW,GAAGN,mBAAmB,CAACT,QAAQ,EAAEC,QAAQ,CAAC;EAC3D,MAAMqC,gBAAgB,GAAGvB,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;EAE1C,MAAMwB,aAAwB,GAAG,CAAC,MAAM;IACtC,MAAMC,KAAuB,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IACtC,MAAMhB,KAAK,GAAGT,WAAW,CAACE,MAAM,GAAG,CAAC;IACpC,OAAO,IAAII,SAAS,CAACmB,KAAK,EAAEhB,KAAK,CAAC;EACpC,CAAC,EAAE,CAAC;EAEJ,MAAMiB,KAAuB,GAAG,CAACF,aAAa,CAAC;EAE/C5C,MAAM,CAAC+C,KAAK,CACT,sCAAqCD,KAAM,eAAczC,QAAS,eAAcC,QAAS,kBAAiBc,WAAY,EACzH,CAAC;EAED,OAAO0B,KAAK,CAACxB,MAAM,IAAI,CAAC,EAAE;IAExB,MAAM0B,SAAS,GAAGF,KAAK,CAACG,KAAK,CAAC,CAAE;IAEhCjD,MAAM,CAAC+C,KAAK,CAAE,gBAAeC,SAAU,kBAAiBF,KAAK,CAACxB,MAAO,EAAC,CAAC;IAEvE,MAAM4B,iBAAiB,GAAGF,SAAS,CAACjB,YAAY,CAAC,CAAC;IAClD,MAAMoB,UAAU,GAAGD,iBAAiB,IAAIP,gBAAgB;IAGxD,MAAMS,eAAe,GAAG,CAAC,MAAM;MAC7B,MAAM,GAAGC,UAAU,CAAC,GAAGjC,WAAW,CAAC4B,SAAS,CAACnB,KAAK,CAAC,CAAC,CAAC;MACrD,MAAMyB,OAAO,GAAG/C,IAAI,CAACC,GAAG,CAACwC,SAAS,CAAChB,UAAU,CAAC,CAAC,GAAG1B,QAAQ,EAAE+C,UAAU,CAAC;MAEvE,IAAIF,UAAU,IAAIG,OAAO,GAAGD,UAAU,EAAE;QAMtC,OAAOC,OAAO,GAAG,CAAC;MACpB;MACA,OAAOA,OAAO;IAChB,CAAC,EAAE,CAAC;IAEJ,MAAMC,eAAe,GAAGH,eAAe,GAAGF,iBAAiB;IAE3D,MAAMM,MAAM,GAAG,MAAM/B,QAAQ,CAC3ByB,iBAAiB,GAAGjD,kBAAkB,EACtCsD,eAAe,GAAGtD,kBACpB,CAAC;IAED,MAAMwD,QAAQ,GAAG,IAAIC,QAAQ,CAACF,MAAM,CAAC;IACrC,KAAK,IAAIF,OAAO,GAAGJ,iBAAiB,EAAEI,OAAO,GAAGF,eAAe,EAAEE,OAAO,EAAE,EAAE;MAC1E,MAAMK,iBAAiB,GAAGL,OAAO,GAAGJ,iBAAiB;MACrD,MAAMU,iBAAiB,GAAGD,iBAAiB,GAAG1D,kBAAkB;MAChE,IAAIuC,IAAI,GAAGiB,QAAQ,CAACI,UAAU,CAACD,iBAAiB,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE;MAC7D,IAAInB,IAAI,GAAGgB,QAAQ,CAACI,UAAU,CAACD,iBAAiB,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE;MAC7D,IAAItB,IAAI,GAAGmB,QAAQ,CAACI,UAAU,CAACD,iBAAiB,GAAG,EAAE,EAAE,IAAI,CAAC,EAAE;MAC9D,IAAIrB,IAAI,GAAGkB,QAAQ,CAACI,UAAU,CAACD,iBAAiB,GAAG,EAAE,EAAE,IAAI,CAAC,EAAE;MAK9D,MAAME,MAAM,GAAGL,QAAQ,CAACM,YAAY,CAACH,iBAAiB,GAAG,EAAE,EAAE,IAAI,CAAC;MAElE,IAAIT,UAAU,EAAE;QACd,MAAMa,iBAAiB,GAAGF,MAAM;QAChC,MAAMG,aAAa,GAAG,CAAC,MAAM;UAC3B,IAAIX,OAAO,GAAGjD,QAAQ,GAAG,CAAC,EAAE;YAI1B,MAAM6D,OAAO,GAAG,CAACP,iBAAiB,GAAG,CAAC,IAAI1D,kBAAkB;YAE5D,MAAMkE,UAAU,GAAGV,QAAQ,CAACM,YAAY,CAACG,OAAO,GAAG,EAAE,EAAE,IAAI,CAAC;YAC5D,OAAOC,UAAU,GAAGH,iBAAiB;UACvC;UAGA,OAAO,IAAI;QACb,CAAC,EAAE,CAAC;QAGJ,MAAMI,UAAU,GAAGd,OAAO,GAAGX,gBAAgB;QAC7C,MAAM,CAACjC,MAAM,CAACsD,iBAAiB,CAAC,EAAEI,UAAU,EAAE1D,MAAM,CAACuD,aAAa,CAAC,CAAC;QACpE;MACF;MAEA,MAAMI,iBAAiB,GAAGP,MAAM;MAIhC,MAAMQ,0BAA0B,GAAGvE,MAAM,CAACwE,MAAM,CAACC,qBAAqB,CAAC,CAAC,GAAGvE,kBAAkB;MAK7F,MAAMwE,gBAAgB,GAAG3B,KAAK,CAACA,KAAK,CAACxB,MAAM,GAAG,CAAC,CAAC;MAChD,IACEmD,gBAAgB,KAAKC,SAAS,IAC9BD,gBAAgB,CAAC5C,KAAK,CAAC,CAAC,IAAImB,SAAS,CAACnB,KAAK,CAAC,CAAC,GAAG,CAAC,IACjDwC,iBAAiB,GAAGI,gBAAgB,CAACzC,UAAU,CAAC,CAAC,GAAGsC,0BAA0B,EAC9E;QACAtE,MAAM,CAAC+C,KAAK,CACT,oDAAmD0B,gBAAiB,oBAAmBA,gBAAgB,CAACzC,UAAU,CAAC,CAAE,OAAMqC,iBAAkB,EAChJ,CAAC;QACDI,gBAAgB,CAACxC,gBAAgB,CAACvB,MAAM,CAAC2D,iBAAiB,CAAC,CAAC;QAC5D;MACF;MAEA,MAAMM,YAAuB,GAAG,CAAC,MAAM;QACrC,MAAM9C,KAAK,GAAGmB,SAAS,CAACnB,KAAK,CAAC,CAAC,GAAG,CAAC;QACnC,MAAMgB,KAAuB,GAAG,CAACnC,MAAM,CAAC2D,iBAAiB,CAAC,EAAE3D,MAAM,CAAC2D,iBAAiB,CAAC,GAAG,CAAC,CAAC;QAC1F,OAAO,IAAI3C,SAAS,CAACmB,KAAK,EAAEhB,KAAK,CAAC;MACpC,CAAC,EAAE,CAAC;MAGJ,IAAI4C,gBAAgB,KAAKC,SAAS,IAAID,gBAAgB,CAAC5C,KAAK,CAAC,CAAC,IAAI8C,YAAY,CAAC9C,KAAK,CAAC,CAAC,EAAE;QACtF7B,MAAM,CAAC0C,IAAI,CACR,kEAAiE2B,iBAAkB,qCAAoCI,gBAAiB,EAC3I,CAAC;MACH,CAAC,MAAM;QACLzE,MAAM,CAAC0C,IAAI,CACR,yBAAwBiC,YAAa,sCAAqCF,gBAAiB,oDAC9F,CAAC;MACH;MAEA3B,KAAK,CAAC7B,IAAI,CAAC0D,YAAY,CAAC;IAC1B;EACF;AACF"}
|
|
@@ -1,5 +1,5 @@
|
|
|
1
1
|
import { parseFlatGeobuf, parseFlatGeobufInBatches } from "./lib/parse-flatgeobuf.js";
|
|
2
|
-
const VERSION = typeof "4.1.0
|
|
2
|
+
const VERSION = typeof "4.1.0" !== 'undefined' ? "4.1.0" : 'latest';
|
|
3
3
|
const FGB_MAGIC_NUMBER = [0x66, 0x67, 0x62, 0x03, 0x66, 0x67, 0x62, 0x01];
|
|
4
4
|
export const FlatGeobufWorkerLoader = {
|
|
5
5
|
id: 'flatgeobuf',
|