picovolt 0.3.0

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or Derivative
+          Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2026 PicoVolt Authors
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -0,0 +1,162 @@
+# PicoVolt (PVDB)
+
+[![CI](https://github.com/MiniJe/picovolt/actions/workflows/ci.yml/badge.svg)](https://github.com/MiniJe/picovolt/actions/workflows/ci.yml)
+[![Version](https://img.shields.io/badge/version-0.3.0-blue.svg)](CHANGELOG.md)
+[![License: Apache-2.0](https://img.shields.io/badge/license-Apache--2.0-blue.svg)](LICENSE)
+![Status: experimental](https://img.shields.io/badge/status-experimental-orange.svg)
+
+PicoVolt is an embedded database engine written from scratch in Rust. It is
+experimental software. It has not been audited or hardened for production, so use
+it to learn from and prototype with rather than to store data you cannot lose.
+
+The engine decouples query logic from storage representation through a
+Virtualization Layer Engine (VLE) that shifts between two on-disk shapes:
+
+- **Development mode:** a `.pv/` workspace of mutable, append-only chunk files
+  plus a content-addressed blob store, friendly to git and code review.
+- **Production mode:** a single contiguous, memory-mappable `.pvdb` file produced
+  by `pv_bake()`.
+
+Pages are chameleon. Hot data lands in a slotted row layout for O(1) appends, and
+idle pages can be transposed into a packed columnar layout for compression and
+cache efficiency.
+
+## Status
+
+The engine is built out across four phases, all implemented, with 103 unit and
+integration tests plus doctests passing and a clean `cargo clippy -D warnings` on
+Linux and Windows. Changes are tracked in [CHANGELOG.md](CHANGELOG.md).
+
+| Phase | Scope | Status |
+|-------|-------|--------|
+| 1 | Core memory layouts and error taxonomy | Done |
+| 2 | Page engine, CAS dedup, compression, VLE router | Done |
+| 3 | MVCC and snapshot isolation, WASM runtime | Done |
+| 4 | Public surface (`pv_open_dev` / `pv_open_prod` / `query` / `pv_bake`) | Done |
+
+### Module map
+
+| Module | Responsibility |
+|--------|----------------|
+| [`core/types.rs`](src/core/types.rs) | constants, ids, `PageType`, `RecordEnvelope`, page and file headers (explicit little-endian codecs) |
+| [`core/errors.rs`](src/core/errors.rs) | unified `PvError` and `ComplianceError` |
+| [`core/value.rs`](src/core/value.rs) | dynamically-typed `Value` and `Row` |
+| [`storage/page.rs`](src/storage/page.rs) | slotted row page (O(1) append), chain links, columnar transposition |
+| [`storage/cache.rs`](src/storage/cache.rs) | bounded LRU buffer pool (enables larger-than-RAM reads) |
+| [`storage/cas.rs`](src/storage/cas.rs) | BLAKE3 content-addressable dedup (memory, dev-files, mmap) |
+| [`storage/compress.rs`](src/storage/compress.rs) | Delta-Z, LEB128 varints, dictionary bit-packing |
+| [`storage/index.rs`](src/storage/index.rs) | in-memory ordered secondary index (value to record addresses; point and range) |
+| [`storage/record.rs`](src/storage/record.rs) | row and record-body serialization with CAS interception |
+| [`storage/vle.rs`](src/storage/vle.rs) | dev directory store, prod mmap monolith, `bake` |
+| [`engine/mvcc.rs`](src/engine/mvcc.rs) | transaction clock and snapshot visibility |
+| [`engine/wasm.rs`](src/engine/wasm.rs) | sandboxed `wasmi` extension runtime and the `WasmExec` backend trait |
+| [`engine/interp.rs`](src/engine/interp.rs) | `pv-wasm`: a from-scratch WASM interpreter (integer subset) |
+| [`engine/query.rs`](src/engine/query.rs) | SQL front-end (CREATE/INSERT/UPDATE/DELETE/DROP, `SELECT` with projection and aggregates, `WHERE` predicates, `BEFORE`, `ORDER BY`, `LIMIT`) |
+| [`engine/compliance.rs`](src/engine/compliance.rs) | optional, app-driven usage-policy hook (not a license requirement) |
+| [`db.rs`](src/db.rs) | the `Database` surface that ties it together |
+
+### Engineering notes
+
+- **Explicit little-endian codecs** for every on-disk structure, instead of
+  casting `#[repr(C)]` structs, so the file format stays portable and its byte
+  offsets are exact.
+- **Two interchangeable WASM backends.** The default is the `wasmi` interpreter
+  (vetted, full WASM). Alongside it, `pv-wasm`
+  ([`engine/interp.rs`](src/engine/interp.rs)) is a from-scratch interpreter: a
+  hand-written binary decoder and structured-control stack machine covering the
+  `i32` and `i64` integer subset. Both implement the `WasmExec` trait, and a
+  differential test checks `pv-wasm` against `wasmi` to keep it honest. Floats,
+  tables, globals, imports, SIMD, and `br_table` are out of scope for `pv-wasm`
+  and are rejected rather than mis-run.
+- **Page-backed engine.** Tables are append-only chains of row pages, each header
+  linking to the next. Inserts append to a tail page and write only that page
+  plus an O(tables) manifest, so autocommit is O(1) per insert rather than a
+  whole-table rewrite. Reads stream through a bounded buffer pool
+  ([`storage/cache.rs`](src/storage/cache.rs)), so datasets need not fit in RAM,
+  and opt-in ordered indexes ([`storage/index.rs`](src/storage/index.rs)) turn
+  `WHERE col = value` into a point lookup and range comparisons such as
+  `WHERE col > v` into an ordered scan rather than a full scan.
+- **Selectable durability.** `Database::set_durability(Durability::Sync)` makes
+  each flush `fsync` the data and commit the manifest atomically (write to a temp
+  file, `fsync`, then rename). The default `Fast` mode uses the OS cache only:
+  fast and durable on a clean exit, but not power-loss-safe.
+- **Hardened against untrusted input.** Opening a `.pvdb` or workspace, or running
+  a WASM module, validates manifest hashes (no path traversal), bounds-checks CAS
+  offsets and page chains (no out-of-bounds reads or infinite loops on a crafted
+  file), and caps WASM resource counts. The decoders are fuzzed (a cross-platform
+  fuzz-lite test and a [`fuzz/`](fuzz) cargo-fuzz crate), and `cargo audit`
+  reports no advisories. Both run in CI. See [SECURITY.md](SECURITY.md).
+
+## Build
+
+```sh
+cargo build
+cargo test
+```
+
+## Examples and benchmarks
+
+```sh
+cargo run --release --example notes    # a small notes app: CRUD, edit history,
+                                       # time-travel, CAS dedup, publish (bake)
+cargo run --release --example repl     # interactive SQL shell (pvsql)
+cargo run --release --example bench    # evaluation harness across modes and workloads
+```
+
+SQL supported: `CREATE TABLE`, `CREATE INDEX ON t (col)`, `INSERT`,
+`UPDATE ... SET ... WHERE`, `DELETE ... WHERE`, `DROP TABLE`, and
+`SELECT {* | col, ... | COUNT/SUM/MIN/MAX/AVG(...)} FROM t [WHERE <pred>]
+[GROUP BY cols] [BEFORE tx] [ORDER BY col [ASC|DESC]] [LIMIT n]`, where `<pred>`
+combines `col <op> value` (`=`, `!=`, `<`, `<=`, `>`, `>=`, `LIKE`) with `AND`,
+`OR`, and parentheses.
+Durability is selectable via `Database::set_durability` (`Fast` OS-cache default,
+or crash-safe `Sync` with fsync and an atomic manifest).
+
+Measured results and the methodology are in [BENCHMARKS.md](BENCHMARKS.md). In
+short, PicoVolt is a page-backed engine with O(1) durable appends (autocommit
+around 33k rows/s, linear), larger-than-RAM reads through a bounded buffer pool (a
+667-page dataset serves from a 16-page pool), ordered secondary indexes (point
+lookups roughly 11,000 times faster than a scan, plus range predicates), MVCC
+time-travel, opt-in crash-safe durability (`Durability::Sync`), and a fast
+compile-and-publish path (CAS dedup, columnar compression, single-file mmap
+artifacts). Current limits: indexes are in-memory (rebuilt on open) and there is
+no concurrency.
+
+## Install and distribution
+
+| Target | How |
+|--------|-----|
+| **Rust** (crates.io) | `cargo add picovolt` (once published) |
+| **JavaScript / npm** (WebAssembly, browser and Node) | `wasm-pack build --target bundler --release -- --features wasm` |
+| **In-memory** (native, no filesystem) | `Database::open_memory()`, export with `bake_to_bytes()` |
+
+PicoVolt runs in the browser through its in-memory backend. Build the WebAssembly
+package with the command above, then `import { Db } from "picovolt"` and run SQL
+with `db.query(...)`. See [src/wasm_api.rs](src/wasm_api.rs) for the JavaScript
+surface.
+
+## Extending PicoVolt
+
+There are two extension paths: sandboxed WebAssembly user-defined functions, and
+native modules built on the public API. Both are documented in
+[docs/EXTENDING.md](docs/EXTENDING.md).
+
+## Project
+
+| | |
+|--|--|
+| Roadmap | [ROADMAP.md](ROADMAP.md) |
+| Contributing | [CONTRIBUTING.md](CONTRIBUTING.md) |
+| Code of conduct | [CODE_OF_CONDUCT.md](CODE_OF_CONDUCT.md) |
+| Changelog | [CHANGELOG.md](CHANGELOG.md) |
+| Security policy | [SECURITY.md](SECURITY.md) |
+
+## License
+
+Licensed under the [Apache License, Version 2.0](LICENSE). Third-party
+dependencies are under MIT or Apache-2.0 licenses, and their notices apply to
+redistributions (see [`NOTICE`](NOTICE)).
+
+The optional [`compliance`](src/engine/compliance.rs) module is not a license
+requirement. It is an opt-in helper for applications that want to enforce their
+own usage policy. Apache-2.0 places no usage restrictions on PicoVolt itself.

package/package.json

@@ -0,0 +1,30 @@
+{
+  "name": "picovolt",
+  "type": "module",
+  "description": "PicoVolt (PVDB): a polymorphic embedded database engine in Rust.",
+  "version": "0.3.0",
+  "license": "Apache-2.0",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/MiniJe/picovolt"
+  },
+  "files": [
+    "picovolt_bg.wasm",
+    "picovolt.js",
+    "picovolt_bg.js",
+    "picovolt.d.ts"
+  ],
+  "main": "picovolt.js",
+  "types": "picovolt.d.ts",
+  "sideEffects": [
+    "./picovolt.js",
+    "./snippets/*"
+  ],
+  "keywords": [
+    "database",
+    "embedded",
+    "storage-engine",
+    "mvcc",
+    "columnar"
+  ]
+}

package/picovolt.d.ts

@@ -0,0 +1,35 @@
+/* tslint:disable */
+/* eslint-disable */
+
+/**
+ * An in-memory PicoVolt database usable from JavaScript.
+ */
+export class Db {
+    free(): void;
+    [Symbol.dispose](): void;
+    /**
+     * The most recently committed transaction id, the upper bound for a
+     * `... BEFORE tx` time-travel query.
+     */
+    currentTx(): number;
+    /**
+     * Export the whole database as a `.pvdb` byte image (a `Uint8Array` in JS).
+     */
+    export(): Uint8Array;
+    /**
+     * Load a database from a `.pvdb` byte image (e.g. one produced by
+     * [`export`](Db::export)). Writable, with full time-travel history intact.
+     */
+    static fromBytes(bytes: Uint8Array): Db;
+    /**
+     * Create a new, empty in-memory database.
+     */
+    constructor();
+    /**
+     * Run one SQL statement. Returns a **JSON string** (call `JSON.parse` in JS):
+     * `{"columns":[...],"rows":[[...]]}` for `SELECT`, `{"mutated":n}` for
+     * `INSERT`/`UPDATE`/`DELETE`, or `{"done":true}` otherwise. Throws the error
+     * message (a string) on failure.
+     */
+    query(sql: string): string;
+}

package/picovolt.js

@@ -0,0 +1,9 @@
+/* @ts-self-types="./picovolt.d.ts" */
+import * as wasm from "./picovolt_bg.wasm";
+import { __wbg_set_wasm } from "./picovolt_bg.js";
+
+__wbg_set_wasm(wasm);
+wasm.__wbindgen_start();
+export {
+    Db
+} from "./picovolt_bg.js";

package/picovolt_bg.js

@@ -0,0 +1,248 @@
+/**
+ * An in-memory PicoVolt database usable from JavaScript.
+ */
+export class Db {
+    static __wrap(ptr) {
+        const obj = Object.create(Db.prototype);
+        obj.__wbg_ptr = ptr;
+        DbFinalization.register(obj, obj.__wbg_ptr, obj);
+        return obj;
+    }
+    __destroy_into_raw() {
+        const ptr = this.__wbg_ptr;
+        this.__wbg_ptr = 0;
+        DbFinalization.unregister(this);
+        return ptr;
+    }
+    free() {
+        const ptr = this.__destroy_into_raw();
+        wasm.__wbg_db_free(ptr, 0);
+    }
+    /**
+     * The most recently committed transaction id, the upper bound for a
+     * `... BEFORE tx` time-travel query.
+     * @returns {number}
+     */
+    currentTx() {
+        const ret = wasm.db_currentTx(this.__wbg_ptr);
+        return ret >>> 0;
+    }
+    /**
+     * Export the whole database as a `.pvdb` byte image (a `Uint8Array` in JS).
+     * @returns {Uint8Array}
+     */
+    export() {
+        const ret = wasm.db_export(this.__wbg_ptr);
+        if (ret[3]) {
+            throw takeFromExternrefTable0(ret[2]);
+        }
+        var v1 = getArrayU8FromWasm0(ret[0], ret[1]).slice();
+        wasm.__wbindgen_free(ret[0], ret[1] * 1, 1);
+        return v1;
+    }
+    /**
+     * Load a database from a `.pvdb` byte image (e.g. one produced by
+     * [`export`](Db::export)). Writable, with full time-travel history intact.
+     * @param {Uint8Array} bytes
+     * @returns {Db}
+     */
+    static fromBytes(bytes) {
+        const ptr0 = passArray8ToWasm0(bytes, wasm.__wbindgen_malloc);
+        const len0 = WASM_VECTOR_LEN;
+        const ret = wasm.db_fromBytes(ptr0, len0);
+        if (ret[2]) {
+            throw takeFromExternrefTable0(ret[1]);
+        }
+        return Db.__wrap(ret[0]);
+    }
+    /**
+     * Create a new, empty in-memory database.
+     */
+    constructor() {
+        const ret = wasm.db_new();
+        this.__wbg_ptr = ret;
+        DbFinalization.register(this, this.__wbg_ptr, this);
+        return this;
+    }
+    /**
+     * Run one SQL statement. Returns a **JSON string** (call `JSON.parse` in JS):
+     * `{"columns":[...],"rows":[[...]]}` for `SELECT`, `{"mutated":n}` for
+     * `INSERT`/`UPDATE`/`DELETE`, or `{"done":true}` otherwise. Throws the error
+     * message (a string) on failure.
+     * @param {string} sql
+     * @returns {string}
+     */
+    query(sql) {
+        let deferred3_0;
+        let deferred3_1;
+        try {
+            const ptr0 = passStringToWasm0(sql, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc);
+            const len0 = WASM_VECTOR_LEN;
+            const ret = wasm.db_query(this.__wbg_ptr, ptr0, len0);
+            var ptr2 = ret[0];
+            var len2 = ret[1];
+            if (ret[3]) {
+                ptr2 = 0; len2 = 0;
+                throw takeFromExternrefTable0(ret[2]);
+            }
+            deferred3_0 = ptr2;
+            deferred3_1 = len2;
+            return getStringFromWasm0(ptr2, len2);
+        } finally {
+            wasm.__wbindgen_free(deferred3_0, deferred3_1, 1);
+        }
+    }
+}
+if (Symbol.dispose) Db.prototype[Symbol.dispose] = Db.prototype.free;
+export function __wbg___wbindgen_throw_ea4887a5f8f9a9db(arg0, arg1) {
+    throw new Error(getStringFromWasm0(arg0, arg1));
+}
+export function __wbg_error_a6fa202b58aa1cd3(arg0, arg1) {
+    let deferred0_0;
+    let deferred0_1;
+    try {
+        deferred0_0 = arg0;
+        deferred0_1 = arg1;
+        console.error(getStringFromWasm0(arg0, arg1));
+    } finally {
+        wasm.__wbindgen_free(deferred0_0, deferred0_1, 1);
+    }
+}
+export function __wbg_new_227d7c05414eb861() {
+    const ret = new Error();
+    return ret;
+}
+export function __wbg_stack_3b0d974bbf31e44f(arg0, arg1) {
+    const ret = arg1.stack;
+    const ptr1 = passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc);
+    const len1 = WASM_VECTOR_LEN;
+    getDataViewMemory0().setInt32(arg0 + 4 * 1, len1, true);
+    getDataViewMemory0().setInt32(arg0 + 4 * 0, ptr1, true);
+}
+export function __wbindgen_cast_0000000000000001(arg0, arg1) {
+    // Cast intrinsic for `Ref(String) -> Externref`.
+    const ret = getStringFromWasm0(arg0, arg1);
+    return ret;
+}
+export function __wbindgen_init_externref_table() {
+    const table = wasm.__wbindgen_externrefs;
+    const offset = table.grow(4);
+    table.set(0, undefined);
+    table.set(offset + 0, undefined);
+    table.set(offset + 1, null);
+    table.set(offset + 2, true);
+    table.set(offset + 3, false);
+}
+const DbFinalization = (typeof FinalizationRegistry === 'undefined')
+    ? { register: () => {}, unregister: () => {} }
+    : new FinalizationRegistry(ptr => wasm.__wbg_db_free(ptr, 1));
+
+function getArrayU8FromWasm0(ptr, len) {
+    ptr = ptr >>> 0;
+    return getUint8ArrayMemory0().subarray(ptr / 1, ptr / 1 + len);
+}
+
+let cachedDataViewMemory0 = null;
+function getDataViewMemory0() {
+    if (cachedDataViewMemory0 === null || cachedDataViewMemory0.buffer.detached === true || (cachedDataViewMemory0.buffer.detached === undefined && cachedDataViewMemory0.buffer !== wasm.memory.buffer)) {
+        cachedDataViewMemory0 = new DataView(wasm.memory.buffer);
+    }
+    return cachedDataViewMemory0;
+}
+
+function getStringFromWasm0(ptr, len) {
+    return decodeText(ptr >>> 0, len);
+}
+
+let cachedUint8ArrayMemory0 = null;
+function getUint8ArrayMemory0() {
+    if (cachedUint8ArrayMemory0 === null || cachedUint8ArrayMemory0.byteLength === 0) {
+        cachedUint8ArrayMemory0 = new Uint8Array(wasm.memory.buffer);
+    }
+    return cachedUint8ArrayMemory0;
+}
+
+function passArray8ToWasm0(arg, malloc) {
+    const ptr = malloc(arg.length * 1, 1) >>> 0;
+    getUint8ArrayMemory0().set(arg, ptr / 1);
+    WASM_VECTOR_LEN = arg.length;
+    return ptr;
+}
+
+function passStringToWasm0(arg, malloc, realloc) {
+    if (realloc === undefined) {
+        const buf = cachedTextEncoder.encode(arg);
+        const ptr = malloc(buf.length, 1) >>> 0;
+        getUint8ArrayMemory0().subarray(ptr, ptr + buf.length).set(buf);
+        WASM_VECTOR_LEN = buf.length;
+        return ptr;
+    }
+
+    let len = arg.length;
+    let ptr = malloc(len, 1) >>> 0;
+
+    const mem = getUint8ArrayMemory0();
+
+    let offset = 0;
+
+    for (; offset < len; offset++) {
+        const code = arg.charCodeAt(offset);
+        if (code > 0x7F) break;
+        mem[ptr + offset] = code;
+    }
+    if (offset !== len) {
+        if (offset !== 0) {
+            arg = arg.slice(offset);
+        }
+        ptr = realloc(ptr, len, len = offset + arg.length * 3, 1) >>> 0;
+        const view = getUint8ArrayMemory0().subarray(ptr + offset, ptr + len);
+        const ret = cachedTextEncoder.encodeInto(arg, view);
+
+        offset += ret.written;
+        ptr = realloc(ptr, len, offset, 1) >>> 0;
+    }
+
+    WASM_VECTOR_LEN = offset;
+    return ptr;
+}
+
+function takeFromExternrefTable0(idx) {
+    const value = wasm.__wbindgen_externrefs.get(idx);
+    wasm.__externref_table_dealloc(idx);
+    return value;
+}
+
+let cachedTextDecoder = new TextDecoder('utf-8', { ignoreBOM: true, fatal: true });
+cachedTextDecoder.decode();
+const MAX_SAFARI_DECODE_BYTES = 2146435072;
+let numBytesDecoded = 0;
+function decodeText(ptr, len) {
+    numBytesDecoded += len;
+    if (numBytesDecoded >= MAX_SAFARI_DECODE_BYTES) {
+        cachedTextDecoder = new TextDecoder('utf-8', { ignoreBOM: true, fatal: true });
+        cachedTextDecoder.decode();
+        numBytesDecoded = len;
+    }
+    return cachedTextDecoder.decode(getUint8ArrayMemory0().subarray(ptr, ptr + len));
+}
+
+const cachedTextEncoder = new TextEncoder();
+
+if (!('encodeInto' in cachedTextEncoder)) {
+    cachedTextEncoder.encodeInto = function (arg, view) {
+        const buf = cachedTextEncoder.encode(arg);
+        view.set(buf);
+        return {
+            read: arg.length,
+            written: buf.length
+        };
+    };
+}
+
+let WASM_VECTOR_LEN = 0;
+
+
+let wasm;
+export function __wbg_set_wasm(val) {
+    wasm = val;
+}